新型组织隐藏的认证密钥交换协议

doi:10.11959/j.issn.1000-436x.2015246

通信学报 ›› 2015, Vol. 36 ›› Issue (9): 82-90.doi: 10.11959/j.issn.1000-436x.2015246

新型组织隐藏的认证密钥交换协议

温雅敏^1,²,龚征^3,⁴()

¹ 广东财经大学数学与统计学院，广东广州 510320
² 上海市信息安全综合管理技术研究重点实验室，上海 200240
³ 华南师范大学计算机学院，广东广州510631
⁴ 中国科学院信息工程研究所信息安全国家重点实验室，北京 100093

出版日期:2015-09-25 发布日期:2017-09-15
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目;广东省自然科学基金资助项目;广东省自然科学基金资助项目;广东省自然科学基金资助项目;广东省高等学校优秀青年教师培养计划基金资助项目;广州市珠江科技新星专项基金资助项目;上海市信息安全综合管理技术研究重点实验室开放课题基金资助项目

New affiliation-hiding authenticated key exchange protocol

Ya-min WEN^1,²,Zheng GONG^3,⁴()

¹ School of Mathematics and Statistics,Guangdong University of Finance and Economics,Guangzhou 510320,China
² Shanghai Key Laboratory of Integrated Administration Technologies for Information Security,Shanghai 200240,China
³ School of Computer Science,South China Normal University,Guangzhou 510631,China
⁴ State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China

Online:2015-09-25 Published:2017-09-15
Supported by:
The National Natural Sciences Foundation of China;The National Natural Sciences Foundation of China;The Natural Science Foundation of Guangdong Province;The Natural Science Foundation of Guangdong Province;The Natural Science Foundation of Guangdong Province;The Foundation for Distinguished Young Teachers in Higher Education of Guangdong Province;The Project of Science and Technology New Star of Guangzhou Pearl River;The Opening Project of Shanghai Key Laboratory of Integrated Administration Technologies for Information Security

摘要/Abstract

摘要：

提出了一个实现组织集合交集认证策略的新型组织隐藏的密钥协商协议，2个匿名用户从属的组织集合存在交集且元素个数至少为一个门限值时可以完成一次成功的秘密认证和密钥协商，同时保证集合交集之外的组织信息机密性。新协议在随机预言机模型下可证安全，并且在计算和通信性能上仍具备一定的优势。

关键词: 组织隐藏, 认证密钥交换, 秘密握手, 集合交集, 可关联性

Abstract:

A new affiliation-hiding authenticated key agreement protocol was proposed.The proposal enables two anonymous users to accomplish a successful secret authentication and key agreement when their groups set intersection is non-empty and the cardinality of the set intersection should not be less than a threshold value.Meanwhile,the affiliations of groups outside of the set intersection remain confidential.The proposal is provably secure under the random oracle model,and the performance of the scheme is still competitive.

Key words: affiliation-hiding, authenticated key agreement, secret handshakes, set intersection, link ability

温雅敏,龚征. 新型组织隐藏的认证密钥交换协议[J]. 通信学报, 2015, 36(9): 82-90.

Ya-min WEN,Zheng GONG. New affiliation-hiding authenticated key exchange protocol[J]. Journal on Communications, 2015, 36(9): 82-90.

图/表 1

表1

参考文献 19

[1]	JARECKI S , KIM J , TSUDIK G . Group secret handshakes or affilia-tion-hiding authenticated group key agreement[A]. Proceeding of CT-RSA 2007[C]. San Francisco,CA,USA, 2007.287-308.
[2]	JARECKI S , KIM J , TSUDIK G . Beyond secret handshakes:affilia-tion-hiding authenticated key exchange[A]. Proceeding of CT-RSA 2008[C]. San Francisco,CA,USA, 2008.352-369.
[3]	BALFANZ D , DURFEE G , SHANKAR N , et al. Secret handshakes from pairing-based key agreements[A]. Proceeding of IEEE Sympo-sium on Security and Privacy[C].Berkeley,California,USA,IEEE Computer Society, 2003.180-196.
[4]	CASTELLUCCIA C , JARECKI S , TSUDIK G . Secret handshakes from ca-oblivious encryption[A]. Proceedings of ASIACRYPT 2004[C]. Jeju Island,Korea, 2005.293-307.
[5]	ZHOU L , SUSILO W , MU Y . Three-round secret handshakes based on ElGamal and DSA[A]. Proceedings of ISPEC 2006[C]. Hang-zhou,China, 2006.332-342.
[6]	VERGNAUD D . RSA-based secret handshakes[A]. Proceedings of International Workshop of Coding and Cryptography (WCC 2005)[C]. Bergen,Norway, 2005.252-274.
[7]	XU S H , YUNG M . K-anonymous secret handshakes with reusable credentials[A]. Proceedings of ACM Conference on Computer and Communications Security (CCS 2004)[C]. Washington DC,USA, 2004.158-167.
[8]	JARECKI S , LIU X M . Unlinkable secret handshakes and key-private group key management schemes[A]. Proceedings of ACNS 2007[C]. Zhuhai,China, 2007.270-287.
[9]	WEN Y M , ZHANG F G , XU L L . Unlinkable secret handshakes from message recovery signature[J]. Chinese Journal of Electronics, 2010,19(4): 705-709.
[10]	GU J , XUE Z . An improved efficient secret handshakes scheme with unlinkability[J]. IEEE Communication Letters, 2011,15(2): 259-261.
[11]	ATENIESE G , BLANTON M , KIRSCH J . Secret handshakes with dynamic and fuzzy matching[A]. Proceedings of Network and Distrib-uted System Security Symposium(NDSS 2007)[C]. San Diego,Cali-fornia,USA, 2007.159-177.
[12]	SORNIOTTI A , MOLVA R . Secret handshakes with revocation sup-port[A]. Proceedings of ICISC 2009[C]. Seoul,Korea, 2009.274-299.
[13]	SORNIOTTI A , MOLVA R . A provably secure secret handshake with dynamic controlled matching[J]. Computers &Security, 2010,29(5): 619-627.
[14]	SORNIOTTI A , MOLVA R . Federated secret handshakes with support for revocation[A]. Proceedings of ICICS 2010[C]. Barcelona,Spain, 2010.218-234.
[15]	MANULIS M , PINKAS B , POETTERING B . Privacy-preserving group discovery with linear complexity[A]. Proceedings of ACNS 2010[C]. Beijing,China, 2010.420-437.
[16]	BRANDS S . An Efficient off-line Electronic Cash System Based on the Representation Problem[R]. Technical Report CS-R9323,CWI (Centre for Mathematics and Computer Science) Amsterdam,the Netherlands, 1993.
[17]	BELLARE M , CANETTI R , KRAWCZYK H . A modular approach to the design and analysis of authentication and key exchange protocols (Extended Abstract)[A]. The ACM Symposium on Theory of Com-puting (STOC)[C]. San Francisco,CA,USA, 1998.419-428.
[18]	SCHNORR C . Efficient identification and signatures for smart cards[A]. Proceeding of CRYPT0 1989[C]. Santa Barbara,CA,USA, 1989.239-252.
[19]	POINTCHEVAL D , STERN J . Security proofs for signature schemes[A]. Proceedings of EUROCRYPT 1996[C]. Saragossa,Spain, 1996.387-398.

协议	握手计算开销	握手通信开销/bit	困难性假设	组织发现	轮数
文献[3]	4T_p	4κ	双线性Diffie-Hellman	单个组织	3轮
文献[4]	4T_e	4κ+6\|p\|	计算Diffie-Hellman	单个组织	4轮
文献[2]	$2 (\| {\tilde{G}}_{A} \| + \| {\tilde{G}}_{B} \|) T_{c}$	$2 \| 2 κ' + κ \| (\| {\tilde{G}}_{A} \| + \| {\tilde{G}}_{B} \|)$	RSA	组织交集非空	4轮
本文	$(\| {\tilde{G}}_{A} \| + \| {\tilde{G}}_{B} \|) T_{c}$	$2 \| q \| (\| {\tilde{G}}_{A} \| + \| {\tilde{G}}_{B} \|)$	DLP	d个组织交集	3轮

新型组织隐藏的认证密钥交换协议

New affiliation-hiding authenticated key exchange protocol

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 1

参考文献 19

相关文章 4

Metrics

推荐阅读 0

[1]	尹安琪, 郭渊博, 汪定, 曲彤洲, 陈琳. 可证明安全的抗量子两服务器口令认证密钥交换协议[J]. 通信学报, 2022, 43(3): 14-29.
[2]	郭渊博, 尹安琪. 基于格的口令认证密钥交换协议综述[J]. 通信学报, 2022, 43(12): 172-187.
[3]	周长利,田晖,马春光,杨松涛. 路网环境下基于伪随机置换的LBS隐私保护方法研究[J]. 通信学报, 2017, 38(6): 19-29.
[4]	李文敏,温巧燕,张华. 基于验证元的三方口令认证密钥交换协议[J]. 通信学报, 2008, 29(10): 149-152.