Efficient Identification and Signatures for Smart Cards

  title={Efficient Identification and Signatures for Smart Cards},
  author={Claus-Peter Schnorr},
  • C. Schnorr
  • Published in CRYPTO 20 August 1989
  • Computer Science, Mathematics
We present an efficient interactive identification scheme and a related signature scheme that are based on discrete logarithms and which are particularly suited for smart cards. Previous cryptoschemes, based on the discrete logarithm, have been proposed by El Gamal (1985), Chaum, Evertse, Graaf (1988), Beth (1988) and Gunter (1989). The new scheme comprises the following novel features. 

Efficient Zero-Knowledge Identification Schemes for Smart Cards

This work presents very efficient new zero-knowledge schemes in a general algebraic setting and discusses how this scheme can be used for identification, in particular as an electronic passport scheme.

Efficient signature generation by smart cards

  • C. Schnorr
  • Computer Science, Mathematics
    Journal of Cryptology
  • 2004
An efficient algorithm that preprocesses the exponentiation of a random residue modulo p is presented, which improves the ElGamal signature scheme in the speed of the procedures for the generation and the verification of signatures and also in the bit length of signatures.

New digital signature scheme based on discrete logarithm

A new digital signature scheme is developed based on solving the discrete logarithm problem that is both efficient and easily implemented and efficient for smart card applications.

Cryptanalysis of Two Identification Schemes

This paper cryptanalyze two identification schemes and shows that they are not secure against impersonation under passive attack, and proposes a fix for one of the schemes to upgrade their security to secure under passive, active and concurrent attacks.

Security Proofs for Identity-Based Identification and Signature Schemes

This paper provides either security proofs or attacks for a large number of identity-based identification and signature schemes defined either explicitly or implicitly in existing literature, and a framework that enables modular security analyses, thereby helping to understand, simplify and unify previous work.

The Composite Discrete Logarithm and Secure Authentication

Chaum wanted to create an electronic version of money, with similar properties, namely bank certification and users’ anonymity, so he proposed the concept of blind signatures.

A Secure Blind Signature Scheme for Computation Limited Users

This manuscript presents a fast blind signature scheme with extremely low computation for users. Only several modular additions and multiplications are required for a user to obtain and verify a

MiniPASS: Authentication and Digital Signatures in a Constrained Environment

We describe an implementation of the PASS polynomial authentication and signature scheme [5,6] that is suitable for use in highly constrained environments such as smart cards and wireless

Lossy identification schemes from decisional RSA

  • Shingo HasegawaShuji Isobe
  • Computer Science, Mathematics
    2014 International Symposium on Information Theory and its Applications
  • 2014
This paper proposes a new construction of lossy identification scheme from the decisional RSA assumption which are introduced by Groth, and has efficient response algorithm because it requires no modular exponentiation.

Security Proofs for Identity-Based Identification and Signature Schemes

A framework that on the one hand helps explain how these schemes are derived and on the other hand enables modular security analyses, thereby helping to understand, simplify, and unify previous work is provided.



An Improvement of the Fiat-Shamir Identification and Signature Scheme

An improvement of this scheme which reduces the verifier's complexity to less than 2 modular multiplications and leaves the prover's complexity unchanged is described.

A public key cryptosystem and a signature scheme based on discrete logarithms

  • Taher El Gamal
  • Computer Science, Mathematics
    IEEE Trans. Inf. Theory
  • 1984
A new signature scheme is proposed, together with an imple- mentation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.

How to Prove Yourself: Practical Solutions to Identification and Signature Problems

Simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys are described.

Efficient Zero-Knowledge Identification Scheme for Smart Cards

  • T. Beth
  • Computer Science, Mathematics
  • 1988
In this paper, a Fiat-Shamir like authentication protocol for the El-Gamal Scheme is presented and it is shown that this protocol can be used for e.g. solving the challenge of verifying the identity of an authenticated party.

A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory

This paper proposes a new scheme which requires the storage of only one authentication number in each security microprocessor and the check ofonly one witness number, and the needed computations are only 2 or 3 more than for the scheme of Fiat-Shamir.


  • M. Rabin
  • Mathematics, Computer Science
  • 1979
It is proved that for any given n, if the authors can invert the function y = E (x1) for even a small percentage of the values y then they can factor n, which seems to be the first proved result of this kind.

A public key cryptosystem and a signature scheme based on discrete logarithms

The invention pertains to a novel method of forming a flexible, tapered end on a thermoplastic molding strip that is flexible and virtually free of residual stress which may cause a strip to delaminate when applied to a desired substratum.

An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations

It is proved that the sequential versions of these protocols do not reveal any "knowledge" about the discrete logarithm(s) in a well-defined sense, provided that A knows (a multiple of) the order of α.

The knowledge complexity of interactive proof-systems

A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity.

Zero knowledge proofs of identity

A novel scheme is described which is provably secure if factoring is difficult and whose practical implementations are about two orders of magnitude faster than RSA-based identification schemes.