Efficient strong privacy protection and transferable attribute-based ticket scheme

被引:0
|
作者
Feng H. [1 ,2 ]
Shi R. [1 ,2 ]
Yuan F. [3 ]
Li Y. [4 ]
Yang Y. [5 ]
机构
[1] School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing
[2] Institute of Information Security, Beijing Electronic Science and Technology Institute, Beijing
[3] Institute 706, Second Academy of CASIC, Beijing
[4] The 15th Research Institute of CETC, Beijing
[5] College of Mathematics and Computer Science, Fuzhou University, Fuzhou
来源
基金
国家重点研发计划;
关键词
Anonymous credential; Attribute-based ticket; Privacy protection; Structure-preserving signature;
D O I
10.11959/j.issn.1000-436x.2022053
中图分类号
学科分类号
摘要
To solve the problems of efficiency, flexibility, and privacy protection faced by electronic tickets, an efficient and transferable attribute-based ticket scheme with strong privacy protection was proposed. Firstly, a ticket issuing algorithm based on attribute disclosure was constructed by combining attribute-based credentials and set commitment. Secondly, the structure-preserving signature on equivalence class and dynamic malleable signature were used to reduce the computational complexity of the ticket issuance, and the ticket transfer and ticket verification with constant complexity were realized. In addition, to prevent the possibility of malicious verifiers guessing user information according to the seller's identity, the scheme not only realized the anonymity of the user, but also realized the anonymity of the seller in the ticket verification for the first time. Finally, the security definition of the scheme was given, and its security was reduced to either well-known complexity cryptography assumptions or the security of proven cryptography primitives. Comparison and experimental results demonstrate that the proposed scheme is flexible and efficient. © 2022, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页码:63 / 75
页数:12
相关论文
共 29 条
  • [1] HAN J G, CHEN L Q, SCHNEIDER S, Et al., Anonymous single sign-on with proxy re-verification, IEEE Transactions on Information Forensics and Security, 15, pp. 223-236, (2020)
  • [2] HAN J G, CHEN L Q, SCHNEIDER S, Et al., Privacy-preserving electronic ticket scheme with attribute-based credentials, IEEE Transactions on Dependable and Secure Computing, 18, 4, pp. 1836-1849, (2021)
  • [3] HEYDT-BENJAMIN T S, CHAE H J, DEFEND B, Et al., Privacy for public transportation, International Workshop on Privacy Enhancing Technologies, pp. 1-19, (2006)
  • [4] CHAUM D., Security without identification: transaction systems to make big brother obsolete, Communications of the ACM, 28, 10, pp. 1030-1044, (1985)
  • [5] VIVES-GUASCH A, PAYERAS-CAPELLA M M, MUT-PUIGSERVER M, Et al., Anonymous and transferable electronic ticketing scheme, Data Privacy Management and Autonomous Spontaneous Security, pp. 100-113, (2014)
  • [6] PAYERAS-CAPELLA M M, MUT-PUIGSERVER M, CASTELLA-ROCA J, Et al., Design and performance evaluation of two approaches to obtain anonymity in transferable electronic ticketing schemes, Mobile Networks and Applications, 22, 6, pp. 1137-1156, (2017)
  • [7] ARFAOUI G, LALANDE J F, TRAORE J, Et al., A practical set-membership proof for privacy-preserving NFC mobile ticketing, Proceedings on Privacy Enhancing Technologies, 2015, 2, pp. 25-45, (2015)
  • [8] CAMENISCH J, LYSYANSKAYA A., An efficient system for non-transferable anonymous credentials with optional anonymity revocation, International Conference on the Theory and Applications of Cryptographic Techniques, pp. 93-118, (2001)
  • [9] LYSYANSKAYA A, RIVEST R L, SAHAI A, Et al., Pseudonym systems, International Workshop on Selected Areas in Cryptography, pp. 184-199, (2000)
  • [10] CHAUM D., Blind signatures for untraceable payments, Advances in Cryptology, pp. 199-203, (1983)