An efficient identification protocol secure against concurrent-reset attacks
From MaRDI portal
Publication:3558751
DOI10.1515/JMC.2009.021zbMATH Open1185.94067MaRDI QIDQ3558751FDOQ3558751
Publication date: 6 May 2010
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 2080700
- scientific article; zbMATH DE number 1808214
- An efficient and secure two-flow zero-knowledge identification protocol
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
- An Efficient and Provable Secure Identity-Based Identification Scheme in the Standard Model
Cites Work
Cited In (6)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient and secure two-flow zero-knowledge identification protocol
- Sherlock Holmes zero-knowledge protocols
This page was built for publication: An efficient identification protocol secure against concurrent-reset attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558751)