On the efficiency of bit commitment reductions

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

Volumn 7073 LNCS, Issue , 2011, Pages 520-537

  Ranellucci, Samuel ^a   Tapp, Alain ^a   Winkler, Severin ^b   Wullschleger, Jürg ^a,c  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b ETH ZURICH   (Switzerland)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

bit commitment; information theory; noisy channel; oblivious transfer; secure two party computation; string commitment

Indexed keywords

BIT COMMITMENT; NOISY CHANNEL; OBLIVIOUS TRANSFER; SECURE TWO-PARTY COMPUTATIONS; STRING COMMITMENT;

INFORMATION THEORY; SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 82955173801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25385-0_28     Document Type: Conference Paper

References (42)

1. Beaver, D.: Precomputing Oblivious Transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 97-109. Springer, Heidelberg (1995)
2. Beimel, A., Malkin, T.: A Quantitative Approach to Reductions in Secure Computation. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 238-257. Springer, Heidelberg (2004)
3. Bennett, C. H., Brassard, G., Crépeau, C., Skubiszewska, M.-H.: Practical Quantum Oblivious Transfer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 351-366. Springer, Heidelberg (1992)
4. Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. SIGACT News 15(1), 23-27(1983)
5. Blundo, C., Masucci, B., Stinson, D. R., Wei, R.: Constructions and bounds for unconditionally secure non-interactive commitment schemes. Des. Codes Cryptography 26, 97-110(2002)
6. De Bonis, A., Vaccaro, U.: Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Theor. Comput. Sci. 306, 223-243(2003)
7. Brassard, G., Chaum, D., Crépeau, C.: Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci. 37, 156-189(1988)
8. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 136-145(2001), Updated Version at http://eprint.iacr.org/2000/067 (Pubitemid 33068374)
9. Cover, T. M., Thomas, J. A.: Elements of Information Theory. Wiley-Interscience, New York (1991)
10. Crépeau, C.: Equivalence Between Two Flavours of Oblivious Transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350-354. Springer, Heidelberg (1988)
11. Crépeau, C.: Efficient Cryptographic Protocols Based on Noisy Channels. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 306-317. Springer, Heidelberg (1997) (Pubitemid 127067809)
12. Crépeau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1988), pp. 42-52(1988)
13. Crépeau, C., Morozov, K., Wolf, S.: Efficient Unconditional Oblivious Transfer from Almost Any Noisy Channel. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 47-59. Springer, Heidelberg (2005) (Pubitemid 41190996)
14. Crépeau, C., van de Graaf, J., Tapp, A.: Committed Oblivious Transfer and Private Multi-Party Computation. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 110-123. Springer, Heidelberg (1995)
15. Damgård, I., Fehr, S., Morozov, K., Salvail, L.: Unfair Noisy Channels and Oblivious Transfer. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 355-373. Springer, Heidelberg (2004)
16. Damgård, I., Kilian, J., Salvail, L.: On the (Im) Possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 56-73. Springer, Heidelberg (1999)
17. Dodis, Y., Micali, S.: Lower Bounds for Oblivious Transfer Reductions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 42-55. Springer, Heidelberg (1999)
18. Erdos, P., Frankl, P., Füredi, Z.: Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics 51 (1-2), 79-89(1985)
19. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637-647(1985)
20. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems. J. ACM 38(3), 690-728(1991)
21. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC 1985), pp. 291-304. ACM Press (1985)
22. Han, T. S., Kobayashi, K.: Mathematics of Information and Coding. American Mathematical Society, Boston (2001)
23. Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J. B.: OT-Combiners Via Secure Computation. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 393-411. Springer, Heidelberg (2008)
24. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A., Wullschleger, J.: Constant-rate Oblivious Transfer from Noisy Channels. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 667-684. Springer, Heidelberg (2011)
25. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Extracting correlations. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), pp. 261-270(2009)
26. Ishai, Y., Prabhakaran, M., Sahai, A.: Founding Cryptography on Oblivious Transfer - Efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572-591. Springer, Heidelberg (2008)
27. Kautz, W., Singleton, R.: Nonrandom binary superimposed codes. IEEE Trans. on Information Theory 10(4), 363-377(1964)
28. Kilian, J.: More general completeness theorems for secure two-party computation. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 316-324. ACM Press (2000)
29. Kilian, J., Micali, S., Ostrovsky, R.: Minimum resource zero-knowledge proofs. In: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1989), pp. 474-479. IEEE (1989) (Pubitemid 20725990)
30. Nascimento, A., Otsuka, A., Imai, H., Müller-Quade, J.: Unconditionally Secure Homomorphic Pre-Distributed Commitments. In: Fossorier, M. P. C., Høholdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol. 2643, pp. 604-604. Springer, Heidelberg (2003)
31. Ordentlich, E., Weinberger, M. J.: A distribution dependent refinement of pinsker's inequality. IEEE Transactions on Information Theory 51(5), 1836-1840(2005) (Pubitemid 40654455)
32. Rabin, M. O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)
33. Ranellucci, S., Tapp, A., Winkler, S., Wullschleger, J.: On the efficiency of bit commitment reductions. Cryptology ePrint Archive, Report 2011/324(2011)
34. Sperner, J.: Ein Satz über Untermengen einer endlichen Menge. Math. Z. 27, 544-548(1928)
35. Stinson, D. R., Wei, R., Zhu, L.: Some new bounds for cover-free families. J. Combin. Theory A 90, 224-234(1999)
36. Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78-88(1983)
37. Winkler, S., Wullschleger, J.: On the Efficiency of Classical and Quantum Oblivious Transfer Reductions. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 707-723. Springer, Heidelberg (2010)
38. Winter, A., Nascimento, A. C. A., Imai, H.: Commitment capacity of discrete memoryless channels. In: IMA Int. Conf., pp. 35-51(2003)
39. Wolf, S., Wullschleger, J.: New Monotones and Lower Bounds in Unconditional Two-Party Computation. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 467-477. Springer, Heidelberg (2005)
40. Wullschleger, J.: Oblivious-Transfer Amplification. In: Naor, M. (ed.) EURO-CRYPT 2007. LNCS, vol. 4515, pp. 555-572. Springer, Heidelberg (2007)
41. Wullschleger, J.: Oblivious Transfer from Weak Noisy Channels. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 332-349. Springer, Heidelberg (2009)
42. Yao, A. C.: Protocols for secure computations. In: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 1982), pp. 160-164(1982)