Efficient and provably secure identification scheme without random oracles

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

中国邮电高校学报(英文) ›› 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]	吕鹏超, 黄俊杰, 刘波. Linear-quadratic optimal control for time-varying descriptor systems via space decompositions [J]. 中国邮电高校学报(英文版), 2023, 30(6): 38-48.
[2]	梁晓林, 马佳旭, 曹旺斌, 徐建鹏, 刘帅奇, 赵雄文 . Characteristics and modeling of UAV-vehicle MIMO wideband channels [J]. 中国邮电高校学报(英文版), 2023, 30(6): 60-67.
[3]	梁晓林, 戎展毅, 曹旺斌, 刘帅奇, 赵雄文. Performance analysis of different coding schemes for wideband vehicle-to-vehicle MIMO systems [J]. 中国邮电高校学报(英文版), 2023, 30(6): 89-98.
[4]	牛耀辉李秀萍赵文禹. Review of reader antennas for UHF RFID systems[J]. 中国邮电高校学报(英文版), 2023, 30(5): 72-92.
[5]	Zhang Jiangbo, Zheng Jiali, Quan Yixuan, Lin Zihan, Xie Xiaode. Improved sparrow search algorithm for RFID network planning[J]. 中国邮电高校学报(英文版), 2023, 30(1): 93-102.
[6]	谢孝德郑嘉利林子涵何思怡冯敏瑜. Random mating mayfly algorithm for RFID network planning[J]. 中国邮电高校学报(英文版), 2022, 29(5): 40-50.
[7]	林子涵郑嘉利谢孝德冯敏瑜何思怡. RFID network planning based on improved brain storm optimization algorithm[J]. 中国邮电高校学报(英文版), 2022, 29(5): 30-39.
[8]	晁浩连卫芳刘永利. Spatiotemporal emotion recognition based on 3D time-frequency domain feature matrix[J]. 中国邮电高校学报(英文版), 2022, 29(5): 62-72.
[9]	张承畅徐余杨建鹏李晓梦. Automatic modulation classification based on AlexNet with data augmentation[J]. 中国邮电高校学报(英文版), 2022, 29(5): 51-61.
[10]	李富澄邓军勇朱筠罗佳莹任含. TSR: algorithm of image hole-filling based on three-step repairing[J]. 中国邮电高校学报(英文版), 2022, 29(5): 83-91.
[11]	Han Yushan, Che Bichen, Liu Jiali, Dou Zhao, Di Junyu. Nearly universal and efficient quantum secure multi-party computation protocol[J]. 中国邮电高校学报(英文版), 2022, 29(4): 51-68.
[12]	Wang Jian, Qiao Kuoyuan, Yuan Yanlei, Liu Xiaole, Yang Jian. Adaptive learning path recommendation model for examination-oriented education[J]. 中国邮电高校学报(英文版), 2022, 29(4): 77-88.
[13]	Li Qinghua, Wang Jiahui, Li Haiming, Feng Chao. HQD-RRT*: a high-quality path planner for mobile robot in dynamic environment[J]. 中国邮电高校学报(英文版), 2022, 29(3): 69-80.
[14]	Zhang Ping, Xu Xiaodong, Dong Chen, Han Shujun, Wang Bizhu. Intellicise communication system: model-driven semantic communications[J]. 中国邮电高校学报(英文版), 2022, 29(1): 2-12.
[15]	Sun Heng, Qiao Xiuquan. Augmented reality-based BIM multi-user collaboration system[J]. 中国邮电高校学报(英文版), 2022, 29(1): 71-80.

Efficient and provably secure identification scheme without random oracles

Efficient and provably secure identification scheme without random oracles

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价