Circuit structures for improving efficiency of security and privacy tools

Proceedings - IEEE Symposium on Security and Privacy

Volumn , Issue , 2013, Pages 493-507

  Zahur, Samee ^a   Evans, David ^a  

^a UNIVERSITY OF VIRGINIA   (United States)

Author keywords

circuits; optimization; secure computation; symbolic execution

Indexed keywords

BOOLEAN LOGIC CIRCUITS; CIRCUIT CONSTRUCTION; CIRCUIT STRUCTURES; GENERIC PROTOCOLS; IMPROVING EFFICIENCY; SECURE COMPUTATION; SECURITY AND PRIVACY; SYMBOLIC EXECUTION;

COMPUTATION THEORY; NETWORKS (CIRCUITS); OPTIMIZATION; SECURITY OF DATA; TOOLS;

CRYPTOGRAPHY;

EID: 84881219897     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2013.40     Document Type: Conference Paper

References (54)

1. Saswat Anand, Patrice Godefroid, and Nikolai Tillmann, "Demand-driven compositional symbolic execution," Tools and Algorithms for the Construction and Analysis of Systems, 2008.
2. A.E. Andreev, "On a method for obtaining lower bounds for the complexity of individual monotone functions," in Soviet Math. Dokl, vol. 31, no. 3, 1985.
3. Domagoj Babic and Alan J. Hu, "Calysto: Scalable and precise extended static checking," in Software Engineering, 2008. ICSE'08. ACM/IEEE 30th International Conference on. IEEE, 2008.
4. Ken E. Batcher, "Sorting networks and their applications," in Proceedings of the April 30-May 2, 1968, spring joint computer conference. ACM, 1968.
5. Armin Biere, "Lingeling and friends at the sat competition 2011," FMV Report Series Technical Report, vol. 11, no. 1, 2011.
6. Dan Bogdanov, Riivo Talviste, and Jan Willemson, "Deploying secure multi-party computation for financial data analysis," Financial Cryptography and Data Security, 2012.
7. Peter Bogetoft, Dan Christensen, Ivan Damgård, Martin Geisler, Thomas Jakobsen, Mikkel Krøigaard, Janus Nielsen, Jesper Nielsen, Kurt Nielsen, Jakob Pagter et al., "Secure multiparty computation goes live," Financial Cryptography and Data Security, 2009.
8. Ravi B. Boppana, "Amplification of probabilistic boolean formulas," in Foundations of Computer Science, 1985., 26th Annual Symposium on. IEEE, 1985.
9. Cristian Cadar, Daniel Dunbar, and Dawson Engler, "Klee: Unassisted and automatic generation of high-coverage tests for complex systems programs," in Proceedings of the 8th USENIX conference on Operating systems design and implementation, 2008.
10. Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, David L. Dill, and Dawson R. Engler, "Exe: automatically generating inputs of death," ACM Transactions on Information and System Security (TISSEC), vol. 12, no. 2, 2008.
11. Alberto Coen-Porisini, Giovanni Denaro, Carlo Ghezzi, and Mauro Pezzé, "Using symbolic execution for verifying safety-critical systems," ACM SIGSOFT Software Engineering Notes, vol. 26, no. 5, 2001.
12. Leonardo De Moura and Nikolaj Bjørner, "Z3: An efficient smt solver," Tools and Algorithms for the Construction and Analysis of Systems, 2008.
13. Martin Ester, Hans-Peter Kriegel, Jörg Sander, and Xiaowei Xu, "A density-based algorithm for discovering clusters in large spatial databases with noise," in Proceedings of the 2nd International Conference on Knowledge Discovery and Data mining, vol. 1996. AAAI Press, 1996.
14. Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, and Raymie Stata, "Extended static checking for java," in ACM Sigplan Notices, vol. 37, no. 5. ACM, 2002.
15. Michael J. Freedman, Kobbi Nissim, and Benny Pinkas, "Efficient private matching and set intersection," in Advances in Cryptology-EUROCRYPT 2004. Springer, 2004.
16. Vijay Ganesh and David Dill, "A decision procedure for bit-vectors and arrays," in Computer Aided Verification. Springer, 2007.
17. Craig Gentry, "A fully homomorphic encryption scheme," Ph.D. dissertation, Stanford University, 2009.
18. Patrice Godefroid, "Compositional dynamic test generation," in ACM SIGPLAN Notices, vol. 42, no. 1. ACM, 2007.
19. Patrice Godefroid, Michael Y. Levin, and David Molnar, "Automated whitebox fuzz testing," in Network and Distributed System Security Symposium (NDSS), 2008.
20. Patrice Godefroid, Aditya V. Nori, Sriram K. Rajamani, and Sai Deep Tetali, "Compositional may-must program analysis: unleashing the power of alternation," in ACM Sigplan Notices, vol. 45, no. 1. ACM, 2010.
21. Shafi Goldwasser, Silvio M. Micali, and Avi Wigderson, "How to play any mental game, or a completeness theorem for protocols with an honest majority," in Proc. of the Nienteenth Annual ACM STOC, vol. 87, 1987.
22. Michael T. Goodrich, "Randomized shellsort: A simple oblivious sorting algorithm," in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2010.
23. S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov, Fernando Krell, Tal Malkin, Mariana Raykova, and Yevgeniy Vahlis, "Secure two-party computation in sublinear (amortized) time," in 19th ACM Conference on Computer and Communications Security (CCS), 2012.
24. Trevor Hansen, Peter Schachte, and Harald Søndergaard, "State joining and splitting for the symbolic execution of binaries," in Runtime Verification. Springer, 2009.
25. Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg, "Tasty: tool for automating secure two-party computations," in Proceedings of the 17th ACM conference on Computer and communications security. ACM, 2010.
26. Andreas Holzer, Martin Franz, Stefan Katzenbeisser, and Helmut Veith, "Secure two-party computations in ansi c," in Proceedings of the 2012 ACM conference on Computer and communications security. ACM, 2012.
27. Yan Huang, David Evans, and Jonathan Katz, "Private set intersection: Are garbled circuits better than custom protocols," in Network and Distributed System Security Symposium (NDSS), 2011.
28. Yan Huang, David Evans, Jonathan Katz, and Lior Malka, "Faster secure two-party computation using garbled circuits," in USENIX Security Symposium, 2011.
29. Yan Huang, Jonathan Katz, and David Evans, "Quid-pro-quotocols: Strengthening semi-honest protocols with dual execution," in Security and Privacy (SP), 2012 IEEE Symposium on. IEEE, 2012.
30. Yan Huang, Lior Malka, David Evans, and Jonathan Katz, "Efficient privacy-preserving biometric identification," in Network and Distributed System Security Symposium, 2011.
31. V.M. Khrapchenko, "The complexity of the realization of symmetrical functions by formulae," Mathematical Notes, vol. 11, no. 1, 1972.
32. Sarfraz Khurshid, Corina PǍsǍreanu, and Willem Visser, "Generalized symbolic execution for model checking and testing," Tools and Algorithms for the Construction and Analysis of Systems, 2003.
33. Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider, "Improved garbled circuit building blocks and applications to auctions and computing minima," Cryptology and Network Security, 2009.
34. Vladimir Kolesnikov and Thomas Schneider, "Improved garbled circuit: Free xor gates and applications," Automata, Languages and Programming, 2008.
35. Ben Kreuter, abhi Shelat, and Chih-hao Shen, "Billion-gate secure computation with malicious adversaries," in Proceedings of the 21st USENIX conference on Security symposium. USENIX Association, 2012.
36. Volodymyr Kuznetsov, Johannes Kinder, Stefan Bucur, and George Candea, "Efficient state merging in symbolic execution," in Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation. ACM, 2012.
37. Yehuda Lindell and Benny Pinkas, "A proof of security of yaos protocol for two-party computation," Journal of Cryptology, vol. 22, no. 2, 2009.
38. -, "Secure two-party computation via cut-and-choose oblivious transfer," Theory of Cryptography, 2011.
39. Dahlia Malkhi, Noam Nisan, Benny Pinkas, and Yaron Sella, "Fairplaya secure two-party computation system," in USENIX Security Symposium, 2004.
40. William Melicher, Samee Zahur, and David Evans, "An intermediate language for garbled circuits (poster abstract)," IEEE Symposium on Security and Privacy, 2012, May 2012.
41. Payman Mohassel and Matthew Franklin, "Efficiency tradeoffs for malicious two-party computation," Public Key Cryptography-PKC 2006, 2006.
42. Moni Naor, Benny Pinkas, and Omer Reingold, "Distributed pseudo-random functions and kdcs," in Advances in CryptologyEUROCRYPT99. Springer, 1999.
43. Jesper B. Nielsen, Peter S. Nordholt, Claudio Orlandi, and Sai S. Burra, "A new approach to practical active-secure two-party computation," Advances in Cryptology-CRYPTO 2012, 2012.
44. Jan Obdržálek and Marek Trtík, "Efficient loop navigation for symbolic execution," Automated Technology for Verification and Analysis, 2011.
45. Benny Pinkas, "Cryptographic techniques for privacy-preserving data mining," ACM SIGKDD Explorations Newsletter, vol. 4, no. 2, pp. 12-19, 2002.
46. Benny Pinkas, Thomas Schneider, Nigel P. Smart, and Stephen C. Williams, "Secure two-party computation is practical," Advances in Cryptology-ASIACRYPT 2009, 2009.
47. Nicholas Pippenger and Michael J. Fischer, "Relations among complexity measures," Journal of the ACM (JACM), vol. 26, no. 2, 1979.
48. Corina S. Psreanu, Peter C. Mehlitz, David H Bushnell, Karen Gundy-Burlet, Michael Lowry, Suzette Person, and Mark Pape, "Combining unit-level symbolic execution and system-level concrete execution for testing nasa software," in Proceedings of the 2008 international symposium on Software testing and analysis. ACM, 2008.
49. Prateek Saxena, Pongsin Poosankam, Stephen McCamant, and Dawn Song, "Loop-extended symbolic execution on binary programs," in Proceedings of the eighteenth international symposium on Software testing and analysis. ACM, 2009.
50. Axel Schropfer, Florian Kerschbaum, and Gunter Muller, "L1-an intermediate language for mixed-protocol secure computation," in Computer Software and Applications Conference (COMPSAC), 2011 IEEE 35th Annual. IEEE, 2011.
51. Claude Shannon, "A symbolic analysis of relay and switching circuits," MIT Master's Thesis, 1937.
52. G.S. Tseitin, "On the complexity of derivation in propositional calculus," Structures in Constructive Mathematics and Mathematical Logic, Part II, 1968.
53. Marten Van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan, "Fully homomorphic encryption over the integers," Advances in Cryptology-EUROCRYPT 2010, 2010.
54. Andrew C. Yao, "Protocols for secure computations," in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982.