Fast two-party secure computation with minimal assumptions

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2013, Pages 523-534

  Shelat, Abhi ^a   Shen, Chih Hao ^a  

^a UNIVERSITY OF VIRGINIA   (United States)

Author keywords

cut and choose; malicious model; the yao protocol

Indexed keywords

AUXILIARY CIRCUITS; CRYPTOGRAPHIC ASSUMPTIONS; CUT-AND-CHOOSE; DISCRETE LOGARITHMS; MALICIOUS ADVERSARIES; OBLIVIOUS TRANSFER; SECURE TWO-PARTY COMPUTATIONS; STATE-OF-THE-ART APPROACH;

CRYPTOGRAPHY; HARDNESS;

SECURITY OF DATA;

EID: 84889073782     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2508859.2516698     Document Type: Conference Paper

References (26)

1. I. Damgård, V. Pastro, N. Smart, and S. Zakarias. Multiparty Computation from Somewhat Homomorphic Encryption. CRYPTO '12. http://eprint.iacr.org/2011/535.
2. T. K. Frederiksen, T. P. Jakobsen, J. B. Nielsen, P. S. Nordholt, and C. Orlandi. MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions. EUROCRYPT '13. http://eprint.iacr.org/2013/155.
3. R. Gennaro, C. Gentry, and B. Parno. Non-Interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers. CRYPTO'10, pages 465-482.
4. O. Goldreich. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, 2004.
5. O. Goldreich, S. Micali, and A. Wigderson. How to Play any Mental Game. STOC '87, pp. 218-229.
6. V. Goyal, P. Mohassel, and A. Smith. Efficient Two-Party and Multiparty Computation against Covert Adversaries. EUROCRYPT'08, pp. 289-306.
7. D. Hofheinz. Possibility and Impossibility Results for Selective Decommitments. J. Cryptol., 24(3):470-516, 2011.
8. Y. Huang, D. Evans, J. Katz, and L. Malka. Faster Secure Two-Party Computation using Garbled Circuits. USENIX SEC'11, pp. 35-35.
9. R. Impagliazzo and D. Zuckerman. How to Recycle Random Bits. SFCS '89.
10. S. Jarecki and V. Shmatikov. Efficient Two-Party Secure Computation on Committed Inputs. EUROCRYPT '07, pp. 97-114.
11. M. Kiraz. Secure and Fair Two-Party Computation. PhD thesis, Technische Universiteit Eindhoven, 2008.
12. M. Kiraz and B. Schoenmakers. A Protocol Issue for The Malicious Case of Yao's Garbled Circuit Construction. In 27th Symposium on Information Theory in the Benelux, 2006.
13. V. Kolesnikov and T. Schneider. Improved Garbled Circuit: Free XOR Gates and Applications. ICALP '08, pp. 486-498.
14. B. Kreuter, a. shelat, and C. Shen. Billion-Gate Secure Computation with Malicious Adversaries. USENIX SEC'12, 2012.
15. Y. Lindell and B. Pinkas. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. EUROCRYPT '07.
16. Y. Lindell and B. Pinkas. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. TCC'11, pp. 329-346.
17. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay: A Secure Two-Party Computation System. USENIX SEC'04, volume 13, pp. 287-302.
18. P. Mohassel and M. Franklin. Efficiency Tradeoffs for Malicious Two-Party Computation. PKC'06, pp. 458-473.
19. P. Mohassel and B. Riva. Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation, 2013. http://eprint.iacr.org/2013/ 051.
20. J. Nielsen and C. Orlandi. LEGO for Two-Party Secure Computation. TCC'09, volume 5444 of LNCS, pages 368-386.
21. J. B. Nielsen, P. S. Nordholt, C. Orlandi, and S. S. Burra. A New Approach to Practical Active-Secure Two-Party Computation. CRYPTO '12, 2012.
22. B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams. Secure Two-Party Computation is Practical. ASIACRYPT '09, pp. 250-267.
23. a. shelat and C.-H. Shen. Two-Output Secure Computation with Malicious Adversaries. EUROCRYPT'11, pp 386-405.
24. Stampede. Tacc stampede. http://www.tacc.utexas.edu/resources/hpc/ stampede.
25. D. Woodruff. Revisiting the Efficiency of Malicious Two-Party Computation. EUROCRYPT'07, volume 4515 of LNCS, pp. 79-96.
26. A. C. Yao. Protocols for Secure Computations. SFCS '82, pp. 160-164.