GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks
By Mihir Bellare, Adriana Palacio. Annual International Cryptology Conference, 2002
415 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/495674d2e9de951263b0e06143b9a71932e1442e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Dan Boneh
- Anna Lysyanskaya
- Jan Camenisch
- Susan Hohenberger
- Rafael Pass
- David Pointcheval
- Mihir Bellare
- Yevgeniy Dodis
In Computer Vision and Pattern Recognition
- Mihir Bellare
- Chanathip Namprempre
- Gregory Neven
- David Pointcheval
- Yevgeniy Dodis
- Ran Canetti
- Rafael Pass
- Michael Semanko
Citations in the corpus
- Universally Composable Security with Global Setup (2007, methodology): “Our reduction will make use of the Reset Lemma of [8].”
- The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme (2003, methodology): “Since the one-more-inversion problems were introduced in the preliminary version of this paper [4], they have found numerous other uses: – Bellare and Palacio [6] prove that the GQ identification scheme [19] is secure against impersonation under active (and concurrent) attack under the assumption th”
- Compact E-Cash (2005, background): “These schemes allow a user to efficiently obtain a signature on committed messages from the signer.”
- Simple Schnorr multi-signatures with applications to Bitcoin (2019, background): “Revisions A preliminary version of this paper, dated January 15, 2018, proposed a 2-round variant ofMuSig, where the initial commitment round is omitted, claiming provable security under the One More Discrete Logarithm (OMDL) assumption [10,11].”
- Multi-signatures in the plain public-Key model and a general forking lemma (2006, methodology): “) Our Forking Lemma can be viewed as an extension of the Reset Lemma of [8], and our proof, which uses the techniques of the latter, is simpler than that of [40].”
- Authentication and integrity in outsourced databases (2006, background): “Subsequently, it was also proven secure against impersonation under active attacks in [Bellare and Palacio 2002].”
- Security Proofs for Identity-Based Identification and Signature Schemes (2008, methodology): “As one might expect, the proofs of imp-aa and imp-ca security are very similar to the corresponding proofs for the GQ identification scheme [5].”