Divertible and subliminal-free zero-knowledge proofs for languages

Journal of Cryptology

Volumn 12, Issue 3, 1999, Pages 197-223

  Burmester, Mike ^a   Desmedt, Yvo G ^a,b   Itoh, Toshiya ^c   Sakurai, Kouichi ^d   Shizuya, Hiroki ^e  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

^c TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^d KYUSHU UNIVERSITY   (Japan)

^e TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1642276503     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900053     Document Type: Article

References (23)

1. D. Angluin and D. Lichtenstein. Provable security of cryptosystems: a survey. Technical Report TR288, Yale University, October 1983.
2. L. Babai. Trading group theory for randomness. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC, pp. 421-429, 1985.
3. M. Blum. Coin flipping by telephone-a protocol for solving impossible problems. In Digest of Papers COMPCON&2, IEEE Computer Society Press, Los Alamitos, CA, pp. 133-137, 1982.
4. - [4] M. Blum. How to prove a theorem so no one else can claim it. In Proceedings of the International Congress of Mathematicians, pp. 1444-1451,1987.
5. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, vol. 37, no. 2, pp. 156-189, 1988.
6. M. V. D. Burmester and Y. Desmedt. All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions. In I. Damgard, editor, Advances in Cryptology - Eurocrypt '90, Lecture Notes in Computer Science, vol. 473, Springer-Verlag, Berlin, pp. 1-10,1991.
7. M. Burmester, Y. G. Desmedt, T. Itoh, K. Sakurai, H. Shizuya, and M. Yung. A progress report on subliminal-free channels. In R. Anderson, editor, Information Hiding, First International Workshop, Proceedings, Lecture Notes in Computer Science, vol. 1174, Springer-Verlag, Berlin, pp. 159-168, 1996.
8. L. Chen, I. Damgard, and T. P. Pedersen. Parallel divertibility of proofs of knowledge. In A. De Santis, editor, Advances in Cryptology - Eurocrypt '94, Lecture Notes in Computer Science, vol. 950, SpringerVerlag, Berlin, pp. 140-155, 1995.
9. R. Cleve. Limits on the security of coin flips when half the processors are faulty. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC, pp. 364-369, 1986.
10. D. E. R. Denning. Cryptography and Data Security. Addison-Wesley, Reading, MA, 1982.
11. Y. G. Desmedt. Subliminal-free cryptosystems. Submitted to the Journal of Cryptology April 1989, revised version submitted May 3,1994.
12. Y. Desmedt, C. Goutier, and S. Bengio. Special uses and abuses of the Fiat-Shamir passport protocol. In C. Pomerance, editor. Advances in Cryptology - Crypto '87, Lecture Notes in Computer Science, vol. 293, Springer-Verlag, Berlin, pp. 21-39,1988.
13. Y. Desmedt and M. Yung. Minimal cryptosystems and defining subliminal-freeness. In Proceedings of the 1994 IEEE International Symposium on Information Theory, Trondheim, Norway, June 27-July 1, 1994, p. 347. Final paper in preparation.
14. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos, CA, pp. 174-187,1986.
15. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, vol. 38, no. 1, pp. 691-729, 1991.
16. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, vol. 28, no'. 2, pp. 270-299, 1984.
17. S. Gold wasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. Siam Journal on Computing, vol. 18, no. 1, pp. 186-208, 1989.
18. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC, pp. 59-68, 1986.
19. R. Impagliazzo and M. Yung, Personal communication, 1987,1992.
20. T. Itoh, K. Sakurai, and H. Shizuya. Any language in IP has a divertible ZKIP. In H. Imai, R. L. Rivest, and T. Matsumoto, editors, Advances in Cryptology-Asiacrypt '91, Lecture Notes in Computer Science, vol. 739, Springer-Verlag, Berlin, pp. 382-396,1993.
21. T. Okamoto and K. Ohta. Divertible zero knowledge interactive proofs and commutative random selfreducibility. In J.-J. Quisquater and J. Vandewalle, editors. Advances in Cryptology - Eurocrypt '89, Lecture Notes in Computer Science, vol. 434, Springer-Verlag, Berlin, pp. 134-149, 1990.
22. C. E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, vol. 28, pp. 656-715,1949.
23. G. J. Simmons. The prisoners' problem and the subliminal channel. In D. Chaum, editor, Advances in Cryptology, Proceedings ofCrypto 83, Plenum, New York, pp. 51-67,1984.