article

Efficient signature generation by smart cards

Author:

C. P. SchnorrAuthors Info & Claims

Journal of Cryptology, Volume 4, Issue 3

Pages 161 - 174

https://doi.org/10.1007/BF00196725

Published: 01 January 1991 Publication History

Abstract

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 _p where p is a sufficiently large prime, e.g., p 2⁵¹². A key idea is to use for the base of the discrete logarithm an integer in _p such that the order of is a sufficiently large prime q , e.g., q 2¹⁴⁰. 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 .

References

[1]

Beth, T.: Efficient Zero-Knowledge Identification Scheme for Smart Cards. Advances in Cryptology-- Eurocrypt '88 , Lecture Notes in Computer Science, Vol. 330 (1988), Springer-Verlag, Berlin, pp. 77-86.

[2]

Brickell, E. F., and McCurley, K. S.: An Interactive Identification Scheme Based on Discrete Logarithms and Factoring. Advances in Cryptology--Eurocrypt '90 , Lecture Notes in Computer Science, Vol. 473 (1991), Springer-Verlag, Berlin, pp. 63-71.

[3]

Chaum, D., Evertse, J. H., and van de Graaf, J.: An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations. Advances in Cryptology--Eurocrypt '87 , Lecture Notes in Computer Science, Vol. 304 (1988), Springer-Verlag, Berlin, pp. 127-141.

[4]

Coppersmith, D., Odlyzko, A., and Schroeppel, R.: Discrete Logarithms in GF(p). Algorithmica , 1 (1986), 1-15.

Digital Library

[5]

ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. Inform. Theory , 31 (1985), 469-472.

[6]

Even, S., Goldreich, O., and Micali, S.: On-Line/Off-Line Digital Signatures. Advances in Cryptology--Crypto '89 . Lecture Notes in Computer Science, vol. 435 (1990), Springer-Verlag, Berlin, pp. 263-277.

[7]

Feige, U., Fiat, A. and Shamir, A.: Zero-Knowledge Proofs of Identity. Proceedings of STOC , 1987, pp. 210-217, and J. Cryptology , 1 (1988), 77-95.

Digital Library

[8]

Fiat, A., and Shamir, A.: How To Prove Yourself: Practical Solutions of Identification and Signature Problems. Advances in Cryptology--Crypto '86 , Lecture Notes in Computer Science, Vol. 263 (1987), Springer-Verlag, Berlin, pp. 186-194.

[9]

Girault, M.: An Identity-Based Identification Scheme Based on Discrete Logarithms. Advances in Cryptology--Eurocrypt '90 , Lecture Notes in Computer Science, Vol. 473 (1991), Springer-Verlag, Berlin, pp. 481-486.

[10]

Girault, M.: Self-Certified Public Keys. Abstracts of Eurocrypt '91 , Brighton, 8-11 April 1991, pp. 236- 241.

[11]

Goldwasser, S., Micali, S., and Rackoff, C.: Knowledge Complexity of Interactive Proof Systems. Proceedings of STOC , 1985, pp. 291-304.

[12]

Gordon, D.: Discrete Logarithms in GF(p) Using the Number Field Sieve. Technical Report, Sandia Laboratories (1990).

[13]

Guillou, L. S., and Quisquater, J. J.: A Practical Zero-Knowledge Protocol Fitted to Security Micro-processor Minimizing both Transmission and Memory. Advances in Cryptology--Eurocrypt '88 , Lecture Notes in Computer Sciences, Vol. 330 (1988), Springer-Verlag, Berlin, pp. 123-128.

[14]

Günther, C. G.: An Identity-Based Key-Exchange Protocol. Advances in Cryptology--Eurocrypt '89 , Lecture Notes in Computer Science, Vol. 434 (1990). Springer-Verlag, Berlin, pp. 29-37.

[15]

Lenstra, A. K., Lenstra, H. W., Jr., Manasse, M. S., and Pollard, J. M.: The Number Field Sieve. Proceedings of STOC , 1990, pp. 564-572.

Digital Library

[16]

Ong, H., and Schnorr, C. P.: Fast Signature Generation with a Fiat-Shamir-like Scheme. Advances in Cryptology--Eurocrypt '90 , Lecture Notes in Computer Science, Vol. 473 (1991), Springer-Verlag, Berlin, pp. 432-440.

[17]

Pollard, J. M.: Monte Carlo Method for Index Computation (mod p ). Math. Comp. , 32 (1978), 918-924.

[18]

Pollard, J. M.: Some Algorithms in Number Theory. Technical Report, 15 pages, Feb. 1991.

[19]

Rabin, M. O.: Digital Signatures and Public-Key Functions as Intractable as Factorization. Technical Report MIT/LCS/TR-212, Massachusetts Institute of Technology (1978).

[20]

Rivest, R., Shamir, A., and Adleman, L.: A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Comm. ACM , 21 (1978), 120-126.

Digital Library

[21]

de Rooij, P. J. N.: On the Security of the Schnorr Scheme Using Preprocessing. Proceedings Eurocrypt '91 .

[22]

Schnorr, C. P.: Efficient Identification and Signatures for Smart Cards. Advances in Cryptology--Crypto '89 . Lecture Notes in Computer Science, Vol. 435 (1990), Springer-Verlag, Berlin, pp. 239-252.

Cited By

Kazempour NMirmohseni MAref M(2025)Information-theoretic privacy-preserving user authenticationInternational Journal of Information Security10.1007/s10207-024-00917-w24:1Online publication date: 1-Feb-2025
https://dl.acm.org/doi/10.1007/s10207-024-00917-w
Angel SIoannidis EMargolin ESetty SWoods JBalzarotti DXu W(2024)ReefProceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699113(3801-3818)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699113
Choudhuri AGarg SPiet JPolicharla GBalzarotti DXu W(2024)Mempool privacy via batched threshold encryptionProceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699097(3513-3529)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699097
Show More Cited By

Efficient signature generation by smart cards

Recommendations

Efficient structure-preserving signature scheme from standard assumptions
SCN'12: Proceedings of the 8th international conference on Security and Cryptography for Networks

We present an efficient signature scheme that facilitates Groth-Sahai proofs [25] of knowledge of a message, a verification key, and a valid signature on the message, without the need to reveal any of them. Such schemes are called structure-preserving. ...
Forward-Secure Multi-signatures
ICDCIT '08: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology

In many applications a document needs to be signed by more than one signer. When a signature depends on more than one signer we call it a multi-signature. Further, ordinary digital signatures have an inherent weakness: if the secret key is leaked, then ...
New multi-proxy multi-signature schemes

A new kind of proxy signature schemes is first proposed: multi-proxy multi-signature schemes. In multi-proxy multi-signature schemes, an original group of signers can authorize a group of proxy signers under the agreement of all singers both in the ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Cryptology

Journal of Cryptology Volume 4, Issue 3

January 1991

52 pages

ISSN:0933-2790

Issue’s Table of Contents

Copyright © Copyright © 1991 Springer-Verlag New York Inc.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 January 1991

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

657
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kazempour NMirmohseni MAref M(2025)Information-theoretic privacy-preserving user authenticationInternational Journal of Information Security10.1007/s10207-024-00917-w24:1Online publication date: 1-Feb-2025
https://dl.acm.org/doi/10.1007/s10207-024-00917-w
Angel SIoannidis EMargolin ESetty SWoods JBalzarotti DXu W(2024)ReefProceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699113(3801-3818)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699113
Choudhuri AGarg SPiet JPolicharla GBalzarotti DXu W(2024)Mempool privacy via batched threshold encryptionProceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699097(3513-3529)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699097
Gope PLin ZYang YNing J(2024)E-TenonJournal of Computer Security10.3233/JCS-22009732:4(319-348)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.3233/JCS-220097
Kelkar MBabel KDaian PAustgen JButerin VJuels ALuo BLiao XXu JKirda ELie D(2024)Complete Knowledge: Preventing Encumbrance of Cryptographic SecretsProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3690273(2415-2429)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3690273
Tas ESeres IZhang YMelczer MKelkar MBonneau JNikolaenko VLuo BLiao XXu JKirda ELie D(2024)Atomic and Fair Data Exchange via BlockchainProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3690248(3227-3241)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3690248
Makriyannis NYomtov OGalansky ALuo BLiao XXu JKirda ELie D(2024)Practical Key-Extraction Attacks in Leading MPC WalletsProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670359(3053-3064)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3670359
Retnanto AFaracci ESathya AHung YNakagaki K(2024)CARDinality: Interactive Card-shaped Robots with Locomotion and Haptics using VibrationProceedings of the 37th Annual ACM Symposium on User Interface Software and Technology10.1145/3654777.3676421(1-14)Online publication date: 13-Oct-2024
https://dl.acm.org/doi/10.1145/3654777.3676421
Bisht KKansagra NAli RShaik MFrancis MKataoka KQuek TGao DZhou JCardenas A(2024)Revocable TACO: Revocable Threshold based Anonymous Credentials over BlockchainsProceedings of the 19th ACM Asia Conference on Computer and Communications Security10.1145/3634737.3637656(1378-1393)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1145/3634737.3637656
Wang YLaing TMoreira JRyan MVilela JSchulmann HLi N(2024)Remote Registration of Multiple AuthenticatorsProceedings of the Fourteenth ACM Conference on Data and Application Security and Privacy10.1145/3626232.3653273(379-390)Online publication date: 19-Jun-2024
https://dl.acm.org/doi/10.1145/3626232.3653273
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents