Skip to main content
SpringerLink
Log in
Book cover

International Conference on the Theory and Application of Cryptology

ASIACRYPT 1991: Advances in Cryptology — ASIACRYPT '91 pp 321–330Cite as

4 Move perfect ZKIP of knowledge with no assumption

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 739))

Abstract

This paper presents a 4-move perfect ZKIP of knowledge with no cryptographic assumption for the random self reducible problems [TW87] whose domain is NP∩BPP. The certified discrete log problem is such an example. (Finding a witness is more difficult than the language membership problem.) A largely simplified 4-move ZKIP for the Hamilton Circuit problem is also shown. In our ZKIP, a trapdoor coin flipping protocol is introduced to generate a challenge bit. P and V cooperatively generate a random bit in a coin flipping protocol. In a trapdoor coin flipping protocol, V who knows the trapdoor can create the view which he can later reveal in two possible ways: both as head and as tail.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.Tompa and H.Woll “Random self-reducibility and zero knowledge interactive proofs for possession of information”, Proc.28th FOCS, pp.472–482(1987).

    Google Scholar 

  2. O.Goldreich and H.Krawczyk “On the composition of zero knowledge proof systems”, Proc.ICALP 90, pp.268–282(1990).

    Google Scholar 

  3. U.Feige and A.Shamir “Zero-Knowledge Proofs in Two Rounds”, Advances in Cryptology-Crypt'89,Lecture Notes in Computer Science 435, Spring-Verlag, Berlin, pp.526–544(1990)

    Google Scholar 

  4. U.Feige and A.Shamir “Witness Indistinguishable and Witness”, ACM Annual Symposium on Theory of Computing, pp.416–426(May 1990)

    Google Scholar 

  5. M.Bellare, S.Micali, and R.Ostrovsky “The(True) Complexity of statistical Zero-Knowledge,” ACM Annual Symposium on Theory of Computing,pp.494–502(May 1990)

    Google Scholar 

  6. V.Pratt “Every prime has a succinct certificate,” SIAM J. Computing 4 pp.214–220(1975)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical and Electronic Eng., Tokyo Institute of Technology, 152, Tokyo, Japan

    Takeshi Saito & Kaoru Kurosawa

  2. Computer & Information Systems Laboratory, Mitsubishi Electric Corporation, 5-1-1 Ofuna, 247, Kamakura, Japan

    Kouichi Sakurai

Authors
  1. Takeshi Saito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kaoru Kurosawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kouichi Sakurai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hideki Imai Ronald L. Rivest Tsutomu Matsumoto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saito, T., Kurosawa, K., Sakurai, K. (1993). 4 Move perfect ZKIP of knowledge with no assumption. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-57332-1_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57332-6

  • Online ISBN: 978-3-540-48066-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation