International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 11000 results
Toward Robust Hidden Volumes using Write-Only Oblivious RAM
Erik-Oliver Blass Travis Mayberry Guevara Noubir Kaan Onarlioglu
With sensitive data being increasingly stored on mobile devices and laptops, hard disk encryption is more important than ever. In particular, being able to plausibly deny that a hard disk contains certain information is a...
last revised 4 Sep 2014
Multi-Client Oblivious RAM secure against Malicious Servers
Travis Mayberry Erik-Oliver Blass Guevara Noubir
This paper tackles the open problem whether an Oblivious RAM can be shared among multiple clients in the presence of a fully malicious server. Current ORAM constructions rely on clients knowing the ORAM state to not reveal...
last revised 17 Jul 2017
Practical Forward-Secure Range and Sort Queries with Update-Oblivious Linked Lists
Erik-Oliver Blass Travis Mayberry Guevara Noubir
We revisit the problem of privacy-preserving range search and sort queries on encrypted data in the face of an untrusted data store. Our new protocol RASP has several advantages over existing work. First, RASP strengthens...
last revised 16 Feb 2015
Resizable Tree-Based Oblivious RAM
Tarik Moataz Travis Mayberry Erik-Oliver Blass Agnes Hui Chan
Although newly proposed, tree-based Oblivious RAM schemes are drastically more efficient than older techniques, they come with a significant drawback: an inherent dependence on a fixed-size database. This capability is vital...
last revised 8 Dec 2014
Deterministic, Stash-Free Write-Only ORAM
Daniel S. Roche Adam J. Aviv Seung Geol Choi Travis Mayberry
Write-Only Oblivious RAM (WoORAM) protocols provide privacy by encrypting the contents of data and also hiding the pattern of write operations over that data. WoORAMs provide better privacy than plain encryption and better...
last revised 7 Sep 2017
Constant Communication ORAM with Small Blocksize
Tarik Moataz Travis Mayberry Erik-Oliver Blass
There have been several attempts recently at using homomorphic encryption to increase the efficiency of Oblivious RAM protocols. One of the most successful has been Onion ORAM, which achieves O(1) communication overhead with...
last revised 13 Aug 2015
EPiC: Efficient Privacy-Preserving Counting for MapReduce
Erik-Oliver Blass Guevara Noubir Triet D. Vo-Huu
In the face of an untrusted cloud infrastructure, outsourced data needs to be protected. We present EPiC, a practical protocol for the privacy-preserving evaluation of a fundamental operation on data sets: frequency counting....
last revised 20 Jan 2014
Erik-Oliver Blass
CHf-ORAM: A Constant Communication ORAM without Homomorphic Encryption
Tarik Moataz Erik-Oliver Blass Travis Mayberry
Recent techniques reduce ORAM communication complexity down to constant in the number of blocks N. However, they induce expensive homomorphic encryption on both the server and the client. In this paper, we present an...
last revised 25 May 2016
The $F_f$-Family of Protocols for RFID-Privacy and Authentication
Erik-Oliver Blass Anil Kurmus Refik Molva Guevara Noubir Abdullatif Shikfa
In this paper, we present the design of the lightweight $F_f$ family of privacy-preserving authentication protocols for RFID-systems. $F_f$ is based on a new algebraic framework for reasoning about and analyzing this kind of...
last revised 11 Nov 2008
Efficient Private File Retrieval by Combining ORAM and PIR
Travis Mayberry Erik-Oliver Blass Agnes Hui Chan
Abstract—Recent research results on tree-based Oblivious RAM by Shi et al. [15] obtain communication complexity of O(l · log3(N)) in the worst-case for an N-capacity storage with blocks size l. The individual nodes in the...
last revised 30 Jan 2014
ObliviSync: Practical Oblivious File Backup and Synchronization
Adam J. Aviv Seung Geol Choi Travis Mayberry Daniel S. Roche
Oblivious RAM (ORAM) protocols are powerful techniques that hide a client's data as well as access patterns from untrusted service providers. We present an oblivious cloud storage system, ObliviSync, that specifically targets...
last revised 2 Dec 2016
Secure Logging with Crash Tolerance
Erik-Oliver Blass Guevara Noubir
Forward-secure logging protects old log entries in a log file against an adversary compromising the log device. However, we show that previous work on forward-secure logging is prone to crash-attacks where the adversary...
last revised 28 Apr 2017
Recursive Trees for Practical ORAM
Tarik Moataz Erik-Oliver Blass Guevara Noubir
We present a new, general data structure that reduces the communication cost of recent tree-based ORAMs. Contrary to ORAM trees with constant height and path lengths, our new construction r-ORAM allows for trees with varying...
last revised 14 Aug 2015
PIRMAP: Efficient Private Information Retrieval for MapReduce
Travis Mayberry Erik-Oliver Blass Agnes Hui Chan
Private Information Retrieval (PIR) allows for retrieval of bits from a database in a way that hides a user's access pattern from the server. However, its practicality in a cloud computing setting has recently been questioned....
last revised 3 Sep 2013
Guevara Noubir
Write-Only Oblivious RAM based Privacy-Preserved Access of Outsourced Data
Lichun Li Anwitaman Datta
Oblivious RAM (ORAM) has recently attracted a lot of interest since it can be used to protect the privacy of data user's data access pattern from (honest but curious) outsourced storage. This is achieved by simulating each...
received 25 Oct 2013
Kaan Onarlioglu
Forward Integrity and Crash Recovery for Secure Logs
Erik-Oliver Blass Guevara Noubir
Logging is a key mechanism in the security of computer systems. Beyond supporting important forward security properties, it is critical that logging withstands both failures and intentional tampering to prevent subtle attacks...
last revised 15 May 2019
Travis Mayberry
US Naval Academy
Next ►