Efficient Identification and Signatures for Smart Cards (Abstract)

By Claus-Peter Schnorr. 1989

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Advances and Open Problems in Federated Learning (2019, background): “There are many ZK constructions that support specific classes of statements, Schnorr proofs [349] and Sigma protocols [128] are examples of such widely used protocols.”
Biscotti: A Ledger for Private and Secure Peer-to-Peer Machine Learning (2018, methodology): “For signing updates, we use the Schnorr signature [46] scheme instead of ECDSA because multiple verifier Schnorr signatures can be aggregated together into one signature [31].”
Security Arguments for Digital Signatures and Blind Signatures (2015, methodology): “Similar security results for other signature schemes like Schnorr’s [50], [51] are considered folklore results but have never appeared in print.”
Privacy and accountability for location-based aggregate statistics (2011, methodology): “For example, Schnorr [39] provided a simple and efﬁcient algorithm for proving possession of a discrete log.”
Post-quantum cryptography (2008, unknown): “DSA-3072 [9, 10] signature 128 broken (Shor)”
Zether: Towards Privacy in a Smart Contract World (2020, methodology): “In the implementation (Section 10), we use Bulletproofs [16] and Schnorr signatures [74], both of which have a trustless setup.”
Formal Proofs for the Security of Signcryption (2002, background): “slight modifications of the schemes in [8] and [19] were proved [18] [15] to be existentially unforgeable against adaptive chosen message attack [12] in the random oracle model.”
Efficient signature generation by smart cards (2004, methodology): “4) The above preprocessing algorithm has been proposed in Schnorr (1990) with k = 8 and with arbitrary numbers a(1), . . . , a(d) ∈ {1, . . . , k} and d ≤ k. De Rooij (1991) has pointed out that this preprocessing is vulnerable if it is possible to choose in round ν all numbers a(1), .”
Security Proofs for Identity-Based Identification and Signature Schemes (2008, methodology): “Additionally, we need to directly analyze two IBI schemes not underlain by cSI schemes, namely the DL-based scheme in [35], and a somewhat more efficient Schnorr-based [42] variant that we introduce.”
An Analysis of RFID Authentication Schemes for Internet of Things in Healthcare Environment Using Elliptic Curve Cryptography (2015, methodology): “Tuyls and Batina [32] adopted Schnorr’s identification protocol [33] and proposed the”
Anonymous credentials light (2013, methodology): “Schnorr’s identiﬁcation scheme works as follows: Σ-protocols are an essential building block for blind signatures and anonymous credentials.”
An Efficient Conditional Privacy-Preserving Authentication Scheme for Vehicular Sensor Networks Without Pairings (2016, methodology): “Since the extract algorithm of our identity-based signature scheme is based on Schnorr’s signature scheme [36], it is secure against adaptive chosen identity attacks.”
How to Securely Outsource Cryptographic Computations (2005, methodology): “In the one-malicious model, the algorithms (T, (U1, U2)) in Figure 1 are (1) an (O( log 2 n n ), 1 2 )-outsource-secure implementation of Exp, (2) an (O( log 2 n n ), 7 8 )-outsource-secure implementation of the Cramer-Shoup cryptosystem [13], and (3) an (O( log 2 n n ), 3 4 )-outsource-secure imple”