Filters








2,297 Hits in 4.3 sec

Constants Count: Practical Improvements to Oblivious RAM

Ling Ren, Christopher W. Fletcher, Albert Kwon, Emil Stefanov, Elaine Shi, Marten van Dijk, Srinivas Devadas
2015 USENIX Security Symposium  
Second, if memory can perform simple untrusted computation, Ring ORAM achieves constant online bandwidth (∼ 60× improvement over Path ORAM for practical parameters).  ...  Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns as seen by untrusted storage.  ...  Oblivious RAM (ORAM) is a cryptographic primitive that completely eliminates the information leakage in memory access traces.  ... 
dblp:conf/uss/RenFKSSDD15 fatcat:ohptmx23v5exbajwk72hrwhxli

Constant Communication ORAM with Small Blocksize

Tarik Moataz, Travis Mayberry, Erik-Oliver Blass
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
There have been several attempts recently at using homomorphic encryption to increase the efficiency of Oblivious RAM protocols.  ...  Along with work on pure Oblivious RAM, Mayberry et al. [17] introduced the idea that communication overhead can be greatly reduced if the storage device is also considered to have some computational ability  ...  Acknowledgements: We thank shepherds Chris Fletcher, Ling Ren, and Elaine Shi for valuable discussions improving the paper. This work was partially supported by NSF grant 1218197.  ... 
doi:10.1145/2810103.2813701 dblp:conf/ccs/MoatazMB15 fatcat:qgcy6awkffggpeeoje4zjb23tq

Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM [chapter]

Srinivas Devadas, Marten van Dijk, Christopher W. Fletcher, Ling Ren, Elaine Shi, Daniel Wichs
2015 Lecture Notes in Computer Science  
We present Onion ORAM, an Oblivious RAM (ORAM) with constant worst-case bandwidth blowup that leverages poly-logarithmic server computation to circumvent the logarithmic lower bound on ORAM bandwidth blowup  ...  We also define bandwidth blowup to be bandwidth measured in the number of blocks (i.e., blowup compared to a normal RAM).  ...  Introduction Oblivious RAM (ORAM), initially proposed by Goldreich and Ostrovsky [20, 21, 39] , is a cryptographic primitive that allows a client to store private data on an untrusted server and maintain  ... 
doi:10.1007/978-3-662-49099-0_6 fatcat:vlbwtfqrc5foheq5gtxsyskakq

Random Generation and Approximate Counting of Combinatorial Structures [article]

Massimo Santini
2010 arXiv   pre-print
The aim of this thesis is to determine classes of NP relations for which random generation and approximate counting problems admit an efficient solution.  ...  We introduce the notion of ambiguous description as a tool for random generation and approximate counting in such cases and show, in particular, some applications to the case of formal languages.  ...  a "non-oblivious" version of the goal function is suitably constructed allowing to escape from local optima.  ... 
arXiv:1012.3000v1 fatcat:x2tacwe7wnc6djm2xppaia27t4

The only constant is change

Di Xie, Ning Ding, Y. Charlie Hu, Ramana Kompella
2012 Computer communication review  
the tenants, compared to previous fixed-bandwidth abstractions.  ...  Recently, several virtual network abstractions have been proposed to provide explicit APIs for tenant jobs to specify and reserve virtual clusters (VC) with both explicit VMs and required network bandwidth  ...  However, we envision it is more practical that TIVC models are generated offline, i.e., oblivious to the competing jobs at (future) scheduling time, and hence set maximizing the efficiency as the main  ... 
doi:10.1145/2377677.2377718 fatcat:xi56s6b67zgntluh5f5initkzq

The only constant is change

Di Xie, Ning Ding, Y. Charlie Hu, Ramana Kompella
2012 Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '12  
the tenants, compared to previous fixed-bandwidth abstractions.  ...  Recently, several virtual network abstractions have been proposed to provide explicit APIs for tenant jobs to specify and reserve virtual clusters (VC) with both explicit VMs and required network bandwidth  ...  However, we envision it is more practical that TIVC models are generated offline, i.e., oblivious to the competing jobs at (future) scheduling time, and hence set maximizing the efficiency as the main  ... 
doi:10.1145/2342356.2342397 dblp:conf/sigcomm/XieDHK12 fatcat:qw3ijgs4pfg5tkprkpitswwzbi

Secure Arithmetic Computation with Constant Computational Overhead [chapter]

Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron
2017 Lecture Notes in Computer Science  
We present the first protocol that only makes a constant (amortized) number of field operations per gate.  ...  First, we present a general way to combine any linear code that has a fast encoder and a cryptographic ("LPNstyle") pseudorandomness property with another linear code that supports fast encoding and erasuredecoding  ...  In practice, one can think of this as a small but constant error probability, say 1%.  ... 
doi:10.1007/978-3-319-63688-7_8 fatcat:7cecwsbkwfhbxdvyre3ljh45ou

Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE [article]

Hao Chen, Ilaria Chillotti, Ling Ren
2019 IACR Cryptology ePrint Archive  
Oblivious RAM (ORAM) is a cryptographic primitive that allows a client to hide access pattern to its data encrypted and stored at a remote server.  ...  After three decades of improvements, ORAM algorithms have reached the optimal logarithmic bandwidth blowup. Nonetheless, in many practical use cases, a constant bandwidth overhead is desirable.  ...  ACKNOWLEDGEMENTS We would like to thank the anonymous reviewers and our shepherd, Xiao Wang, for their feedback and helpful comments.  ... 
dblp:journals/iacr/ChenCR19 fatcat:x235vojylfadhlvczmtmb6goly

Secure Count Query on Encrypted Genomic Data [article]

Mohammad Zahidul Hasan, Md Safiur Rahman Mahdi, Noman Mohammed
2017 arXiv   pre-print
To facilitate these types of large scale biomedical research projects, it oftentimes requires to share genomic and clinical data collected by disparate organizations among themselves.  ...  In that case, it is of utmost importance to ensure that sharing, managing and analyzing the data does not reveal the identity of the individuals who contribute their genomic samples.  ...  Experimental Results We have built a prototype of our privacy preserving system to evaluate its practicality and tested its performance on both real and synthetic datasets.  ... 
arXiv:1703.01534v1 fatcat:o55ejgpqczgkvma56odjtgj6qq

Homomorphic String Search with Constant Multiplicative Depth

Charlotte Bonte, Ilia Iliashenko
2020 Proceedings of the 2020 ACM SIGSAC Conference on Cloud Computing Security Workshop  
On the contrary, privateinformation retrieval (PIR) [12], oblivious RAM (ORAM) [17] and privateset intersection (PSI) [8] protocols require data to be converted to a specific format that introduces additional  ...  This circuit not only improves the performance but also increases the practicality of our protocol as it requires the same set of encryption parameters for a wide range of patterns of different lengths  ...  Therefore, to manipulate individual data values one should resort to the coefficient-extraction procedure, which is expensive in practice [6] .  ... 
doi:10.1145/3411495.3421361 fatcat:ji2zoyhzlfe57ogd7nc6yx4gju

Oblivious RAM Simulation with Efficient Worst-Case Access Overhead [article]

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2011 arXiv   pre-print
In this paper, we show how to de-amortize oblivious RAM simulations, so that each access takes a worst-case bounded amount of time.  ...  Oblivious RAM simulation is a method for achieving confidentiality and privacy in cloud computing environments.  ...  This worst-case overhead makes oblivious RAM unsuitable in many practical scenarios, such as real-time systems and multi-user systems.  ... 
arXiv:1107.5093v1 fatcat:xqsxi5z7lbfqjhg7drpzn6x67a

Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses [article]

Ioana O. Bercea, Guy Even
2019 arXiv   pre-print
We also present an application of the techniques used to design our dictionary to the static Retrieval Problem.  ...  The first space-efficient fully-dynamic dictionary that maintains both sets and random multisets and supports queries, insertions, and deletions with a constant number of memory accesses in the worst case  ...  Acknowledgments The authors would like to thank Michael Bender, Martin Farach-Colton, and Rob Johnson for introducing this topic to us and for interesting conversations.  ... 
arXiv:1911.05060v1 fatcat:gly7eefrofe5xgobsba62agjuy

Distributed Oblivious RAM for Secure Two-Party Computation [chapter]

Steve Lu, Rafail Ostrovsky
2013 Lecture Notes in Computer Science  
In our two-server model, we describe a new technique to bypass oblivious sorting, and show how this can be carefully blended with existing techniques to attain a more practical Oblivious RAM protocol in  ...  As alluded above, our two-server Oblivious RAM protocol leads to a novel application in the realm of secure two-party RAM program computation.  ...  Ostrovsky require "Oblivious Sorting" that introduce a huge constant into Oblivious RAM simulation that essentially kills all practicality.  ... 
doi:10.1007/978-3-642-36594-2_22 fatcat:xvo5757svfboplireewndmv3ce

Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant

Alistair Sinclair, Piyush Srivastava, Yitong Yin
2013 2013 IEEE 54th Annual Symposium on Foundations of Computer Science  
We also improve upon Weitz's bounds for strong spatial mixing on bounded degree graphs (Weitz, 2006) by providing a computationally simple method which uses known estimates of the connective constant of  ...  Our techniques also allow us to relate the threshold for the uniqueness of the Gibbs measure on a general tree to its branching factor (Lyons, 1989).  ...  Upper bounds for the connective constant of self-avoiding walks. Combinatorics, Probability and Computing 2, 02 (1993), 115-136.  ... 
doi:10.1109/focs.2013.40 dblp:conf/focs/SinclairSY13 fatcat:zhqzoehkuffunlftw4vllgzr6i

Scaling point set registration in 3D across thread counts on multicore and hardware accelerator platforms through autotuning for large scale analysis of scientific point clouds

Piotr Luszczek, Jakub Kurzak, Ichitaro Yamazaki, David Keffer, Jack Dongarra
2017 2017 IEEE International Conference on Big Data (Big Data)  
More importantly, the results indicate consistently high performance level and ability to move the task of data analysis through point-set registration to any modern compute platform without the concern  ...  Furthermore, we also managed to exploit code transformations that are not that common during manual optimization but yielded better performance in our tests for the EM-ICP algorithm.  ...  68 Hardware thread count 272 Vector FPUs lengty 512 bits Main memory RAM DDR4 Max DDR4 RAM 384 GiB DDR4 latency ≈140 ns Fast RAM 16 GiB MCDRAM Max MCDRAM 16 GiB MCDRAM latency ≈170  ... 
doi:10.1109/bigdata.2017.8258258 dblp:conf/bigdataconf/LuszczekKYKD17 fatcat:bsevphencfeyhagpplozpdes54
« Previous Showing results 1 — 15 out of 2,297 results