Welcome to the resource topic for 2018/698
Title:
Parameter-Hiding Order Revealing Encryption
Authors: David Cash, Feng-Hao Liu, Adam O'Neill, Mark Zhandry, Cong Zhang
Abstract:Order-revealing encryption (ORE) is a popular primitive for outsourcing encrypted databases, as it allows for efficiently performing range queries over encrypted data. Unfortunately, a series of works, starting with Naveed et al. (CCS 2015), have shown that when the adversary has a good estimate of the distribution of the data, ORE provides little protection. In this work, we consider the case that the database entries are drawn identically and independently from a distribution of known shape, but for which the mean and variance are not (and thus the attacks of Naveed et al. do not apply). We define a new notion of security for ORE, called parameter-hiding ORE, which maintains the secrecy of these parameters. We give a construction of ORE satisfying our new definition from bilinear maps.
ePrint: https://eprint.iacr.org/2018/698
Slides: https://asiacrypt.iacr.org/2018/files/SLIDES/MONDAY/514/1110-1225/PHORE.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .