Efficient and provably secure identification scheme without random oracles

doi:10.1016/S1005-8885(08)60182-X

Acta Metallurgica Sinica(English letters) ›› 2009, Vol. 16 ›› Issue (1): 76-80.doi: 10.1016/S1005-8885(08)60182-X

• Artificial Intelligence • 上一篇下一篇

Efficient and provably secure identification scheme without random oracles

李艳平,WANG Yu-min

State Key Laboratory of Integrated Service Network, Xidian University, Xi’an 710071, China

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-02-26
通讯作者: 李艳平

Efficient and provably secure identification scheme without random oracles

LI Yan-ping, WANG Yu-min

State Key Laboratory of Integrated Service Network, Xidian University, Xi’an 710071, China

Received:1900-01-01 Revised:1900-01-01 Online:2009-02-26
Contact: LI Yan-ping

摘要/Abstract

摘要：

The research on the identification scheme is an important and active area in computer and communication security. A series of identification schemes were proposed to improve the efficiency and security of the protocols by various methods. Based on the hardness assumption of the discrete logarithm problem in a gap Diffie-Hellman group and the difficulty of the collusion attack algorithm with k traitors, an efficient identification scheme is presented. Without random oracle models, the proposed scheme is then proved secure against impersonation and reset attacks in both concurrent and reset attack setting. Since the proposed scheme is simple, memory-saving, computation-efficient, and perfectly-secure, it is well suitable for use in smart cards.

关键词:

identification;schemes,;RSA;problem,;bilinear;pairing,;random;oracle;model

Abstract:

Key words:

identification schemes;RSA problem;bilinear pairing;random oracle model

LI Yan-ping, WANG Yu-min. Efficient and provably secure identification scheme without random oracles[J]. Acta Metallurgica Sinica(English letters), 2009, 16(1): 76-80.

参考文献

1. Goldwasser S, Micali S, Rackoff C. The knowledge complexity of interactive proof-systems. Proceedings of the 17th Annual ACM Symposium on Theory of Computing. Providence, Rhode Island, USA, 1985: 291-304

2. Fiat A, Shamir A. How to prove yourself: practical solutions to identification and signature problems. Proceedings of Crypto’ 86. Aug 11-15, 1986, Santa Barbara, CA, USA. Berlin, Germany: Springer-Verlag, 1986: 186-194

3. Guillou L S, Quisquater J J. A practical zero-knowledge protocol fitted to security microprocessors minimizing both transmission and memory. Proceedings of Eurocrypt’88, May 25-27, 1988, Davos, Switzerland. CA, USA. Berlin, Germany: Springer-Verlag, 1988: 123-128

4. Schnorr C P. Efficient identification and signatures for smart cards. Proceedings of Eurocrypt’89, Apr 10-13, 1989, Houthalen, Belgium, CA, USA. Berlin, Germany: Springer-Verlag, 1990: 239-252

5. Bellare M, Palacioy A. GQ and Schnorr identification schemes: proofs of security against impersonation under active and concurrent attacks. Proceedings of Crypto’2002, Aug 18-22, 2002, Santa Barbara, CA, USA, Berlin, Germany: Springer-Verlag, 2002: 167-177

6. Kim M, Kim K. A new identification scheme based on the bilinear Diffie-Hellman group. Information Security and Privacy: Proceedings of 7th Australasian Conference on Information Security and Privacy (ACISP’02), Jul 3-5, 2002, Melbourne, Australia, Berlin, Germany: Springer-Verlag, 2002: 362-378

7. Shao J, Cao Z, Lu R. A new efficient identification scheme based on strong Diffie-Hellman assumption. Proceedings of International Symposium on Future Software Technology (ISFST’04), Oct 20-22, 2004, Xi’an, China, 2004

8. Mitsunari S, Sakai R, Kasahara M. A new traitor tracing. IEICE Transaction. 2002. E85-A(2): 481-484

9. Bellare M, Fischlin M, Goldwasser S, et al. Identification protocols secure against reset attacks. Proceedings of Eurocrypt’01, May 6-10, 2001, Innsbruck (Tyrol), Austria, Berlin, Germany: Springer-Verlag, 2001: 495-511

10. Zhang F G, Rei F, Safavi-Naini R, et al. An efficient signature scheme from bilinear pairings and its applications. Proceedings of 7th International Workshop on Practice and Theory in Public Key Cryptography (PKC’04), Mar 1-4, 2004, Singapore, Berlin, Germany: Springer-Verlag, 2004: 277-290

11. Mao Wenbo. Modern Cryptography: Theory and Practice. Englewood Cliffs, NJ, USA: Prentice Hall, 2003: 75-78

[1]	何明枢, 金磊, 王小娟, 李源. Web log classification framework with data augmentation based on GANs[J]. 中国邮电高校学报(英文版), 2020, 27(5): 34-46.
[2]	商玉洁张乐友高小旭. Continual auxiliary leakage-resilient attribute-based broadcast encryption with constant size ciphertexts [J]. 中国邮电高校学报(英文版), 2020, 27(4): 69-82.
[3]	杨亚涛张卷美黄洁润张亚泽. Improved authenticated key agreement protocol based on Bi-ISIS problem[J]. 中国邮电高校学报(英文版), 2020, 27(3): 93-102.
[4]	Zhao Guosheng, Liao Yuting, Wang Jian. Dynamic trust evaluation model for task participants oriented to mobile crowd sensing[J]. 中国邮电高校学报(英文版), 2020, 27(2): 26-36.
[5]	Tang Xianlun, Chen Yingjie, Xu Jin, Yu Xinxian. Deep global-attention based convolutional network with dense connections for text classification[J]. 中国邮电高校学报(英文版), 2020, 27(2): 46-55.
[6]	金亮曹小鹏. Multi-granularities capture interaction information for text matching accuracy enhancement[J]. 中国邮电高校学报(英文版), 2020, 27(1): 100-108.
[7]	宋成顾心安平源张亚东. Conditional privacy protection authentication scheme based on bilinear pairings for VANET[J]. 中国邮电高校学报(英文版), 2020, 27(1): 62-71.
[8]	梁晓林曹旺斌. Broadband hybrid model for relay-aided cooperative MIMO power line communication systems[J]. 中国邮电高校学报(英文版), 2020, 27(1): 72-80.
[9]	Wang Huan, Liu Ting, Cao Yuning, Wu Aixiang. Underflow concentration prediction model of deep-cone thickener based on data-driven[J]. 中国邮电高校学报(英文版), 2019, 26(6): 63-72.
[10]	Tian Zengshan, Ren Haoliang,Zhou Mu. Adaptive access points deployment for Indoor bluetooth positioning accuracy enhancement[J]. 中国邮电高校学报(英文版), 2019, 26(5): 82-93.
[11]	Gao Miao, Yu Zhiguo, Li Qingqing, Wei Jinghe, Gu Xiaofeng. Improved ECG signal compression method for E-healthcare[J]. 中国邮电高校学报(英文版), 2019, 26(4): 62-69.
[12]	Tang Yongli, Wang Mingming, Ye Qing, Qin Panke, Zhao Zongqu. Lattice-based hierarchical identity-based broadcast encryption scheme in the standard model[J]. 中国邮电高校学报(英文版), 2019, 26(4): 70-79.
[13]	Shi Zhiming, Huang Chengti. Quality of experience models for network video quality[J]. 中国邮电高校学报(英文版), 2019, 26(4): 80-88.
[14]	Wang Dongxing, Qian Xu, Liu Kang, Guan Xinyu. Novel wolf pack optimization algorithm for intelligent medical treatment personalized recommendation[J]. 中国邮电高校学报(英文版), 2018, 25(6): 44-57.
[15]	宋成张亚东王磊刘志中. Research on k-anonymity privacy protection scheme based on bilinear pairings [J]. 中国邮电高校学报(英文版), 2018, 25(5): 12-19.

Efficient and provably secure identification scheme without random oracles

Efficient and provably secure identification scheme without random oracles

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价