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

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

Journal on Communications ›› 2015, Vol. 36 ›› Issue (9): 82-90.doi: 10.11959/j.issn.1000-436x.2015246

• academic paper • Previous Articles Next Articles

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

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

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

Figures/Tables 1

协议	握手计算开销	握手通信开销/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轮

References 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.

Metrics

Recommended 0

No Suggested Reading articles found!

New affiliation-hiding authenticated key exchange protocol

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 1

References 19

Related Articles 3

Metrics

Recommended 0

[1]	Xiao-wei LI,Deng-qi YANG,Ben-hui CHEN,Yu-qing ZHANG. Two-factor authenticated key agreement protocol based on biometric feature and password [J]. Journal on Communications, 2017, 38(7): 89-95.
[2]	Hang SU,Jian-wei LIU,Rui TAO. Hierarchical certificateless authenticated key agreement protocol [J]. Journal on Communications, 2016, 37(7): 161-171.
[3]	Xiao-fen WANG,Yuan CHEN,Guo-zhen XIAO. Analysis and improvement of an ID-based authenticated key agreement protocol [J]. Journal on Communications, 2008, 29(12): 16-21.