Billion-gate secure computation with malicious adversaries

Proceedings of the 21st USENIX Security Symposium

Volumn , Issue , 2012, Pages 285-300

  Kreuter, Benjamin ^a   Shelat, Abhi ^a   Shen, Chih hao ^a  

^a UNIVERSITY OF VIRGINIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON REFERENCE STRING; GATE CIRCUIT; MALICIOUS ADVERSARIES; PARALLELIZING; RANDOM ORACLE MODEL; SECURE COMPUTATION; THE STANDARD MODEL;

CRYPTOGRAPHY;

EID: 84889076745     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. BENDLIN, R., DAMGÅRD, I., ORLANDI, C., AND ZAKARIAS, S. Semi-homomorphic encryption and multiparty computation. In Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology (Berlin, Heidelberg, 2011), EUROCRYPT’11, Springer-Verlag, pp. 169–188.
2. BOGETOFT, P., CHRISTENSEN, D. L., DAMGÅRD, I., GEISLER, M., JAKOBSEN, T. P., KRØIGAARD, M., NIELSEN, J. D., NIELSEN, J. B., NIELSEN, K., PAGTER, J., SCHWARTZBACH, M. I., AND TOFT, T. Secure Multiparty Computation Goes Live. In Financial Cryptography (2009), pp. 325–343.
3. BOYAR, J., AND PERALTA, R. A new combinational logic minimization technique with applications to cryptology. In Proceedings of the 9th international conference on Experimental Algorithms (Berlin, Heidelberg, 2010), SEA’10, Springer-Verlag, pp. 178–189.
4. BRICKELL, J., AND SHMATIKOV, V. Privacy-preserving graph algorithms in the semi-honest model. In Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security (Berlin, Heidelberg, 2005), ASIACRYPT’05, Springer-Verlag, pp. 236–252.
5. CANETTI, R., LINDELL, Y., OSTROVSKY, R., AND SAHAI, A. Universally composable two-party and multi-party secure computation. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (New York, NY, USA, 2002), STOC’02, ACM, pp. 494–503.
6. CHOI, S. G., KATZ, J., KUMARESAN, R., AND ZHOU, H.-S. On the security of the”free-xor” technique. In Proceedings of the 9th international conference on Theory of Cryptography (Berlin, Heidelberg, 2012), TCC’12, Springer-Verlag, pp. 39–53.
7. DAMGARD, I., PASTRO, V., SMART, N., AND ZAKARIAS, S. Multiparty Computation from Somewhat Homomorphic Encryption. In Proceedings of the 32th Annual International Cryptology Conference on Advances in Cryptology (2012), CRYPTO’12. http://eprint.iacr.org/2011/535.
8. FIPS. Advanced Encryption Standard (AES), 2001.
9. GAREY, M., GRAHAM, R., JOHNSON, D., AND KNUTH, D. Complexity results for bandwidth minimization. SIAM Journal on Applied Mathematics 34, 3 (1978), 477–495.
10. GENTRY, C., HALEVI, S., AND SMART, N. P. Homomorphic Evaluation of the AES Circuit. In Proceedings of the 32th Annual International Cryptology Conference on Advances in Cryptology (2012), CRYPTO’12. http://eprint.iacr.org/2012/099.
11. GOYAL, V., MOHASSEL, P., AND SMITH, A. Efficient two party and multi party computation against covert adversaries. In Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology (Berlin, Heidelberg, 2008), EUROCRYPT’08, Springer-Verlag, pp. 289–306.
12. HENECKA, W., K ÖGL, S., SADEGHI, A.-R., SCHNEIDER, T., AND WEHRENBERG, I. Tasty: tool for automating secure two-party computations. In Proceedings of the 17th ACM conference on Computer and communications security (New York, NY, USA, 2010), CCS’10, ACM, pp. 451–462.
13. HUANG, Y., EVANS, D., KATZ, J., AND MALKA, L. Faster secure two-party computation using garbled circuits. In Proceedings of the 20th USENIX conference on Security (Berkeley, CA, USA, 2011), SEC’11, USENIX Association, pp. 35–35.
14. HUANG, Y., MALKA, L., EVANS, D., AND KATZ, J. Efficient Privacy-Preserving Biometric Identification. In NDSS’11 (2011).
15. ISHAI, Y., KILIAN, J., NISSIM, K., AND PETRANK, E. Extending Oblivious Transfers Efficiently. In CRYPTO’03, vol. 2729 of LNCS. Springer Berlin / Heidelberg, 2003, pp. 145–161.
16. ISHAI, Y., PRABHAKARAN, M., AND SAHAI, A. Founding cryptography on oblivious transfer — efficiently. In Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (Berlin, Heidelberg, 2008), CRYPTO 2008, Springer-Verlag, pp. 572–591.
17. JHA, S., KRUGER, L., AND SHMATIKOV, V. Towards practical privacy for genomic computation. In Proceedings of the 2008 IEEE Symposium on Security and Privacy (Washington, DC, USA, 2008), SP’08, IEEE Computer Society, pp. 216–230.
18. KIRAZ, M. Secure and Fair Two-Party Computation. PhD thesis, Technische Universiteit Eindhoven, 2008.
19. KIRAZ, M., AND SCHOENMAKERS, B. A Protocol Issue for The Malicious Case of Yao’s Garbled Circuit Construction. In 27th Symposium on Information Theory in the Benelux (2006).
20. KOLESNIKOV, V., AND SCHNEIDER, T. Improved garbled circuit: Free xor gates and applications. In Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (Berlin, Heidelberg, 2008), ICALP’08, Springer-Verlag, pp. 486–498.
21. LINDELL, Y., OXMAN, E., AND PINKAS, B. The IPS Compiler: Optimizations, Variants and Concrete Efficiency. In CRYPTO’11 (2011), pp. 259–276.
22. LINDELL, Y., AND PINKAS, B. Privacy preserving data mining. In Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology (London, UK, UK, 2000), CRYPTO’00, Springer-Verlag, pp. 36–54.
23. LINDELL, Y., AND PINKAS, B. An efficient protocol for secure two-party computation in the presence of malicious adversaries. In Proceedings of the 26th annual international conference on Advances in Cryptology (Berlin, Heidelberg, 2007), EUROCRYPT’07, Springer-Verlag, pp. 52–78.
24. LINDELL, Y., AND PINKAS, B. Secure two-party computation via cut-and-choose oblivious transfer. In Proceedings of the 8th conference on Theory of cryptography (Berlin, Heidelberg, 2011), TCC’11, Springer-Verlag, pp. 329–346.
25. LYNN, B. Pairing-Based Cryptography Library, 2006. http://crypto.stanford.edu/pbc/.
26. MALKA, L. Vmcrypt: modular software architecture for scalable secure computation. In Proceedings of the 18th ACM conference on Computer and communications security (New York, NY, USA, 2011), CCS’11, ACM, pp. 715–724.
27. MOHASSEL, P., AND FRANKLIN, M. Efficiency tradeoffs for malicious two-party computation. In Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography (Berlin, Heidelberg, 2006), PKC’06, Springer-Verlag, pp. 458–473.
28. NIELSEN, J. B., NORDHOLT, P. S., ORLANDI, C., AND BURRA, S. S. A New Approach to Practical Active-Secure Two-Party Computation. In Proceedings of the 32th Annual International Cryptology Conference on Advances in Cryptology (2012), CRYPTO’12. http://eprint.iacr.org/2011/091.
29. OSADCHY, M., PINKAS, B., JARROUS, A., AND MOSKOVICH, B. Scifi - a system for secure face identification. In Proceedings of the 2010 IEEE Symposium on Security and Privacy (Washington, DC, USA, 2010), SP’10, IEEE Computer Society, pp. 239–254.
30. PINKAS, B., SCHNEIDER, T., SMART, N. P., AND WILLIAMS, S. C. Secure two-party computation is practical. In Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology (Berlin, Heidelberg, 2009), ASIACRYPT’09, Springer-Verlag, pp. 250–267.
31. RELIC. http://code.google.com/p/relic-toolkit/.
32. SHELAT, A., AND SHEN, C.-H. Two-output secure computation with malicious adversaries. In Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology (Berlin, Heidelberg, 2011), EUROCRYPT’11, Springer-Verlag, pp. 386–405.
33. YAO, A. C. Protocols for secure computations. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (Washington, DC, USA, 1982), SFCS’82, IEEE Computer Society, pp. 160–164.