Article

A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory

Authors:

L. C. Guillou,

J.-J. QuisquaterAuthors Info & Claims

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88

Pages 123 - 128

Published: 01 April 1988 Publication History

Abstract

Zero-knowledge interactive proofs are very promising for the problems related to the verification of identity. After their (mainly theoretical) introduction by S. Goldwasser, S. Micali and C. Rackoff (1985), A. Fiat and A. Shamir (1986) proposed a first practical solution: the scheme of Fiat-Shamir is a trade-off between the number of authentication numbers stored in each security microprocessor and the number of witness numbers to be checked at each verification.This paper proposes a new scheme which requires the storage of only one authentication number in each security microprocessor and the check of only one witness number. The needed computations are only 2 or 3 more than for the scheme of Fiat-Shamir.

References

[1]

Gilles Brassard, David Chaum and Claude Crépreau, Minimum disclosure proofs of knowledge , July 1987.

Google Scholar

[2]

Amos Fiat and Adi Shamir, How to prove yourself: practical solutions to identification and signature problems . Springer-Verlag, Lecture notes in computer science, No 263, Advances in cryptology, Proceedings of CRYPTO '86, pp. 186-194, 1987.

Crossref

Google Scholar

[3]

Shafi Goldwasser, S. Micali and C. Rackoff, The knowledge of interactive proof systems , 17th ACM symposium on theory of computing, 1985, pp. 291-304.

Crossref

Google Scholar

[4]

Oded Goldreich, Silvio Micali and Avi Wigderson, Proofs that yields nothing but the validity of the proof , Workshop on probabilistic algorithms, Marseille, March 1986.

Google Scholar

[5]

Adi Shamir, Identity-based cryptosystems and signatures schemes , Springer-Verlag, Lecture notes in computer science, No 196, Advances in cryptology, Proceedings of CRYPTO '84, pp. 47-53, 1985.

Crossref

Google Scholar

Cited By

View all

Zahhafi LKhadir O(2019)Anonymous Secure E-voting over a Network for Multiple ElectionsProceedings of the 2nd International Conference on Networking, Information Systems & Security10.1145/3320326.3320378(1-6)Online publication date: 27-Mar-2019
https://dl.acm.org/doi/10.1145/3320326.3320378
Abdalla MBenhamouda FPointcheval D(2019)On the Tightness of Forward-Secure Signature ReductionsJournal of Cryptology10.1007/s00145-018-9283-232:1(84-150)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s00145-018-9283-2
Bootle JCerulli AChaidos PGroth JPetit C(2016)Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log SettingProceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 966610.5555/3081738.3081750(327-357)Online publication date: 8-May-2016
https://dl.acm.org/doi/10.5555/3081738.3081750
Show More Cited By

Index Terms

A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory

Recommendations

An enhanced Kerberos protocol with non-interactive zero-knowledge proof

As one of the most important trusted third-party-based authentication protocols, Kerberos is widely used to provide authentication service in distributed networks. However, it is vulnerable to common brute force password-guessing attacks because of its ...
Practical round-optimal blind signatures without random oracles or non-interactive zero-knowledge proofs

Blind signatures are generated by means of a protocol between the signer and a user such that the signer can neither see the message being signed and nor learn any information on the signature being produced. Time/space complexity and security model (...
Pairing-based non-interactive zero-knowledge proofs
Pairing'10: Proceedings of the 4th international conference on Pairing-based cryptography

A non-interactive zero-knowledge proof permits the construction of a proof of the truth of a statement that reveals nothing else but the fact that the statement is true. Non-interactive zero-knowledge proofs are used in the construction of numerous ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88

April 1988

467 pages

ISBN:0387502513

Editor:
C. G. Günther
Asea Brown Boveri, Corporate Research, Baden, Switzerland

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 April 1988

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

96
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zahhafi LKhadir O(2019)Anonymous Secure E-voting over a Network for Multiple ElectionsProceedings of the 2nd International Conference on Networking, Information Systems & Security10.1145/3320326.3320378(1-6)Online publication date: 27-Mar-2019
https://dl.acm.org/doi/10.1145/3320326.3320378
Abdalla MBenhamouda FPointcheval D(2019)On the Tightness of Forward-Secure Signature ReductionsJournal of Cryptology10.1007/s00145-018-9283-232:1(84-150)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s00145-018-9283-2
Bootle JCerulli AChaidos PGroth JPetit C(2016)Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log SettingProceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 966610.5555/3081738.3081750(327-357)Online publication date: 8-May-2016
https://dl.acm.org/doi/10.5555/3081738.3081750
Ciampi MPersiano GScafuro ASiniscalchi LVisconti I(2016)Online/Offline OR Composition of Sigma ProtocolsProceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 966610.5555/3081738.3081741(63-92)Online publication date: 8-May-2016
https://dl.acm.org/doi/10.5555/3081738.3081741
Abe MFuchsbauer GGroth JHaralambiev KOhkubo M(2016)Structure-Preserving Signatures and Commitments to Group ElementsJournal of Cryptology10.1007/s00145-014-9196-729:2(363-421)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s00145-014-9196-7
Chase MGanesh CMohassel P(2016)Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving CredentialsProceedings, Part III, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 981610.1007/978-3-662-53015-3_18(499-530)Online publication date: 14-Aug-2016
https://dl.acm.org/doi/10.1007/978-3-662-53015-3_18
Brenner HGoyal VRichelson SRosen AVald MRay ILi NKruegel C(2015)Fast Non-Malleable CommitmentsProceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security10.1145/2810103.2813721(1048-1057)Online publication date: 12-Oct-2015
https://dl.acm.org/doi/10.1145/2810103.2813721
Fukumitsu MHasegawa S(2015)Black-Box Separations on Fiat-Shamir-Type Signatures in the Non-Programmable Random Oracle ModelProceedings of the 18th International Conference on Information Security - Volume 929010.1007/978-3-319-23318-5_1(3-20)Online publication date: 9-Sep-2015
https://dl.acm.org/doi/10.1007/978-3-319-23318-5_1
Kulyk OTeague VVolkamer M(2015)Extending Helios Towards Private Eligibility VerifiabilityProceedings of the 5th International Conference on E-Voting and Identity - Volume 926910.1007/978-3-319-22270-7_4(57-73)Online publication date: 2-Sep-2015
https://dl.acm.org/doi/10.1007/978-3-319-22270-7_4
Asaar MVardasbi ASalmasizadeh M(2013)Non-delegatable strong designated verifier signature using a trusted third party without pairingsProceedings of the Eleventh Australasian Information Security Conference - Volume 13810.5555/2525483.2525485(13-24)Online publication date: 29-Jan-2013
https://dl.acm.org/doi/10.5555/2525483.2525485
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

An enhanced Kerberos protocol with non-interactive zero-knowledge proof

Practical round-optimal blind signatures without random oracles or non-interactive zero-knowledge proofs

Pairing-based non-interactive zero-knowledge proofs

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations