223 Hits in 4.4 sec

Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions

T-H. Hubert Chan, Elaine Shi, Wei-Kai Lin, Kartik Nayak, Stefano Tessaro
Similarly, Oblivious Parallel RAM (OPRAM) compiles a parallel RAM program to an oblivious counterpart.  ...  In this paper, we revisit the performance metrics for perfect ORAM/OPRAM, and show novel constructions that achieve asymptotical improvements for all performance metrics.  ...  each element. 8:20 Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions Warmup: A Sequential, Linear-Work Intersperse Algorithm Asharov et al  ... 
doi:10.4230/lipics.itc.2021.8 fatcat:3ifbmgvqfrh2ne7bvjb5jhqrfu

Parallel Batch-Dynamic kd-Trees [article]

Rahul Yesantharao
2021 arXiv   pre-print
Our optimizations include parallel cache-oblivious kd-tree construction and parallel bloom filter construction.  ...  In addition, it achieves throughputs of up to 14.5 million updates/second for batch-parallel updates and 6.7 million queries/second for k-NN queries.  ...  Ram, and A. G.  ... 
arXiv:2112.06188v1 fatcat:e5bje74lg5hbnlxanqkhubpqli

Near-Memory Address Translation

Javier Picorel, Djordje Jevdjic, Babak Falsafi
2017 2017 26th International Conference on Parallel Architectures and Compilation Techniques (PACT)  
With storage devices in recent decades dramatically lagging behind processors and memory in performance, and DRAM continuously improving in density and cost, many online services and Revisiting Virtual  ...  between a disk and RAM.  ...  QFlex is composed of three main components: QEMU, Flexus, and NS-3.  ... 
doi:10.1109/pact.2017.56 dblp:conf/IEEEpact/PicorelJF17 fatcat:zgsfj7v4pjazdcfb5hcyemndea

Graphics processing unit (GPU) programming strategies and trends in GPU computing

André R. Brodtkorb, Trond R. Hagen, Martin L. Sætra
2013 Journal of Parallel and Distributed Computing  
Explicit finite volume methods typically rely on stencil computations, making them inherently parallel, and therefore a near perfect match for the many-core graphics processing unit (GPU) found on today's  ...  This work extends to architectures similar to the GPU and to other hyperbolic conservation laws. iii iv  ...  Oslo (Saetra and Lie).  ... 
doi:10.1016/j.jpdc.2012.04.003 fatcat:7s4fnkx3yrekbmxabztmto5fzq

Outsourced private information retrieval

Yizhou Huang, Ian Goldberg
2013 Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society - WPES '13  
We observe that by layering PIR on top of an Oblivious RAM (ORAM) data layout, we provide the ability for the database owner to perform private writes, while database clients can perform private reads  ...  has a fast network connection to the database servers, and about 1 minute over a slow ADSL connection.  ...  BACKGROUND Oblivious RAM Oblivious RAM (ORAM) was first studied by Goldreich and Ostrovsky [12] .  ... 
doi:10.1145/2517840.2517854 dblp:conf/wpes/HuangG13 fatcat:4733eodivferfder4tdjmfpxmm

Black-Box Garbled RAM

Sanjam Garg, Steve Lu, Rafail Ostrovsky
2015 2015 IEEE 56th Annual Symposium on Foundations of Computer Science  
Perfectly secure oblivious RAM without random oracles.  ...  Towards a theory of software protection and simulation by oblivious RAMs.  ... 
doi:10.1109/focs.2015.22 dblp:conf/focs/GargLO15 fatcat:7bwknym2nnhx5pitklb674b64q


Martin Maas, Eric Love, Emil Stefanov, Mohit Tiwari, Elaine Shi, Krste Asanovic, John Kubiatowicz, Dawn Song
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
the data needed, and completing and reviewing the collection of information.  ...  Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining  ...  Oblivious RAM To provide obliviousness, we rely on an algorithmic construct called Oblivious RAM (ORAM), initially proposed by Goldreich and Ostrovsky [31] , and later improved in numerous subsequent  ... 
doi:10.1145/2508859.2516692 dblp:conf/ccs/MaasLSTSAKS13 fatcat:q2y4y6qas5fobe5nb47xla42be

Visor: Privacy-Preserving Video Analytics as a Cloud Service [article]

Rishabh Poddar and Ganesh Ananthanarayanan and Srinath Setty and Stavros Volos and Raluca Ada Popa
2020 arXiv   pre-print
Visor is up to 1000× faster than naïve oblivious solutions, and its overheads relative to a non-oblivious baseline are limited to 2×–6×.  ...  Visor executes video pipelines in a hybrid TEE that spans both the CPU and GPU.  ...  , Futurewei, Google, Intel, Microsoft, Nvidia, Scotiabank, Splunk, and VMware.  ... 
arXiv:2006.09628v2 fatcat:ipifnn7tuberjimmgss6azglte

Adaptive Oblivious Transfer and Generalization [chapter]

Olivier Blazy, Céline Chevalier, Paul Germouty
2016 Lecture Notes in Computer Science  
After the first query, there is no improvement on the global scheme complexity and so subsequent queries each have a global complexity of O(|DB|) meaning that there is no gain compared to running completely  ...  Our approach generalizes Oblivious Signature-Based Envelope, to handle more expressive credentials and requests from the user.  ...  Oblivious transfer has a fundamental role for achieving secure multi-party computation: It is for example needed for every bit of input in Yao's protocol [Yao86] as well as for Oblivious RAM ( [WHC +  ... 
doi:10.1007/978-3-662-53890-6_8 fatcat:hqptla6mpfgrlpz3uopbal3sc4

A Bit More Than a Bit Is More Than a Bit Better

Syed Mahbub Hafiz, Ryan Henry
2019 Proceedings on Privacy Enhancing Technologies  
for data and yet no pair of servers colludes in a bid to violate said obliviousness.  ...  The new constructions extend a multiserver PIR protocol of Shah, Rashmi, and Ramchandran (ISIT 2014), which exhibits a remarkable property of its own: to fetch a b-bit record from a collection of r such  ...  Our contributions In this paper, we revisit the "one-extra-bit" construction of Shah et al. with an eye toward mathematical rigor and concrete practicality.  ... 
doi:10.2478/popets-2019-0061 dblp:journals/popets/HafizH19 fatcat:xj5sdn7nz5fwzcce2jbn2he6zy

PTHash: Revisiting FCH Minimal Perfect Hashing [article]

Giulio Ermanno Pibiri, Roberto Trani
2021 arXiv   pre-print
Almost thirty years later we revisit their framework and present an improved algorithm that scales well to large sets and reduces space consumption altogether, without compromising the lookup time.  ...  However, the approach received little attention because of its large construction time and higher space consumption compared to other subsequent techniques.  ...  Future work will target parallel and external-memory construction, e.g., by splitting the input into chunks and building an independent MPHF on each chunk [7] ; and devise even more succinct encodings  ... 
arXiv:2104.10402v1 fatcat:s5dvbkhkezf75lo3jn6evruz64

Array Layouts for Comparison-Based Searching [article]

Paul-Virak Khuong, Pat Morin
2017 arXiv   pre-print
van Emde Boas layout commonly used in the cache-oblivious algorithms literature.  ...  In particular, we consider the important case where there are many such queries to the same array, A, which resides entirely in RAM.  ...  We are also grateful to the anonymous referees for bringing references [22] and [14] to our attention.  ... 
arXiv:1509.05053v2 fatcat:jucavh7yhbhbzo66uz7fqiqreu

A Language for Probabilistically Oblivious Computation [article]

David Darais, Ian Sweet, Chang Liu, Michael Hicks
2019 arXiv   pre-print
We prove that Lambda Obliv's type system enforces obliviousness and show that it is expressive enough to typecheck advanced tree-based oblivious RAMs.  ...  An oblivious computation is one that is free of direct and indirect information leaks, e.g., due to observable differences in timing and memory access patterns.  ...  A countermeasure against an unscrupulous provider is to store code and data in oblivious RAM (ORAM) [Maas et al. 2013; Suh et al. 2003 ].  ... 
arXiv:1711.09305v4 fatcat:whl6llee4vdtrmvor6flfcx2ea

Holistic Influence Maximization

Sainyam Galhotra, Akhil Arora, Shourya Roy
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
In addition, our experiments show that both OSIM and EaSyIM are effective, efficient, scalable and significantly enhance the ability to analyze real datasets.  ...  To better explain the OSIM heuristic, we first introduce EaSyIM - the opinion-oblivious version of OSIM, a scalable algorithm capable of running within practical compute times on commodity hardware.  ...  Acknowledgements We would like to thank Sayan Ranu, Arnab Bhattacharya, Srikanta Bedathur and Jeff Ullman for providing valuable suggestions and insights throughout the course of this work.  ... 
doi:10.1145/2882903.2882929 dblp:conf/sigmod/GalhotraAR16 fatcat:e3yp56bfs5dofmoe2rjqst2wwi

Multi-party Indirect Indexing and Applications [chapter]

Matthew Franklin, Mark Gondree, Payman Mohassel
Advances in Cryptology – ASIACRYPT 2007  
Also, the messages passed between the database and the other parties are the same as those passed during the oblivious transfer protocol from Section 5.2, whose communication complexity is Θ(k log 2 n  ...  We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmic blow-up.  ...  Further, we can construct a multiparty generalization of Naor-Nissim circuits with look-up tables [27] , enabling any number of parties to privately and obliviously simulate a RAM machine with only polylogarithmic  ... 
doi:10.1007/978-3-540-76900-2_17 dblp:conf/asiacrypt/FranklinGM07 fatcat:wr2iv4x6dfajvbydlzkve4bsne
« Previous Showing results 1 — 15 out of 223 results