Abstract
In zero-knowledge interactive proofs, a lot of randomized information is exchanged between the prover and the verifier, and the randomness of the prover is used in satisfying the zero-knowledge condition. In this paper, we show a new methodology that utilizes the randomness of the prover in a zero-knowledge proof for some positive objectives as well as for zero-knowledge condition. Based on this idea, we propose two types of applications; key distribution, and digital signature. We propose identity-based key distribution schemes that are provably secure against strong active attacks (chosen-message-known-key active attacks) assuming the difficulty of factoring a composite number. In addition, we show that non-transitive digital signature schemes can be constructed if and only if a one-way function exists. We also show some practical non-transitive digital signature schemes. A new general method of constructing identity-based cryptographic schemes is presented as an application of the identity-based non-transitive digital signature schemes. We also propose a new digital signature scheme based on the (extended) Fiat-Shamir identification scheme.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. Beth, “Efficient Zero-Knowledge Identification Scheme For Smart Cards,” Eurocrypt’88 (1988)
G. Brassard, D. Chaum, and C. Crépeau, “Minimum Disclosure Proofs of Knowledge,” Journal of Computer and System Sciences, Vol.37, pp.156–189 (1988)
R. Blom, “Non-Public Key Distribution,” Crypto’82, pp.231–236 (1982)
M. Blum, “How to Prove a Theorem So No One Else Can Claim It,” ISO/TC97/SC20/WG2 N73 (1986)
M. Blum, P. Feldman and S. Micali, “Non-Interactive Zero-Knowledge and Its Applications,” STOC, pp.103–112 (1988)
D. Chaum “Zero-Knowledge Undeniable Signatures,” Eurocrypt’90 (1990)
D. Chaum, and H. van Antwerpen, “Undeniable Signatures,” Crypto’89 (1989)
Y. Desmedt, “Subliminal-Free Authentication and Signature,” Eurocrypt’88, pp.23–34 (1988)
Y. Desmedt, C. Goutier and S. Bengio, “Special Uses and Abuses of the Fiat-Shamir Passport Protocol,” Crypto’87 (1987)
W. Diffie, and M. Hellman, “New Directions in Cryptography,” IEEE Transactions on Information Theory, IT-22, 644–654 (1976)
A. DeSantis, S. Micali and G. Persiano, “Non-Interactive Zero-Knowledge Proof Systems with Auxiliary Language,” Crypto’88 (1988)
U. Feige and A. Shamir, “Witness Indistinguishable and Witness Hiding Protocols,” STOC, pp.416–426 (1990)
U. Feige, A. Fiat and A. Shamir, “Zero Knowledge Proofs of Identity,” STOC, pp.210–217 (1987)
A. Fiat and A. Shamir, “How to Prove Yourself,” Crypto’86 (1986)
Z. Galil, S. Harber, and M. Yung “Symmetric Public-Key Encryption,” Crypto’85 (1985)
O. Goldreich, and H. Krawczyk “On the Composition of Zero-Knowledge Proof Systems,” Technical Report #570 of Technion (1989)
O. Goldreich, and A.L. Levin, “A Hard-Core Predicate for All One-Way Functions,” STOC’89, pp.25–32 (1989)
S. Goldwasser, S. Micali, and C. Rackoff, “The Knowledge Complexity of Interactive Proofs,” SIAM J. Comput., 18,1, pp.186–208 (1989). Previous version, Proc. STOC, pp291–304 (1985)
S. Goldwasser, S. Micali, and C. Rivest, “A Secure Digital Signature Scheme,” SIAM J. Comput., 17,2, pp.281–308 (1988).
O. Goldreich, S. Micali, and A. Wigderson, “Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design,” FOCS, pp.174–187 (1986)
M. Girault, and J.C. Pailles, “An Identity-Based Scheme Providing Zero-Knowledge Authentication and Authenticated Key-Exchange,” ISO IEC/JTC 1/SC 27/WG20.2 N200 (1990)
L.C. Guillou, and J.J. Quisquater, “A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing Both Transmission and Memory,” Eurocrypto’88 (1988)
J. Håstad, “Pseudo-Random Generators under Uniform Assumptions,” STOC, pp.395–404 (1990)
ISO “Banking-Requirements for Message Authentication (Wholesale)” ISO/TC68/SC2/WG2 N191 (1987 November)
R. Impagliazzo, L. Levin, M. Luby “Pseudo-Random Number Generation from One-Way Functions,” STOC, pp.12–24 (1989)
L. Kohnfelder, “Towards a Practical Public-Key Cryptosystems,” B.S.Thesis, MIT (1979)
K. Koyama, and K. Ohta, “Identity-based Conference Key Distribution Systems,” Crypto’87 (1987)
K.S. McCurley, “A Key Distribution System Equivalent Factoring,” J. of Cryptology, 1,2, pp.95–106 (1988)
T. Matsumoto and H. Imai, “On the Key Distribution Problem,” Crypto’87, (1987)
M. Naor, “Bit Commitment Using Pseudo-Randomness,” Crypto’89, (1989)
M. Naor, and M. Yung, “Universal One-Way Hash Functions and Their Cryptographic Applications,” STOC, pp.33–43 (1989)
K. Ohta, “Efficient Identification and Signature Scheme,” Electronics Letters, 24,2, pp.115–116 (1988)
K. Ohta, “Encryption and Authentication Techniques for Information Security,” Dr.Sci Thesis, Waseda University (1990)
K. Ohta, and T. Okamoto, “A Modification of the Fiat-Shamir Scheme,” Crypto’88 (1988)
E. Okamoto, “Proposal for Identity-based key distribution systems,” Electronics Letters, 22,24, pp.1283–1284 (1986)
T. Okamoto, and K. Ohta “Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash,” Crypto’89 (1989)
T. Okamoto, and K. Ohta “Divertible Zero-Knowledge Interactive Proofs and Commutative Random Self-Reducible,” Eurocrypt’89 (1989)
T. Okamoto, and A. Shiraishi “A Single Public-Key Authentication Scheme for Multiple Users,” Systems and Computers in Japan, 18,10, pp.14–24 (1987) Previous version, Technical Report of IECE Japan, IN83-92 (1984)
M. Rabin “Digitalized Signatures and Public-Key Cryptosystems,” MIT/LCS/TR-212, MIT Technical Report (1979)
J. Rompel, “One-Way Functions are Sufficient for Secure Signatures,” STOC, pp.387–394 (1990)
A. Shamir, “Identity-based Cryptosystems and Signature Schemes,” Crypto’84 (1984)
Z. Shmuely, “Composite Diffie-Hellman Public-Key Generating Systems Are Hard to Break,” TR #356, Computer Science Dept. Technion, IIT (1985)
S. Tsujii, and T. Itoh, “An ID-Based Crypto-system Based on the Discrete Logarithm Problem,” IEEE J. Selected Area in Communications, 7,4 (1989)
M. Tompa and H. Woll, “Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information,” Proc. FOCS, pp472–482 (1987)
Y. Yacobi, “A Key Distribution “Paradox”,” These Proceedings (1990)
Y. Yacobi, and Z. Shmuely, “On Key Distribution Systems,” Crypto’89 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okamoto, T., Ohta, K. (1991). How to Utilize the Randomness of Zero-Knowledge Proofs. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_33
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive