Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique (extended abstract)

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

Volumn 8270 LNCS, Issue PART 2, 2013, Pages 441-463

  Brandão, Luís T A N ^a,b  

^a UNIVERSITY OF LISBON   (Portugal)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

cut and choose; forge and lose; garbled circuits; homomorphic bit commitments with trapdoor; secure two party computation

Indexed keywords

CUT-AND-CHOOSE; FORGE-AND-LOSE; GARBLED CIRCUITS; HOMOMORPHIC BIT-COMMITMENTS WITH TRAPDOOR; SECURE TWO-PARTY COMPUTATIONS;

COMPUTATION THEORY; CRYPTOGRAPHY; SECURITY OF DATA;

COMPUTER SOFTWARE REUSABILITY;

EID: 84892423216     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-42045-0_23     Document Type: Conference Paper

References (69)

1. Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for Key Management - Part 1: General (Revision 3) - NIST Special Publication 800-57. U.S. Department of Commerce, NIST-ITL-CSD (July 2012)
2. Brassard, G., Chaum, D., Crépeau, C.: Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Sciences 37(2), 156-189 (1988)
3. Boyar, J., Damgård, I., Peralta, R.: Short Non-Interactive Cryptographic Proofs. Journal of Cryptology 13(4), 449-472 (2000)
4. Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: Proc. STOC 1996, pp. 479-488. ACM, New York (1996)
5. Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Proc. CCS 2012, pp. 784-796. ACM, New York (2012),
6. See also Cryptology ePrint Archive. Report 2012/265
7. Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. SIGACT News 15(1), 23-27 (1983)
8. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proc. STOC 1990, pp. 503-513. ACM, New York (1990)
9. Brandão, L.T.A.N.: A Framework for Interactive Argument Systems using Quasigroupic Homorphic Commitment. Cryptology ePrint Archive, Report 2006/472 (2006)
10. Bristol Cryptography Group. Circuits of Basic Functions Suitable For MPC and FHE, http://www.cs.bris.ac.uk/Research/CryptographySecurity/MPC/ (accessed June 2013)
11. Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology 13(1), 143-202 (2000),
12. See also Cryptology ePrint Archive. Report 1998/018
13. 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)
14. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proc. STOC 2002, pp. 494-503. ACM, New York (2002),
15. See also Cryptology ePrint Archive. Report 2002/140
16. Damgård, I.B.: The application of claw free functions in cryptography. Ph.D. thesis, Aarhus University, Mathematical Institute (1988)
17. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM 28(6), 637-647 (1985)
18. Frederiksen, T.K., Jakobsen, T.P., Nielsen, J.B., Nordholt, P.S., Orlandi, C.: MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 537-556. Springer, Heidelberg (2013),
19. See also Cryptology ePrint Archive. Report 2013/155
20. Frederiksen, T.K., Nielsen, J.B.: Fast and Maliciously Secure Two-Party Computation Using the GPU. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 339-356. Springer, Heidelberg (2013)
21. Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28(2), 270-299 (1984)
22. Goldwasser, S., Micali, S., Rivest, R.L.: A "Paradoxical" Solution To The Signature Problem. In: Proc. FOCS 1984, pp. 441-448. IEEE Computer Society (1984)
23. Goyal, V., Mohassel, P., Smith, A.: Efficient Two Party and Multi Party Computation Against Covert Adversaries. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 289-306. Springer, Heidelberg (2008)
24. Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Proc. STOC 1987, pp. 218-229. ACM, New York (1987)
25. Goldreich, O.: Foundations of Cryptography: Volume 2, Basic Applications, Chapter 7 (General Cryptographic Protocols). Cambridge University Press, New York (2004)
26. Huang, Y., Evans, D., Katz, J., Malka, L.: Faster Secure Two-Party Computation Using Garbled Circuits. In: Proc. SEC 2011. USENIX Association (2011)
27. Huang, Y., Katz, J., Evans, D.: Quid-Pro-Quo-tocols: Strengthening Semi-Honest Protocols with Dual Execution. In: Proc. S&P 2012, pp. 272-284. IEEE Computer Society, Washington (2012)
28. Huang, Y., Katz, J., Evans, D.: Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 18-35. Springer, Heidelberg (2013),
29. See also Cryptology ePrint Archive. Report 2013/081
30. Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending Oblivious Transfers Efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145-161. Springer, Heidelberg (2003)
31. Jarecki, S., Shmatikov, V.: Efficient Two-Party Secure Computation on Committed Inputs, In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 97-114. Springer, Heidelberg (2007)
32. Kiraz, M.S.: Secure and Fair Two-Party Computation. Ph.D. thesis, Technische Universiteit Eindhoven, Netherlands (2008)
33. Kolesnikov, V., Kumaresan, R.: Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 205-221. Springer, Heidelberg (2012)
34. Kolesnikov, V.: Advances and impact of secure function evaluation. Bell Labs Technical Journal 14(3), 187-192 (2009)
35. Kiraz, M.S., Schoenmakers, B.: A protocol issue for the malicious case of Yao's garbled circuit construction. In: Proc. 27th Symp. Information Theory in the Benelux, pp. 283-290 (2006)
36. Kiraz, M.S., Schoenmakers, B.: An Efficient Protocol for Fair Secure Two-Party Computation. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 88-105. Springer, Heidelberg (2008)
37. Kolesnikov, V., Schneider, T.: Improved Garbled Circuit: Free XOR Gates and Applications. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 486-498. Springer, Heidelberg (2008)
38. Kreuter, B., Shelat, A., Shen, C.-H.: Billion-gate secure computation with malicious adversaries. In: Proc. Security 2012, pp. 285-300. USENIX Association (2012),
39. See also Cryptology ePrint Archive. Report 2012/179
40. Lindell, Y.: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. Journal of Cryptology 16(3), 143-184 (2003),
41. See also Cryptology ePrint Archive. Report 2001/107
42. Lindell, Y.: Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043; pp. 1-17. Springer, Heidelberg (2013),
43. See also Cryptology ePrint Archive. Report 2013/079
44. Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. Journal of Cryptology 15(3), 177-206 (2002)
45. Lindell, Y., Pinkas, B.: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52-78. Springer, Heidelberg (2007),
46. See also Cryptology ePrint Archive. Report 2008/049
47. Lindell, Y., Pinkas, B.: A Proof of Security of Yao's Protocol for Two-Party Computation. Journal of Cryptology 22(2), 161-188 (2009)
48. Lindell, Y., Pinkas, B.: Secure two-party computation via cut-and-choose oblivious transfer. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 329-346. Springer, Heidelberg (2011),
49. See also Cryptology ePrint Archive. Report 2010/284
50. Mohassel, P., Franklin, M.K.: Efficiency Tradeoffs for Malicious Two-Party Computation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 458-473. Springer, Heidelberg (2006)
51. Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A New Approach to Practical Active-Secure Two-Party Computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681-700. Springer, Heidelberg (2012),
52. See also Cryptology ePrint Archive. Report 2011/091
53. Nielsen, J.B., Orlandi, C.: LEGO for Two-Party Secure Computation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 368-386. Springer, Heidelberg (2009),
54. See also Cryptology ePrint Archive. Report 2008/427
55. Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA 2001, pp. 448-457. SIAM, Philadelphia (2001)
56. Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proc. EC 1999, pp. 129-139. ACM, New York (1999)
57. Niven, I.M., Zuckerman, H.S., Montgomery, H.L.: An introduction to the theory of numbers, 5th edn. Wiley (1991)
58. Pinkas, B.: Fair Secure Two-Party Computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 647-647. Springer, Heidelberg (2003)
59. Pinkas, B., Schneider, T., Smart, N., Williams, S.: Secure Two-Party Computation Is Practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 250-267. Springer, Heidelberg (2009),
60. See also Cryptology ePrint Archive. Report 2009/314
61. Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical Report TR-81, Harvard University, Aiken Computation Lab, Cambridge, MA (1981),
62. See typesetted version in Cryptology ePrint Archive, Report 2005/187
63. Shelat, A., Shen, C.-H.: Two-Output Secure Computation with Malicious Adversaries. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 386-405. Springer, Heidelberg (2011),
64. See also Cryptology ePrint Archive. Report 2011/533
65. van de Graaf, J., Peralta, R.: A Simple and Secure Way to Show the Validity of Your Public Key. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 128-134. Springer, Heidelberg (1988)
66. Woodruff, D.P.: Revisiting the Efficiency of Malicious Two-Party Computation. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 79-96. Springer, Heidelberg (2007),
67. See also Cryptology ePrint Archive. Report 2006/397
68. Yao, A.C.: Protocols for secure computations. In: Proc. FOCS 1982, pp. 160-164. IEEE Computer Society (1982)
69. Yao, A.C.-C: How to generate and exchange secrets. In: FOCS 1986, pp. 162-167 (1986)