Identification protocols secure against reset attacks

DOI10.1007/3-540-44987-6_30MaRDI QIDQ3149676zbMATH OpenFDO

Authors M. Bellare, Silvio Micali, Marc Fischlin, Shafi Goldwasser

Publication date 30 September 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44987-6_30

zbMATH Keywords

identification protocols

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• An efficient identification protocol secure against concurrent-reset attacks
• scientific article; zbMATH DE number 2080700
• Resettable zero-knowledge (extended abstract)
• An efficient and secure two-flow zero-knowledge identification protocol
• Resettably Secure Computation

Cited in

(12)

• On the bit security of cryptographic primitives
• Subversion-resilient signatures: definitions, constructions and applications
• Continuously non-malleable codes in the split-state model
• Improved OR-composition of sigma-protocols
• Concurrent non-malleable commitments (and more) in 3 rounds
• New constructions of efficient simulation-sound commitments using encryption and their applications
• Identification schemes from key encapsulation mechanisms
• An efficient identification protocol secure against concurrent-reset attacks
• Parallel and Concurrent Security of the HB and HB +  Protocols
• scientific article; zbMATH DE number 2080700 (Why is no real title available?)
• Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
• Sherlock Holmes zero-knowledge protocols secure against active attackers

This page was built for publication: Identification protocols secure against reset attacks

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