An identification scheme provably secure against reset attack

DOI10.1007/3-540-45600-7_31MaRDI QIDQ4473605zbMATH OpenFDO

Authors Chan-Hee Lee, Xiaotie Deng, Huafei Zhu

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2229/22290271.htm

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Identification protocols secure against reset attacks
• An efficient identification protocol secure against concurrent-reset attacks
• Reset-secure identity-based identification schemes without pairings
• scientific article; zbMATH DE number 4123668
• On the security of a practical identification scheme
• On the security of a practical identification scheme
• scientific article; zbMATH DE number 708798
• A provable secure pairing-free certificateless identification scheme
• An Efficient and Provable Secure Identity-Based Identification Scheme in the Standard Model

Cited in

(6)

• Identification protocols secure against reset attacks
• A new ID-based identification scheme
• Reset-secure identity-based identification schemes without pairings
• An efficient identification protocol secure against concurrent-reset attacks
• GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks
• Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks

This page was built for publication: An identification scheme provably secure against reset attack

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473605)