An efficient identification protocol secure against concurrent-reset attacks
From MaRDI portal
Publication:3558751
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
(7)- Sherlock Holmes zero-knowledge protocols
- An efficient and secure two-flow zero-knowledge identification protocol
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack
- scientific article; zbMATH DE number 2080700 (Why is no real title available?)
- scientific article; zbMATH DE number 1808214 (Why is no real title available?)
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)