Garbled RAM From One-Way Functions
暂无分享,去创建一个
[1] Silvio Micali,et al. How to Construct Random Functions (Extended Abstract) , 1984, FOCS.
[2] Rafael Pass,et al. Succinct Garbling Schemes and Applications , 2014, IACR Cryptol. ePrint Arch..
[3] Ralph C. Merkle,et al. A Digital Signature Based on a Conventional Encryption Function , 1987, CRYPTO.
[4] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[5] Rafail Ostrovsky,et al. Efficient computation on oblivious RAMs , 1990, STOC '90.
[6] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[7] Craig Gentry,et al. Candidate Multilinear Maps from Ideal Lattices , 2013, EUROCRYPT.
[8] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[9] Brent Waters,et al. Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys , 2013, CRYPTO.
[10] Nir Bitansky,et al. Succinct Randomized Encodings and their Applications , 2015, IACR Cryptol. ePrint Arch..
[11] Miklós Ajtai,et al. Oblivious RAMs without cryptogrpahic assumptions , 2010, STOC '10.
[12] Oded Goldreich,et al. Towards a theory of software protection and simulation by oblivious RAMs , 1987, STOC.
[13] Ran Canetti,et al. Indistinguishability Obfuscation of Iterated Circuits and RAM Programs , 2014, IACR Cryptol. ePrint Arch..
[14] Rafail Ostrovsky,et al. Garbled RAM Revisited, Part II , 2014, IACR Cryptol. ePrint Arch..
[15] Brent Waters,et al. Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[16] Kai-Min Chung,et al. A Simple ORAM , 2013, IACR Cryptol. ePrint Arch..
[17] Michael J. Fischer,et al. Relations Among Complexity Measures , 1979, JACM.
[18] Yael Tauman Kalai,et al. How to Run Turing Machines on Encrypted Data , 2013, CRYPTO.
[19] Stephen A. Cook,et al. Time-bounded random access machines , 1972, J. Comput. Syst. Sci..
[20] Yuval Ishai,et al. How to Garble Arithmetic Circuits , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[21] Craig Gentry,et al. Outsourcing Private RAM Computation , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[22] S. Micali,et al. How To Construct Randolli Functions , 1984, FOCS 1984.
[23] Rafail Ostrovsky,et al. On the (in)security of hash-based oblivious RAM and a new balancing scheme , 2012, SODA.
[24] Rafail Ostrovsky,et al. Distributed Oblivious RAM for Secure Two-Party Computation , 2013, TCC.
[25] Yehuda Lindell,et al. A Proof of Security of Yao’s Protocol for Two-Party Computation , 2009, Journal of Cryptology.
[26] Ivan Damgård,et al. Perfectly Secure Oblivious RAM Without Random Oracles , 2011, IACR Cryptol. ePrint Arch..
[27] Rafail Ostrovsky,et al. Private information storage (extended abstract) , 1997, STOC '97.
[28] Mihir Bellare,et al. Foundations of garbled circuits , 2012, CCS.
[29] Jonathan Katz,et al. Secure two-party computation in sublinear (amortized) time , 2012, CCS.
[30] Rafail Ostrovsky,et al. How to Garble RAM Programs , 2013, EUROCRYPT.
[31] Rafail Ostrovsky,et al. Software protection and simulation on oblivious RAMs , 1996, JACM.
[32] Ahmed Obied,et al. Broadcast Encryption , 2008, Encyclopedia of Multimedia.
[33] Craig Gentry,et al. Garbled RAM Revisited, Part I , 2014, IACR Cryptol. ePrint Arch..
[34] Abhi Shelat,et al. SCORAM: Oblivious RAM for Secure Computation , 2014, IACR Cryptol. ePrint Arch..
[35] Craig Gentry,et al. Optimizing ORAM and Using It Efficiently for Secure Computation , 2013, Privacy Enhancing Technologies.
[36] Yuval Ishai,et al. From Secrecy to Soundness: Efficient Verification via Secure Computation , 2010, ICALP.
[37] Rafail Ostrovsky,et al. Garbled RAM Revisited , 2014, EUROCRYPT.
[38] Michael T. Goodrich,et al. Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation , 2010, ICALP.
[39] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[40] Elaine Shi,et al. Path ORAM: an extremely simple oblivious RAM protocol , 2012, CCS.