Ben-Or, M., S. Goldwasser, J. Kilian, and A. Wigderson (1988). “Multi-prover interactive proofs: How to remove intractability assumptions.” Proceedings of 20th Annual AMC Symposium on Theory of Computing, 113–122.
Google Scholar
Ben-Or, M., S. Goldwasser, and A. Wigderson (1988). “Completeness theorems for fault-tolerant distributed computing.” Proc. 20
th ACM Symposium on Theory of Computing, Chicago, 1988. ACM Press, New York, 1–10.
Google Scholar
Blum, M. (1982). “Coin flipping by telephone.” Advances in Cryptography, Santa Barbara, California, USA, ed. Allen Gersho. University of California, Santa Barbara, 11–15.
Google Scholar
Brassard, G., D. Chaum, and C. Crépeau (1998). “Minimum disclosure proofs of knowledge.” JCSS, 37, 156–189.
Google Scholar
Brassard, G., C. Crépeau, R. Jozsa, and D. Langlois (1993). “A quantum bit commitment scheme provably unbreakable by both parties.” 29th Symp. on Found. of Computer Sci. IEEE, Piscataway, NJ, 42–52.
Google Scholar
Cachin, C., C. Crépeau, and J. Marcil (1998). “Oblivious transfer with a memory-bounded receiver.” 39th Annual Symposium on Foundations of Computer Science: Proceedings, November 8–11, 1998, Palo Alto, California. IEEE Computer Society Press, Los Alamitos, CA, 493–502.
Google Scholar
Canetti Ran and Marc Fischlin (2001). “Universally composable commitments.” Advances in Cryptology—
CRYPTO 2001, International Association for Cryptologic Research, Lecture Notes in Computer Science, vol. 2139, ed. Joe Kilian. Springer-Verlag, Berlin, 19–40.
Google Scholar
Chaum, D., C. Crépeau, and I. Damgård (1988). “Multi-party unconditionally secure protocols.” Proc. 20th ACM Symposium on Theory of Computing, Chicago, 1988. ACM Press, New York.
Google Scholar
Chor Benny, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch (1985). “Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract).” Proc. of 26th FOCS, Portland, OR, October 21–23, 1985. IEEE, Piscataway, NJ, 383–395.
Google Scholar
Crépeau C. (1997). “Efficient cryptographic protocols based on noisy channels.” Advances in Cryptology—EUROCRYPT'97, Lecture Notes in Computer Science, vol. 1233, ed. Walter Fumy. Springer-Verlag, Berlin, 306–317.
Google Scholar
Crépeau C., J. van de Graaf, and A. Tapp (1995). “Committed oblivious transfer and private multi-party computation.” Advances in Cryptology—
CRYPTO'95, Lecture Notes in Computer Science, vol. 963, ed. Don Coppersmith. Springer-Verlag, Berlin, 110–123.
Google Scholar
Di Crescenzo, Giovanni, Yuval Ishai, and Rafail Ostrovsky (1998). “Non-interactive and non-malleable commitment.” 30th Symposium on the Theory of Computing, 141–150.
Google Scholar
Dolev, D., C. Dwork, and M. Naor (1991). “Nonmalleable cryptography.” Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, New Orleans, LA, May 6–8, 1991. IEEE Computer Society Press, Los Alamitos, CA.
Google Scholar
Even, S. (1982). “Protocol for signing contracts.” Advances in Cryptography, Santa Barbara, CA, USA, 1982, ed. Allen Gersho. University of California, Santa Barbara.
Google Scholar
Feige, U. and A. Shamir (1989). “Zero knowledge proofs of knowledge in two rounds.” Advances in Cryptology—CRYPTO'89, Lecture Notes in Computer Science, vol. 435, ed. Gilles Brassard. Springer-Verlag, Berlin, 526–544.
Google Scholar
Goldreich Oded, Silvio Micali, and Avi Wigderson (1991). “Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems.” Journal of the Association for Computing Machinery, 38 (3), 691–729.
MathSciNet
Google Scholar
Halevi, S. and S. Micali (1996). “Practical and provably-secure commitment schemes from collision-free hashing.” Advances in Cryptology—
CRYPTO'96, Lecture Notes in Computer Science, vol. 1109, ed. Neal Koblitz. Springer-Verlag, Berlin, 201–215.
Google Scholar
Håstad, Johan, Russell Impagliazzo, Leonid A. Levin, and Michael Luby (1999). “A pseudorandom generator from any one-way function.” SICOMP. SIAM Journal on Computing, 28 (4), 1364–1396.
MATH
Google Scholar
Kilian, J. (1988). “Founding cryptography on oblivious transfer.” Proc.
20th ACM Symposium on Theory of Computing, Chicago, 1988. ACM Press, New York, 20–31.
Google Scholar
>Kilian Joe (1992). “A note on efficient zero-knowledge proofs and arguments (extended abstract).” Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing, Victoria, British Columbia, Canada, May 4–6, 1992, 723–732.
Google Scholar
Liskov Moses, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, and Adam Smith (2001). “Mutually independent commitments.” Advances in Cryptology—ASIACRYPT 2001, Lecture Notes in Computer Science, vol. 2248, ed. C. Boyd. Springer, Berlin, 385–401.
Google Scholar
Lo, H.-K. and F. Chau (1997). “Is quantum bit commitment really possible.” Physical Review Letters, 78 (17), 3410–3413.
Google Scholar
Mayers Dominic (1997). “Unconditionally secure quantum bit commitment is impossible.” Physical Review Letters, 78 (17), 3414–3417.
Google Scholar
Naor Moni (1991). “Bit commitment using pseudorandomness.” Journal of Cryptology, 4, 151–158.
MATH
MathSciNet
Google Scholar
Naor, M., R. Ostrovsky, R. Venkatesan, and M. Yung (1993). “Perfect zero-knowledge arguments for NP can be based on general complexity assumptions.” Advances in Cryptology—CRYPTO'92, Lecture Notes on Computer Science, vol. 740, ed. E.F. Brickell. Springer-Verlag. This work was first presented at the DIMACS Workshop on Cryptography, October 1990.
Google Scholar
Shamir, A., R.L. Rivest, and L.M. Adleman (1981). “Mental poker.” The Mathematical Gardner, ed. D. Klarner. Wadsworth, Belmont, CA.
Google Scholar