Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(7)
Digital Signature
Discrete Logarithm
Efficient Algorithm
Oneway Function
Public Key
Signature Scheme
Smart Card
Related Publications
(114)
How to Prove Yourself: Practical Solutions to Identification and Signature Problems
Wallet Databases with Observers
A Method for Obtaining Digital Signatures and PublicKey Cryptosystems (Reprint)
A public key cryptosystem and a signature scheme based on discrete logarithms
Proving in ZeroKnowledge that a Number Is the Product of Two Safe Primes
Subscribe
Academic
Publications
Efficient Signature Generation by Smart Cards
Efficient Signature Generation by Smart Cards,10.1007/BF00196725,Journal of Cryptology,Clauspeter Schnorr
Edit
Efficient Signature Generation by Smart Cards
(
Citations: 997
)
BibTex

RIS

RefWorks
Download
Clauspeter Schnorr
We present a new publickey
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. 161174, 1991
DOI:
10.1007/BF00196725
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.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.informatik.unitrier.de
)
More »
Citation Context
(651)
...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 wellknown andfrequentlyemployedZKproofprimitives.Assoundnessofthetwoproofprimitiveshavebeenprovedbytheir original authors, soundness of the protocol illustrated in Fig. 1 is straightforward...
Kun Peng
,
et 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 Kursawe
,
et al.
PrivacyFriendly Aggregation for the SmartGrid
...We use known zeroknowledge 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 Greenand
,
et 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 Danezis
,
et 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 Huang
,
et al.
Short Convertible Undeniable Signature in the Standard Model
References
(9)
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
(
Citations: 408
)
Taher El Gamal
Conference:
International Crytology Conference  CRYPTO
, pp. 1018, 1984
Zero knowledge proofs of identity
(
Citations: 458
)
U. Fiege
,
Amos Fiat
,
Adi Shamir
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 210217, 1987
The knowledge complexity of interactive proof systems
(
Citations: 1357
)
Shafi Goldwasser
,
Silvio Micali
,
Charles Rackoff
Journal:
Siam Journal on Computing  SIAMCOMP
, vol. 18, no. 1, pp. 186208, 1985
Discrete Logarithms in GF(P) Using the Number Field Sieve
(
Citations: 129
)
Daniel M. Gordon
Journal:
Siam Journal on Discrete Mathematics  SIAMDM
, vol. 6, no. 1, pp. 124138, 1993
The number field sieve
(
Citations: 119
)
Arjen K. Lenstra
,
Hendrik W. Lenstra Jr.
,
Mark S. Manasse
,
John M. Pollard
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 564572, 1990
Sort by:
Citations
(997)
Modification and optimisation of a shuffling scheme: stronger security, formal analysis and higher efficiency
(
Citations: 2
)
Kun Peng
,
Ed Dawson
,
Feng Bao
Journal:
International Journal of Information Security
, vol. 10, no. 1, pp. 3347, 2011
PrivacyFriendly Aggregation for the SmartGrid
(
Citations: 2
)
Klaus Kursawe
,
George Danezis
,
Markulf Kohlweiss
Published in 2011.
Achieving nontransferability in credential systems using hidden biometrics
(
Citations: 2
)
Carlisle Adams
Journal:
Security and Communication Networks
, vol. 4, no. 2, pp. 195206, 2011
Practical Adaptive Oblivious Transfer from Simple Assumptions
(
Citations: 2
)
Matthew Greenand
,
Susan Hohenberger
Conference:
Theory of Cryptography
, pp. 347363, 2011
Significance of biological effects on phosphorus transformation processes at the water–sediment interface under different environmental conditions
(
Citations: 1
)
Yichao Qian
,
Xinqiang Liang
,
Yingxu Chen
,
Liping Lou
,
Xinyi Cui
,
Jie Tang
,
Pengfei Li
,
Rukun Cao
Journal:
Ecological Engineering  ECOL ENG
, vol. 37, no. 6, pp. 816825, 2011