Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages
暂无分享,去创建一个
Yvo Desmedt | Kouichi Sakurai | Toshiya Itoh | Mike Burmester | Hiroki Shizuya | K. Sakurai | Y. Desmedt | M. Burmester | T. Itoh | Hiroki Shizuya
[1] Ivan Damgård,et al. Parallel Divertibility of Proofs of Knowledge (Extended Abstract) , 1994, EUROCRYPT.
[2] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[3] Samy Bengio,et al. Special Uses and Abuses of the Fiat-Shamir Passport Protocol , 1987, CRYPTO.
[4] Moti Yung,et al. Minimal cryptosystems and defining subliminal-freeness , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.
[5] Moti Yung,et al. A Progress Report on Subliminal-Free Channels , 1996, Information Hiding.
[6] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[7] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[8] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[9] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.
[10] Dorothy E. Denning,et al. Cryptography and Data Security , 1982 .
[11] Kazuo Ohta,et al. Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility , 1990, EUROCRYPT.
[12] Silvio Micali,et al. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[13] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[14] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[15] Kouichi Sakurai,et al. Any Language in IP Has a Divertable ZKIP , 1991, ASIACRYPT.
[16] Manuel Blum,et al. Coin flipping by telephone a protocol for solving impossible problems , 1983, SIGA.
[17] Gustavus J. Simmons,et al. The Prisoners' Problem and the Subliminal Channel , 1983, CRYPTO.
[18] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[19] V. Rich. Personal communication , 1989, Nature.
[20] Yvo Desmedt,et al. All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions (extended abstract) , 1991 .
[21] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.