@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",
doi = "10.1007/3-540-57332-1_27",
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",
note = "1st International Conference on the Theory and Application of Cryptology, ASIACRYPT 1991 ; Conference date: 11-11-1991 Through 14-11-1991",
}