Search Results

1 - 10 of 23 items :

  • "Oblivious RAM" x
Clear All
Externally Verifiable Oblivious RAM

. Fletcher, L. Ren, E. Shi, and D. Wichs. Onion ORAM: A constant bandwidth blowup oblivious RAM. In IACR Theory of Cryptography Conference–TCC , pages 145–174. Springer, 2016. [5] O. Goldreich. Towards a theory of software protection and simulation by oblivious RAMs. In Symposium on Theory of Computing–STOC , pages 182–194. ACM, 1987. [6] O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious RAMs. J. ACM , 43(3):431–473, May 1996. [7] A. Kosba, A. Miller, E. Shi, Z. Wen, and C. Papamanthou. Hawk: The blockchain model of

Open access
Differentially Private Oblivious RAM

Gadepally, Richard Shay, John Darby Mitchell, and Robert K. Cunningham. Sok: Cryptographically protected database search. In IEEE Symposium on Security and Privacy (S&P) , 2017. [11] Vincent Bindschaedler, Muhammad Naveed, Xiaorui Pan, XiaoFeng Wang, and Yan Huang. Practicing oblivious access on cloud storage: The gap, the fallacy, and the new way forward. In ACM Conference on Computer and Communications Security (CCS) , 2015. [12] Dan Boneh, David Mazieres, and Raluca Ada Popa. Remote oblivious storage: Making oblivious RAM practical. 2011. [13] TH

Open access
SqORAM: Read-Optimized Sequential Write-Only Oblivious RAM

References [1] G. Asharov, T.-H. H. Chan, K. Nayak, R. Pass, L. Ren, and E. Shi, “Locality-preserving oblivious ram,” vol. 11477, pp. 214–243, 2019. [2] A. J. Aviv, S. G. Choi, T. Mayberry, and D. S. Roche, “Oblivisync: Practical oblivious file backup and synchronization,” in 24th Annual Network and Distributed System Security Symposium, NDSS 2017, San Diego, California, USA, February 26 - March 1, 2017 , 2017. [3] E.-O. Blass, T. Mayberry, G. Noubir, and K. Onarlioglu, “Hive,” “ http://www.onarlioglu.com/hive ”. [4] E. Blass, T. Mayberry

Open access
Recursive Trees for Practical ORAM

References [1] D. Boneh, D. Mazières, and R.A. Popa. Remote oblivious storage: Making oblivious RAM practical, 2011. http://dspace.mit.edu/bitstream/handle/1721.1/62006/MITCSAIL-TR-2011-018.pdf . [2] K. Brown. Balls in bins with limited capacity, 2014. http://www.mathpages.com/home/kmath337.htm . [3] G. Casella and R.L. Berger. Statistical inference . Duxbury advanced series in statistics and decision sciences. Thomson Learning, 2002. ISBN 9780534243128. [4] K.-M. Chung and R. Pass. A Simple ORAM. IACR Cryptology ePrint Archive , 2013

Open access
Toward Practical Secure Stable Matching

protection and simulation on oblivious rams. Journal of the ACM (JACM), 43(3):431-473, 1996. [11] Philippe Golle. A private stable matching algorithm. In FC’06, volume 4107 of LNCS, pages 65-80. Springer, 2006. [12] 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 ACM CSS’12, pages 513-524. ACM, 2012. [13] Dan Gusfield and Robert W Irving. The stable marriage problem: Structure and algorithms

Open access
ConsenSGX: Scaling Anonymous Communications Networks with Trusted Execution Environments

. Syverson. Bridging and Fingerprinting: Epistemic Attacks on Route Selection. In 8th Privacy Enhancing Technologies Symposium (PETS) . Springer, 2008. [20] S. Devadas, M. van Dijk, C. W. Fletcher, L. Ren, E. Shi, and D. Wichs. Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM. In Theory of Cryptography Conference (TCC) . Springer, 2016. [21] R. Dingledine, N. Mathewson, and P. Syverson. Tor: The Second-Generation Onion Router. In 13th USENIX Security Symposium , 2004. [22] J. R. Douceur. The Sybil attack. In International Workshop on Peer

Open access
Private Evaluation of Decision Trees using Sublinear Cost

software protection and simulation by oblivious rams. In STOC , pages 182–194, New York, NY, USA, 1987. ACM. [29] O. Goldreich. Foundations of Cryptography: Volume 2, Basic Applications . Cambridge University Press, New York, NY, USA, 2004. [30] O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious rams. J. ACM , 43(3):431–473, May 1996. [31] S. D. Gordon, J. Katz, V. Kolesnikov, F. Krell, T. Malkin, M. Raykova, and Y. Vahlis. Secure two-party computation in sublinear (amortized) time. In CCS , pages 513–524, 2012. [32

Open access
DataLair: Efficient Block Storage with Plausible Deniability against Multi-Snapshot Adversaries

file system. pages 43–60, 1998. [7] Erik-Oliver Blass, Travis Mayberry, Guevara Noubir, and Kaan Onarlioglu. Toward robust hidden volumes using write-only oblivious ram. In Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security , CCS ’14, pages 203–214, New York, NY, USA, 2014. ACM. [8] Ran Canetti, Cynthia Dwork, Moni Naor, and Rafail Ostrovsky. Deniable encryption. In Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology , CRYPTO ’97, pages 90–104, London, UK, UK, 1997. Springer

Open access
Security-Efficiency Tradeoffs in Searchable Encryption

References [AKL + 18] Asharov, G., Komargodski, I., Lin, W.K., Nayak, K., Peserico, E., and Shi, E. OptORAMa: Optimal oblivious ram. Cryptology ePrint Archive, Report 2018/892 (2018). https://eprint.iacr.org/2018/892 . [ANSS16] Asharov, G., Naor, M., Segev, G., and Shahaf, I. Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. In: D. Wichs and Y. Mansour (eds.), 48th ACM STOC, pp. 1101–1114. ACM Press (Jun. 2016). [ASS18] Asharov, G., Segev, G., and Shahaf, I. Tight tradeoffs in searchable

Open access
Efficient Dynamic Searchable Encryption with Forward Privacy

. Garg, P. Mohassel, and C. Papamanthou, “Tworam: efficient oblivious ram in two rounds with applications to searchable encryption,” in Annual Cryptology Conference , 2016. [15] O. Goldreich and R. Ostrovsky, “Software protection and simulation on oblivious rams,” Journal of the ACM , vol. 43, no. 3, 1996. [16] M. T. Goodrich and M. Mitzenmacher, “Privacy-preserving access of outsourced data via oblivious ram simulation,” in International Colloquium on Automata, Languages and Programming , 2011. [17] M. Islam, M. Kuzu, and M. Kantarcioglu, “Access

Open access