Abstract
A four-move protocol for quadratic residuosity is proposed and the security is discussed. An application of the proposed protocol to a cryptographic identification scheme introduces a new notion of practical soundness. Our basic approach is to separate proofs of knowledge from proofs of membership of languages. Previous works deal with proofs of knowledge as an additional property of proofs of membership.
Keywords
- Interactive Proof
- Overwhelming Probability
- Coin Toss
- Probabilistic Polynomial Time
- Interactive Proof System
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.
This work was inspired by the discussion while the author was writing his thesis [Sak93] under the supervision of Kazuo IWAMA.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Abadi,A., Allender,E., Broder,A, Feigenbaum,J., and Hemachandra,L.A., “On generating solved instances of computational problems,” in Advances in Cryptology — Crypto'88, LNCS 403, Springer-Verlag, Berlin (1987).
Brassard,G., Crepeau, C., Laplante, S., and Leger, C., “Computationally convincing proofs of knowledge,” Proc. of the 8th STACS, (1991).
Brassard, G., Crépeau, C., and Yung, M., “Everything in NP Can Be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds,” Proc. of 16th ICALP'89, LNCS 372, Springer-Verlag, pp.123–136, Berlin (1989); final version in “Constant-round perfect zero-knowledge computationally convincing protocols,” TCS, 84, pp. 23–52 (1991).
Boyar, J., Friedl, K., and Lund, C., “Practical zero-knowledge proofs:/ Giving hints and using deficiencies,” J. of Cryptology, Vol.4, pp.185–206 (1991); preliminary version in Proc. of Eurocrypt'89(1989).
Bellare, M., and Goldreich,O., “On defining Proofs of Knowledge,” in Advances in Cryptology — Crypto'92, LNCS 740, Springer-Verlag, Berlin (1993).
Boppana,R., Hastad,J., and Zachos,S., “Does co-NP have short interactive proofs,” IPL, Vol.25, No.2, pp.127–132 (1987).
Brickell, E. F. and McCurley, K.S “An Interactive Identification Scheme Based on Discrete Logarithms and Factoring,” J. of Cryptology, Vol.5, pp.29–40 (1992); preliminary version in Proc. of Eurocrypt'90(1990).
Bellare, M., Micali, S., and Ostrovsky, R., “Perfect Zero-Knowledge in Constant Rounds,” Proc. of ACM STOC, pp.482–493 (May 1990).
Chen,L., and Damgaard, Y., “Security bounds for parallel versions of identification protocols,” in Advances in Cryptology — Eurocrypt'92, LNCS 658, pp.461–466, Springer-Verlag, Berlin (1993).
De Santis, A., Di Crescenzo,G. and Persioano G., “The knowledge complexity of quadratic residuosity languages,” TCS, 132, pp. 291–317 (1991).
Di Crescenzo,G. and Persioano G., “Round-optimal perfect zero-knowledge proofs,” IPL 50, pp.93–99 (1994).
Feige, U., Fiat, A., and Shamir, A., “Zero-Knowledge Proofs of Identity,” J. of Cryptology, Vol.1, pp.77–94 (1988); preliminary version in Proc. of 19th STOC, pp.210–217 (1987).
Fiat, A. and Shamir, A., “How to Prove Yourself,” Advances in Cryptology — Crypto'86, LNCS 263, Springer-Verlag, Berlin, pp.186–199 (1987).
Fortnow, L., “The Complexity of Perfect Zero-Knowledge,” Advanced in Computing Research, Vol.5,Randomness and Computation, pp.327-pp.344 (1989); preliminary version in Proc. of 19th STOC,pp.204–209 (1987).
Feige, U. and Shamir, A., “Zero-Knowledge Proofs of Knowledge in Two Rounds,” in Advances in Cryptology — Crypto'89, LNCS 435, pp.526–544, Springer-Verlag, Berlin (1990).
Feige, U. and Shamir, A., “Witness Indistinguishable and Witness Hiding Protocols,” Proc. of STOC, pp.416–426 (May 1990).
Goldreich, O. and Krawczyk, H., “On the Composition of Zero-Knowledge Proof Systems,” in The Proceedings of ICALP'90, LNCS 443, pp.268–282, Springer-Verlag, Berlin (1990).
Goldwasser, S., Micali, S., and Rackoff, C., “The Knowledge Complexity of Interactive Proof Systems,” SIAM J. of Comp., Vol.18, No.1, pp.186–208, (1989); preliminary version in Proc. of 17th STOC, pp. 291–304 (1985).
Goldreich, O., Micali, S., and Wigderson, A., “Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proofs,” J. of ACM, Vol.38, No.1, pp.691–729 (July 1991); preliminary version in Proc. of 27th FOCS, pp.174–187, (1986).
Itoh, T. and Sakurai, K., “On the Complexity of Constant Round ZKIP of Possession of Knowledge,” Advances in Cryptology — Asiacrypt'91, LNCS 739, Springer-Verlag, Berlin, (1993).
Okamoto,T., “Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes,” in Advances in Cryptology — Crypto'92, LNCS 740, pp.31–53, Springer-Verlag, Berlin (1993).
Sakurai,K., “Studies on the efficiency ans security of cryptographic protocols based on the zero-knowledge techniques, ” Ph.D thesis, Kyushu University (June 1993).
Sakurai,K., “Practical proofs of knowledge without relying on theoretical proofs of membership on languages,” manuscript (1995).
Sloan, R., “All Zero-Knowledge Proofs are Proofs of Language Membership,” Technical Memorandum, MIT/LCS/TM-385 (February 1989).
Sakurai,K., Itoh, T., “On the discrepancy between the serial and the parallel of zero-knowledge protocols” Advances in Cryptology — Crypto'92, LNCS 740, Springer-Verlag, Berlin, (1993).
Saitoh, T., Kurosawa, K., and Sakurai, K., “4-Move Perfect ZKIP of Knowledge with No Assumption,” Advances in Cryptology — Asiacrypt'91, LNCS 739, Springer-Verlag, Berlin, (1993).
Tompa, M. and Woll, H., “Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information,” Proc. of 28th FOCS, pp.472–482 (1987).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakurai, K. (1995). On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030871
Download citation
DOI: https://doi.org/10.1007/BFb0030871
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive