4 move perfect ZKIP of knowledge with no assumption

Takeshi Saito, Kaoru Kurosawa, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAdvances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings
EditorsHideki Imai, Tsutomu Matsumoto, Ronald L. Rivest
PublisherSpringer Verlag
Pages321-330
Number of pages10
ISBN (Print)9783540573326
Publication statusPublished - Jan 1 1993
Event1st International Conference on the Theory and Application of Cryptology, ASIACRYPT 1991 - Fujiyoshida, Japan
Duration: Nov 11 1991Nov 14 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume739 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on the Theory and Application of Cryptology, ASIACRYPT 1991
CountryJapan
CityFujiyoshida
Period11/11/9111/14/91

Fingerprint

Networks (circuits)
Tail
Knowledge
Language

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Saito, T., Kurosawa, K., & Sakurai, K. (1993). 4 move perfect ZKIP of knowledge with no assumption. In H. Imai, T. Matsumoto, & R. L. Rivest (Eds.), Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings (pp. 321-330). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 739 LNCS). Springer Verlag.

4 move perfect ZKIP of knowledge with no assumption. / Saito, Takeshi; Kurosawa, Kaoru; Sakurai, Kouichi.

Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings. ed. / Hideki Imai; Tsutomu Matsumoto; Ronald L. Rivest. Springer Verlag, 1993. p. 321-330 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 739 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Saito, T, Kurosawa, K & Sakurai, K 1993, 4 move perfect ZKIP of knowledge with no assumption. in H Imai, T Matsumoto & RL Rivest (eds), Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 739 LNCS, Springer Verlag, pp. 321-330, 1st International Conference on the Theory and Application of Cryptology, ASIACRYPT 1991, Fujiyoshida, Japan, 11/11/91.
Saito T, Kurosawa K, Sakurai K. 4 move perfect ZKIP of knowledge with no assumption. In Imai H, Matsumoto T, Rivest RL, editors, Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings. Springer Verlag. 1993. p. 321-330. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Saito, Takeshi ; Kurosawa, Kaoru ; Sakurai, Kouichi. / 4 move perfect ZKIP of knowledge with no assumption. Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings. editor / Hideki Imai ; Tsutomu Matsumoto ; Ronald L. Rivest. Springer Verlag, 1993. pp. 321-330 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2acf756587f54cf4b78e48e52c885727,
title = "4 move perfect ZKIP of knowledge with no assumption",
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.",
author = "Takeshi Saito and Kaoru Kurosawa and Kouichi Sakurai",
year = "1993",
month = "1",
day = "1",
language = "English",
isbn = "9783540573326",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "321--330",
editor = "Hideki Imai and Tsutomu Matsumoto and Rivest, {Ronald L.}",
booktitle = "Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings",
address = "Germany",

}

TY - GEN

T1 - 4 move perfect ZKIP of knowledge with no assumption

AU - Saito, Takeshi

AU - Kurosawa, Kaoru

AU - Sakurai, Kouichi

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957804429&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957804429&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84957804429

SN - 9783540573326

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 321

EP - 330

BT - Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings

A2 - Imai, Hideki

A2 - Matsumoto, Tsutomu

A2 - Rivest, Ronald L.

PB - Springer Verlag

ER -