Academic
Publications
Efficient Signature Generation by Smart Cards

Efficient Signature Generation by Smart Cards,10.1007/BF00196725,Journal of Cryptology,Claus-peter Schnorr

Efficient Signature Generation by Smart Cards   (Citations: 997)
BibTex | RIS | RefWorks Download
We present a new public-key signature scheme and a corresponding authentication scheme that are based on discrete logarithms in a subgroup of units in Zp where p is a sufficiently large prime, e.g., p = 2512. A key idea is to use for the base of the discrete logarithm an integer a in Zp such that the order of a is a sufficiently large prime q, e.g., q = 2140. In this way we improve 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. We present an efficient algorithm that preprocesses the exponentiation of a random residue modulo p.
Journal: Journal of Cryptology - JOC , vol. 4, no. 3, pp. 161-174, 1991
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...The proof protocol in Fig. 1 is a combination of proof of knowledge of discrete logarithm [36] and proof of equality of discrete logarithms [8], two well-known andfrequentlyemployedZKproofprimitives.Assoundnessofthetwoproofprimitiveshavebeenprovedbytheir original authors, soundness of the protocol illustrated in Fig. 1 is straightforward...

    Kun Penget al. Modification and optimisation of a shuffling scheme: stronger security...

    • ...We use several existing results to prove statements about discrete logarithms, such as, proofs of knowledge of a discrete logarithm [15] and proofs of knowledge of the equality of elements in different representations [16]...

    Klaus Kursaweet al. Privacy-Friendly Aggregation for the Smart-Grid

    • ...We use known zero-knowledge and witness indistinguishable techniques for proving statements about discrete logarithms and their natural extensions to proving statements about bilinear groups, such as (1) proof of knowledge of a discrete logarithm modulo a prime [37] and (2) proof of the disjunction or conjunction of any two statements [16]...

    Matthew Greenandet al. Practical Adaptive Oblivious Transfer from Simple Assumptions

    • ...We use several existing results to prove statements about discrete logarithms: proof of knowledge of a discrete logarithm [9]; proof of knowledge of the equality of elements in different representations [10]; proof with interval checks [11], range proof [12] and proof of the disjunction or conjunction of any two of the previous [13]...

    George Daneziset al. Differentially Private Billing with Rebates

    • ...Michels and Stadler in [27] proposed a stateless CUS scheme based on Schnorr’s signature [34], and proved its security in the random oracle model...

    Qiong Huanget al. Short Convertible Undeniable Signature in the Standard Model

Sort by: