Malicious-Client Security in Blind Seer: A Scalable Private DBMS
暂无分享,去创建一个
Tal Malkin | Steven M. Bellovin | Vladimir Kolesnikov | Ben Fisch | Abishek Kumarasubramanian | Fernando Krell | Binh Vo | Ben Fisch | S. Bellovin | T. Malkin | V. Kolesnikov | Abishek Kumarasubramanian | Fernando Krell | B. Vo
[1] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[2] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[3] Richard E. Overill,et al. Foundations of Cryptography: Basic Tools , 2002, J. Log. Comput..
[4] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[5] Andrew Chi-Chih Yao,et al. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[6] Donald Beaver,et al. Precomputing Oblivious Transfer , 1995, CRYPTO.
[7] Jonathan Katz,et al. Secure two-party computation in sublinear (amortized) time , 2012, CCS.
[8] Vladimir Kolesnikov,et al. A Practical Universal Circuit Construction and Secure Evaluation of Private Functions , 2008, Financial Cryptography.
[9] Michael Mitzenmacher,et al. Less hashing, same performance: Building a better Bloom filter , 2006, Random Struct. Algorithms.
[10] Yehuda Lindell,et al. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries , 2007, Journal of Cryptology.
[11] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[12] Rafail Ostrovsky,et al. Software protection and simulation on oblivious RAMs , 1996, JACM.
[13] Claudio Orlandi,et al. A New Approach to Practical Active-Secure Two-Party Computation , 2012, IACR Cryptol. ePrint Arch..
[14] Yehuda Lindell,et al. Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings , 2014, CRYPTO.
[15] Jesper Buus Nielsen,et al. Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free , 2007, IACR Cryptol. ePrint Arch..
[16] Matthew K. Franklin,et al. Efficient Polynomial Operations in the Shared-Coefficients Setting , 2006, Public Key Cryptography.
[17] Alex J. Malozemoff,et al. Amortizing Garbled Circuits , 2015, IACR Cryptol. ePrint Arch..
[18] Yuval Ishai,et al. Protecting data privacy in private information retrieval schemes , 1998, STOC '98.
[19] Yehuda Lindell,et al. A Proof of Security of Yao’s Protocol for Two-Party Computation , 2009, Journal of Cryptology.
[20] Yehuda Lindell,et al. Introduction to Modern Cryptography , 2004 .
[21] Leslie G. Valiant,et al. Universal circuits (Preliminary Report) , 1976, STOC '76.
[22] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[23] Hugo Krawczyk,et al. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries , 2013, IACR Cryptol. ePrint Arch..
[24] Yuval Ishai,et al. OT-Combiners via Secure Computation , 2008, TCC.
[25] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[26] Hugo Krawczyk,et al. Outsourced symmetric private information retrieval , 2013, IACR Cryptol. ePrint Arch..
[27] Vladimir Kolesnikov,et al. Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.
[28] Brent Waters,et al. A Framework for Efficient and Composable Oblivious Transfer , 2008, CRYPTO.
[29] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[30] Moni Naor,et al. Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..
[31] Angelos D. Keromytis,et al. Blind Seer: A Scalable Private DBMS , 2014, 2014 IEEE Symposium on Security and Privacy.
[32] Ahmad-Reza Sadeghi,et al. Practical Secure Evaluation of Semi-Private Functions , 2009, IACR Cryptol. ePrint Arch..
[33] Rafail Ostrovsky,et al. Distributed Oblivious RAM for Secure Two-Party Computation , 2013, TCC.
[34] Yehuda Lindell. Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries , 2015, Journal of Cryptology.