如何向多方证明自己:节能多组认证

T. Halford
{"title":"如何向多方证明自己:节能多组认证","authors":"T. Halford","doi":"10.1109/MILCOM.2013.49","DOIUrl":null,"url":null,"abstract":"Zero-knowledge identification (ZKI) schemes have been studied extensively in the cryptology literature and are currently being used commercially for radio frequency identification (RFID) authentication. Much like the public key cryptosystems that may be used to ensure message confidentiality, ZKI schemes rely on the hardness of certain problems -- e.g., factoring the product of large primes -- to provide secure authentication. In this paper, we extend existing ZKI schemes based on error-correcting codes to support multi-group authentication. In particular, we propose two schemes that enable a prover to simultaneously authenticate its membership in M ≥ 1 groups. The proposed multi-group authentication protocols are of particular relevance to military ad hoc networks, where group communications is the norm and energy efficiency is a critical performance metric.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"13 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"How to Prove Yourself to Multiple Parties: Energy-Efficient Multi-group Authentication\",\"authors\":\"T. Halford\",\"doi\":\"10.1109/MILCOM.2013.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Zero-knowledge identification (ZKI) schemes have been studied extensively in the cryptology literature and are currently being used commercially for radio frequency identification (RFID) authentication. Much like the public key cryptosystems that may be used to ensure message confidentiality, ZKI schemes rely on the hardness of certain problems -- e.g., factoring the product of large primes -- to provide secure authentication. In this paper, we extend existing ZKI schemes based on error-correcting codes to support multi-group authentication. In particular, we propose two schemes that enable a prover to simultaneously authenticate its membership in M ≥ 1 groups. The proposed multi-group authentication protocols are of particular relevance to military ad hoc networks, where group communications is the norm and energy efficiency is a critical performance metric.\",\"PeriodicalId\":379382,\"journal\":{\"name\":\"MILCOM 2013 - 2013 IEEE Military Communications Conference\",\"volume\":\"13 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MILCOM 2013 - 2013 IEEE Military Communications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.2013.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 2013 - 2013 IEEE Military Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2013.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

零知识识别(ZKI)方案在密码学文献中得到了广泛的研究,目前正在商业上用于射频识别(RFID)认证。与可用于确保消息机密性的公钥密码系统非常相似,ZKI方案依赖于某些问题的难度——例如,分解大素数的乘积——来提供安全的身份验证。在本文中,我们扩展了现有的基于纠错码的ZKI方案,以支持多组认证。特别是,我们提出了两种方案,使证明者能够同时验证其在m&ge中的成员身份;1组。提出的多组认证协议与军事特设网络特别相关,其中组通信是规范,能源效率是关键的性能指标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
How to Prove Yourself to Multiple Parties: Energy-Efficient Multi-group Authentication
Zero-knowledge identification (ZKI) schemes have been studied extensively in the cryptology literature and are currently being used commercially for radio frequency identification (RFID) authentication. Much like the public key cryptosystems that may be used to ensure message confidentiality, ZKI schemes rely on the hardness of certain problems -- e.g., factoring the product of large primes -- to provide secure authentication. In this paper, we extend existing ZKI schemes based on error-correcting codes to support multi-group authentication. In particular, we propose two schemes that enable a prover to simultaneously authenticate its membership in M ≥ 1 groups. The proposed multi-group authentication protocols are of particular relevance to military ad hoc networks, where group communications is the norm and energy efficiency is a critical performance metric.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信