Indexed by:
Abstract:
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.
Keyword:
Reprint 's Address:
Email:
Source :
Journal on Communications
ISSN: 1000-436X
CN: 11-2102/TN
Year: 2022
Issue: 3
Volume: 43
Page: 63-75
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 2
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 1
Affiliated Colleges: