Efficient signature generation by smart cards

By Claus-Peter Schnorr. 2004

2,715 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering

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

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Prio: Private, Robust, and Scalable Computation of Aggregate Statistics (2017, background): “In contrast, a state-of-the-art comparison system that uses client-generated non-interactive zero-knowledge proofs of correctness (NIZKs) [22, 103] imposes a 267× slowdown at the servers.”
Practical Private Set Intersection Protocols with Linear Complexity (2010, methodology): “[11] gives three PPIT protocols, based respectively on: RSA [23], Schnorr [24], and Identity-based Encryption (IBE) [4].”
Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks (2004, methodology): “For example, by using Schnorr’s identification scheme [39], together with our techniques, we obtain a very efficient concurrently secure identification scheme under both the discrete log and Strong RSA Assumption.”
Advances in Cryptology – CRYPTO 2004 (2004, background): “Most notably, those are the RSA [34], the Fiat-Shamir [21], and the Schnorr [36] signature schemes.”
Privacy-preserving smart metering (2011, methodology): “We use several existing results to prove statements about discrete logarithms: proof of knowledge of a discrete logarithm [37]; proof of knowledge of the equality of some element in different representations [13]; proof with interval checks [33], range proof [8] and proof of the disjunction or conju”
Multi-signatures in the plain public-Key model and a general forking lemma (2006, methodology): “Our scheme is based on the Schnorr signature scheme [42], but our techniques can be applied to other schemes following the Fiat-Shamir paradigm as well.”
Efficient Protocols for Set Membership and Range Proofs (2008, background): “1 Schnorr proof Schnorr proofs are the first efficient Σ-protocols proposed, even though they were not introduced as such in [16].”
Instantaneous Decentralized Poker (2017, methodology): “Since the set of parties that interacts with F ∗ MSFE is ﬁxed, they can deploy the Schnorr [45] based multisignature scheme of Micali, Ohta and Reyzin [36].”
Universal Re-encryption for Mixnets (2004, background): “For ciphertext C = [( 0; 0); ( 1; 1)], this may take the form of a non-interactive zero-knowledge proof of knowledge of an exponent x such that 1 = x 1 { essentially a Schnorr signature [34].”
Civitas: Toward a Secure Voting System (2008, background): “The ﬁrst is a proof of knowledge of a discrete logarithm due to Schnorr [83].”
A Smart Contract for Boardroom Voting with Maximum Voter Privacy (2017, methodology): “ZKP (xi) is implemented as a Schnorr proof [32] made non-interactive using the Fiat-Shamir heuristic [15].”
Zerocoin: Anonymous Distributed E-Cash from Bitcoin (2013, methodology): “Our protocols use zero-knowledge proofs that can be instantiated using the technique of Schnorr [18], with extensions due to e.”
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives (2017, background): “, discrete logarithms [28, 80] or equations over bilinear groups [51].”
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols (2010, background): “The Σ-protocol allows to efficiently prove knowledge of preimages under homomorphisms with a finite domain [13,43].”
Dining Cryptographers Revisited (2004, background): “As explored in many papers, these techniques permit honest-verifier zero-knowledge proof of knowledge of discrete logs [20], proof of equivalence of discrete logs [12], and first-order logical statements on such statements [9].”