Automating Efficient RAM-Model Secure Computation
暂无分享,去创建一个
Elaine Shi | Jonathan Katz | Yan Huang | Chang Liu | Michael W. Hicks | E. Shi | Jonathan Katz | Chang Liu | Yan Huang | M. Hicks
[1] Abraham Waksman,et al. A Permutation Network , 1968, JACM.
[2] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[3] Bowen Alpern,et al. Detecting equality of variables in programs , 1988, POPL '88.
[4] Rafail Ostrovsky,et al. Software protection and simulation on oblivious RAMs , 1996, JACM.
[5] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[6] Johan Agat,et al. Transforming out timing leaks , 2000, POPL '00.
[7] Andrew C. Myers,et al. Language-based information-flow security , 2003, IEEE J. Sel. Areas Commun..
[8] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[9] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System (Awarded Best Student Paper!) , 2004 .
[10] David Schultz,et al. The Program Counter Security Model: Automatic Detection and Removal of Control-Flow Side Channel Attacks , 2005, ICISC.
[11] David Sands,et al. Termination-Insensitive Noninterference Leaks More Than Just a Bit , 2008, ESORICS.
[12] Peter Williams,et al. Building castles out of mud: practical access pattern privacy and correctness on untrusted storage , 2008, CCS.
[13] Benny Pinkas,et al. Secure Two-Party Computation is Practical , 2009, IACR Cryptol. ePrint Arch..
[14] Ahmad-Reza Sadeghi,et al. TASTY: tool for automating secure two-party computations , 2010, CCS '10.
[15] Jonathan Katz,et al. Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.
[16] Michael T. Goodrich,et al. Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation , 2010, ICALP.
[17] Elaine Shi,et al. Oblivious RAM with O((logN)3) Worst-Case Cost , 2011, ASIACRYPT.
[18] Florian Kerschbaum,et al. Automatically optimizing secure computation , 2011, CCS '11.
[19] Rafail Ostrovsky,et al. On the (in)security of hash-based oblivious RAM and a new balancing scheme , 2012, SODA.
[20] Jonathan Katz,et al. Knowledge-oriented secure multiparty computation , 2012, PLAS.
[21] Helmut Veith,et al. Secure two-party computations in ANSI C , 2012, CCS.
[22] Jonathan Katz,et al. Secure two-party computation in sublinear (amortized) time , 2012, CCS.
[23] Mihir Bellare,et al. Efficient Garbling from a Fixed-Key Blockcipher , 2013, 2013 IEEE Symposium on Security and Privacy.
[24] Patrick Traynor,et al. Secure outsourced garbled circuit evaluation for mobile devices , 2013, J. Comput. Secur..
[25] Michael Hicks,et al. Knowledge inference for optimizing secure multi-party computation , 2013, PLAS '13.
[26] Elaine Shi,et al. Memory Trace Oblivious Program Execution , 2013, 2013 IEEE 26th Computer Security Foundations Symposium.
[27] Elaine Shi,et al. Path ORAM: an extremely simple oblivious RAM protocol , 2012, CCS.
[28] Rafail Ostrovsky,et al. How to Garble RAM Programs , 2013, EUROCRYPT.
[29] David Evans,et al. Circuit Structures for Improving Efficiency of Security and Privacy Tools , 2013, 2013 IEEE Symposium on Security and Privacy.
[30] Abhi Shelat,et al. PCF: A Portable Circuit Format for Scalable Two-Party Secure Computation , 2013, USENIX Security Symposium.
[31] Michael Hicks,et al. Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations , 2014, 2014 IEEE Symposium on Security and Privacy.