Filters








34 Hits in 6.6 sec

The Melbourne Shuffle: Improving Oblivious Storage in the Cloud [article]

Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal
2014 arXiv   pre-print
Our method can be used to improve previous oblivious storage solutions for network-based outsourcing of data.  ...  We present a simple, efficient, and secure data-oblivious randomized shuffle algorithm. This is the first secure data-oblivious shuffle that is not based on sorting.  ...  shuffle O( √ n) O( √ n) O(n) O( √ n) Melbourne shuffle (c ≥ 3) O( c √ n) O( c √ n) O(n) O(c c √ n c−1 ) Improved Oblivious Storage.  ... 
arXiv:1402.5524v1 fatcat:47dzh7idpreypfycy5es7x4kum

CacheShuffle: An Oblivious Shuffle Algorithm Using Caches [article]

Sarvar Patel, Giuseppe Persiano, Kevin Yeo
2017 arXiv   pre-print
The task of K-Oblivious Shuffling is to obliviously shuffle N encrypted blocks that have been randomly allocated on the server in such a way that an adversary learns nothing about the new allocation of  ...  Finally, we consider the case in which, in addition to the N blocks, the server stores D dummy blocks whose content is is irrelevant but still their positions must be hidden by the shuffling.  ...  To provide a fair comparison, we will ensure to pick parameters such that CacheShuffle uses the same client storage as the Melbourne Shuffle. The Melbourne Shuffle requires O( √ N ) client storage.  ... 
arXiv:1705.07069v3 fatcat:73fmfsu7iveqdocrh3ebltkc7u

CacheShuffle: A Family of Oblivious Shuffles

Sarvar Patel, Giuseppe Persiano, Kevin Yeo, Michael Wagner
2018 International Colloquium on Automata, Languages and Programming  
CacheShuffleRoot is a 4x improvement over the previous best known N -oblivious shuffle for practical sizes of N .  ...  In this paper, we introduce a generalization of the oblivious shuffling problem, the Koblivious shuffling problem, and provide bandwidth efficient algorithms for a wide range of client storage requirements  ...  We also consider the case where we shuffle N real blocks along with D dummy blocks. In this case, the contents of dummy blocks are irrelevant.  ... 
doi:10.4230/lipics.icalp.2018.161 dblp:conf/icalp/PatelPY18 fatcat:w6rwu7uyu5ht7nsmxynfquewoa

Mix-ORAM: Using delegate shuffles [article]

Raphael R. Toledo, George Danezis, Isao Echizen
2017 arXiv   pre-print
Oblivious RAM (ORAM) is a key technology for providing private storage and querying on untrusted machines but is commonly seen as impractical due to the high overhead of the re-randomization, called the  ...  We propose in this work to securely delegate the eviction to semi-trusted third parties to enable any client to accede the ORAM technology and present four different designs inspired by mix-net technologies  ...  In these schemes, the records are first locally encrypted and permuted in a new order before being uploaded to the untrusted cloud storage.  ... 
arXiv:1709.01008v1 fatcat:3rufdzq4hjgu7kx4y3xtdy4zqu

PRO-ORAM: Constant Latency Read-Only Oblivious RAM [article]

Shruti Tople, Yaoqi Jia, Prateek Saxena
2018 IACR Cryptology ePrint Archive  
However, the best known ORAM schemes require a logarithmic computation time in the general case which makes it infeasible for use in real-world applications.  ...  Oblivious RAM is a well-known cryptographic primitive to hide data access patterns.  ...  To obliviously shuffle the data in parallel with the accesses, we select the Melbourne shuffle scheme, that allows shuffling of data of O(N) in O( √ N) steps.  ... 
dblp:journals/iacr/TopleJS18 fatcat:wta5x2mqrja5ribfaevoydptru

PRO-ORAM: Practical Read-Only Oblivious RAM

Shruti Tople, Yaoqi Jia, Prateek Saxena
2019 International Symposium on Recent Advances in Intrusion Detection  
We observe that a large number of cloud-based storage services have a read-only model of data consumption.  ...  Although a long line of research has improved the performance overhead of ORAM solutions [20, 32, 37, 40, 42, 43] , it is still considerably high for use in practice.  ...  This research is supported in part by the National Research Foundation, Prime Ministers Office, Singapore under its National Cybersecurity R&D Program (TSUNAMi project, Award No.  ... 
dblp:conf/raid/TopleJS19 fatcat:rqhmm5v425f6piams623xh57ry

PermuteRam: Optimizing Oblivious Computation for Efficiency [article]

Shruti Tople, Hung Dang, Prateek Saxena, Ee-Chien Chang
2017 IACR Cryptology ePrint Archive  
Next, we claim that algorithms having Perpat pattern execute in an input-oblivious manner.  ...  In this work, we present an algorithm-specific approach to achieve input-oblivious execution. We call this class of algorithms PermuteRam.  ...  This setting is practical and observed in many real world scenarios such as in cloud storage where the memory on client side can be considered private and the storage space at the cloud provider is huge  ... 
dblp:journals/iacr/TopleDSC17 fatcat:ddf6emcznrazdecvjrcz3zw4ti

Privacy-Preserving Computation with Trusted Computing via Scramble-then-Compute

Hung Dang, Tien Tuan Anh Dinh, Ee-Chien Chang, Beng Chin Ooi
2017 Proceedings on Privacy Enhancing Technologies  
In this paper, we advocate a simple approach wherein many basic algorithms (e.g., sorting) can be made privacy-preserving by adding a step that securely scrambles the data before feeding it to the original  ...  Simply ensuring that the data remains encrypted outside the trusted computing environment is insufficient to preserve data privacy, for data movement observed during computation could leak information.  ...  All opinions and findings expressed in this work are those of the authors and do not necessarily reflect the views of any of the sponsors.  ... 
doi:10.1515/popets-2017-0026 dblp:journals/popets/DangDCO17 fatcat:25kvpphyyjgolcsv5refjcp5y4

BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized Outsourced Storage [article]

Michael T. Goodrich
2017 arXiv   pre-print
We present a novel ORAM scheme that improves the asymptotic I/O overhead of previous schemes for a wide range of size parameters for client-side private memory and message blocks, from logarithmic to polynomial  ...  Algorithms for oblivious random access machine (ORAM) simulation allow a client, Alice, to obfuscate a pattern of data accesses with a server, Bob, who is maintaining Alice's outsourced data while trying  ...  Acknowledgments This research was supported in part by the National Science Foundation under grant 1228639.  ... 
arXiv:1709.06534v1 fatcat:g4n6waniuvc6je2s3qlqeuvhji

ObliDC

Pengfei Wu, Qingni Shen, Robert H. Deng, Ximeng Liu, Yinghui Zhang, Zhonghai Wu
2019 Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security - Asia CCS '19  
Data privacy is becoming one of the most critical concerns in cloud computing.  ...  Several proposals based on Intel SGX such as VC3 [1] and M 2 R [2] have been introduced in the literature to protect data privacy during job execution in the cloud.  ...  [14] also find VC3 insecure during shuffling and improves its security by Melbourne shuffle [35] .  ... 
doi:10.1145/3321705.3329822 dblp:conf/ccs/WuSDLZW19 fatcat:n3mnmemxdraztmfkqeth373yz4

Prochlo

Andrea Bittau, Bernhard Seefeld, Úlfar Erlingsson, Petros Maniatis, Ilya Mironov, Ananth Raghunathan, David Lie, Mitch Rudominer, Ushasree Kode, Julien Tinnes
2017 Proceedings of the 26th Symposium on Operating Systems Principles - SOSP '17  
This paper describes a principled systems architecture---Encode, Shuffle, Analyze (ESA)---for performing such monitoring with high utility while also protecting user privacy.  ...  The ESA design, and its Prochlo implementation, are informed by our practical experiences with an existing, large deployment of privacy-preserving software monitoring. (cont.; see the paper)  ...  Acknowledgments This paper is dedicated to the memory of Andrea Bittau, our colleague who wrote much of PROCHLO. We thank Kunal Talwar for his help analyzing Stash Shuffle's security properties.  ... 
doi:10.1145/3132747.3132769 dblp:conf/sosp/BittauEMMRLRKTS17 fatcat:s5icmqnn6jgznjqhh4fo4fzahm

Observing and Preventing Leakage in MapReduce

Olga Ohrimenko, Manuel Costa, Cédric Fournet, Christos Gkantsidis, Markulf Kohlweiss, Divya Sharma
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
The use of public cloud infrastructure for storing and processing large datasets raises new security concerns.  ...  Nonetheless, the distributed processing of large amounts of data still involves intensive encrypted communications between different processing and network storage units, and those communications patterns  ...  Finally, we implemented the Melbourne Shuffle as two runs of the MapReduce job presented in §6.1, both in Java and in C++ for VC3.  ... 
doi:10.1145/2810103.2813695 dblp:conf/ccs/OhrimenkoCFGKS15 fatcat:id3mmzbp3nagnieulvili7sru4

Efficient Range ORAM with 핆(log 2 N) Locality [article]

Anrin Chakraborti, Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche, Radu Sion
2018 IACR Cryptology ePrint Archive  
Typically this is accomplished through random shuffling of the data such that the storage device cannot determine where individual blocks are located, resulting in a highly randomized access pattern.  ...  Oblivious RAM protocols (ORAMs) allow a client to access data from an untrusted storage device without revealing to that device any information about their access pattern.  ...  ACKNOWLEDGMENTS This work is supported by the National Science Foundation under awards 1526707, 1526102, 1319994, 1406177, 1618269 and by the Office of Naval Research.  ... 
dblp:journals/iacr/ChakrabortiACMR18 fatcat:es7anaoqxzhnbfhg4hiqwyffjy

Promoting Public Deliberation in Low Trust Environments: Australian Use Cases

Liam Lander, Nichola Cooper
2017 Social Science Research Network  
This paper discusses the role distributed ledger technology plays in decentralised governance in Australia. with the emergence of numerous electoral phenomena such as: poor civic engagement (particularly  ...  A vacuum of public trust in Australia has met with the maturation of technologically competent constituents.  ...  Using a private audit log an independent third party can verify a personal identity against a blockchain identity but a patented twostep process of "oblivious shuffle" means no one else will be able to  ... 
doi:10.2139/ssrn.3077474 fatcat:ae5ocmalkjecdcsgllo3wsk6ae

Aggregating privatized medical data for secure querying applications

Kalpana Singh, Lynn Batten
2017 Future generations computer systems  
The sharing of data repositories in cloud storage leads logically to opportunities of sharing data in order to improve the identification of 'cause and effect' in health, to effectively track cyclones,  ...  cached searches, and shuffling.  ...  We find the % of male and female, there were 28,371 people in Melbourne (State Suburbs) of these 50.4% were male and 49.6% were female. The median age of people in Melbourne was 28 years.  ... 
doi:10.1016/j.future.2016.11.028 fatcat:fd6kzkwccvhuhltszlq7ysj4yq
« Previous Showing results 1 — 15 out of 34 results