Black-Box Garbled RAM
暂无分享,去创建一个
[1] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[2] Hoeteck Wee,et al. Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[3] Rafail Ostrovsky,et al. Garbled RAM Revisited, Part II , 2014, IACR Cryptol. ePrint Arch..
[4] Mihir Bellare,et al. Foundations of garbled circuits , 2012, CCS.
[5] Miklós Ajtai,et al. Oblivious RAMs without cryptogrpahic assumptions , 2010, STOC '10.
[6] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[7] Oded Goldreich,et al. Towards a theory of software protection and simulation by oblivious RAMs , 1987, STOC.
[8] Michael J. Fischer,et al. Relations Among Complexity Measures , 1979, JACM.
[9] Rafael Pass,et al. Succinct Garbling Schemes and Applications , 2014, IACR Cryptol. ePrint Arch..
[10] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[11] Rafail Ostrovsky,et al. Efficient computation on oblivious RAMs , 1990, STOC '90.
[12] Hoeteck Wee,et al. Black-Box Constructions of Two-Party Protocols from One-Way Functions , 2009, TCC.
[13] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[14] Yehuda Lindell,et al. Black-box constructions for secure computation , 2006, STOC '06.
[15] Ran Canetti,et al. Indistinguishability Obfuscation of Iterated Circuits and RAM Programs , 2014, IACR Cryptol. ePrint Arch..
[16] Craig Gentry,et al. Candidate Multilinear Maps from Ideal Lattices , 2013, EUROCRYPT.
[17] Elaine Shi,et al. Oblivious RAM with O((logN)3) Worst-Case Cost , 2011, ASIACRYPT.
[18] Brent Waters,et al. Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[19] Stephen A. Cook,et al. Time-bounded random access machines , 1972, J. Comput. Syst. Sci..
[20] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[21] Jonathan Katz,et al. Secure two-party computation in sublinear (amortized) time , 2012, CCS.
[22] Craig Gentry,et al. Outsourcing Private RAM Computation , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[23] Rafail Ostrovsky,et al. Perfect Non-Interactive Zero Knowledge for NP , 2006, IACR Cryptol. ePrint Arch..
[24] Craig Gentry,et al. Succinct Randomized Encodings and their Applications. , 2014 .
[25] Yehuda Lindell,et al. A Proof of Security of Yao’s Protocol for Two-Party Computation , 2009, Journal of Cryptology.
[26] Abhi Shelat,et al. SCORAM: Oblivious RAM for Secure Computation , 2014, IACR Cryptol. ePrint Arch..
[27] Rafail Ostrovsky,et al. Constructing Non-malleable Commitments: A Black-Box Approach , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[28] Ivan Damgård,et al. Perfectly Secure Oblivious RAM Without Random Oracles , 2011, IACR Cryptol. ePrint Arch..
[29] Rafail Ostrovsky,et al. Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processing , 2014, Public Key Cryptography.
[30] Kai-Min Chung,et al. Statistically-secure ORAM with Õ(log2 n) Overhead , 2014, ASIACRYPT.
[31] Yuval Ishai,et al. From Secrecy to Soundness: Efficient Verification via Secure Computation , 2010, ICALP.
[32] Rafail Ostrovsky,et al. Distributed Oblivious RAM for Secure Two-Party Computation , 2013, TCC.
[33] Yael Tauman Kalai,et al. How to Run Turing Machines on Encrypted Data , 2013, CRYPTO.
[34] Rafail Ostrovsky,et al. Private information storage (extended abstract) , 1997, STOC '97.
[35] Elaine Shi,et al. Path ORAM: an extremely simple oblivious RAM protocol , 2012, CCS.
[36] Rafail Ostrovsky,et al. Garbled RAM From One-Way Functions , 2015, STOC.
[37] Rafail Ostrovsky,et al. Black-box non-black-box zero knowledge , 2014, IACR Cryptol. ePrint Arch..
[38] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[39] Donald Beaver,et al. Correlated pseudorandomness and the complexity of private computations , 1996, STOC '96.
[40] Rafail Ostrovsky,et al. Garbled RAM Revisited , 2014, EUROCRYPT.
[41] Rafail Ostrovsky,et al. How to Garble RAM Programs , 2013, EUROCRYPT.
[42] Rafail Ostrovsky,et al. Software protection and simulation on oblivious RAMs , 1996, JACM.
[43] Adi Shamir,et al. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions , 1999, SIAM J. Comput..