Parameter-hiding order revealing encryption

David Cash; Feng Hao Liu; Adam O’Neill; Mark Zhandry; Cong Zhang

doi:10.1007/978-3-030-03326-2_7

Parameter-hiding order revealing encryption

David Cash, Feng Hao Liu, Adam O’Neill, Mark Zhandry, Cong Zhang

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

17 Scopus citations

Abstract

Order-revealing encryption (ORE) is a primitive for outsourcing encrypted databases which 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.

Original language	English (US)
Title of host publication	Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
Editors	Thomas Peyrin, Steven Galbraith
Publisher	Springer Verlag
Pages	181-210
Number of pages	30
ISBN (Print)	9783030033255
DOIs	https://doi.org/10.1007/978-3-030-03326-2_7
State	Published - 2018
Event	24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018 - Brisbane, Australia Duration: Dec 2 2018 → Dec 6 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11272 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018
Country/Territory	Australia
City	Brisbane
Period	12/2/18 → 12/6/18

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Keywords

Encryption
Order-revealing encryption

Access to Document

10.1007/978-3-030-03326-2_7

Cite this

Cash, D., Liu, F. H., O’Neill, A., Zhandry, M., & Zhang, C. (2018). Parameter-hiding order revealing encryption. In T. Peyrin, & S. Galbraith (Eds.), Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 181-210). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11272 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-03326-2_7

Cash, David ; Liu, Feng Hao ; O’Neill, Adam et al. / Parameter-hiding order revealing encryption. Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. editor / Thomas Peyrin ; Steven Galbraith. Springer Verlag, 2018. pp. 181-210 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9b0cebfb21ef48649c99179b32622738,

title = "Parameter-hiding order revealing encryption",

abstract = "Order-revealing encryption (ORE) is a primitive for outsourcing encrypted databases which 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.",

keywords = "Encryption, Order-revealing encryption",

author = "David Cash and Liu, {Feng Hao} and Adam O{\textquoteright}Neill and Mark Zhandry and Cong Zhang",

note = "Publisher Copyright: {\textcopyright} 2018, International Association for Cryptologic Research.; 24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018 ; Conference date: 02-12-2018 Through 06-12-2018",

year = "2018",

doi = "10.1007/978-3-030-03326-2_7",

language = "English (US)",

isbn = "9783030033255",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "181--210",

editor = "Thomas Peyrin and Steven Galbraith",

booktitle = "Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings",

address = "Germany",

}

Cash, D, Liu, FH, O’Neill, A, Zhandry, M & Zhang, C 2018, Parameter-hiding order revealing encryption. in T Peyrin & S Galbraith (eds), Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11272 LNCS, Springer Verlag, pp. 181-210, 24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018, Brisbane, Australia, 12/2/18. https://doi.org/10.1007/978-3-030-03326-2_7

Parameter-hiding order revealing encryption. / Cash, David; Liu, Feng Hao; O’Neill, Adam et al.
Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. ed. / Thomas Peyrin; Steven Galbraith. Springer Verlag, 2018. p. 181-210 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11272 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Parameter-hiding order revealing encryption

AU - Cash, David

AU - Liu, Feng Hao

AU - O’Neill, Adam

AU - Zhandry, Mark

AU - Zhang, Cong

PY - 2018

Y1 - 2018

N2 - Order-revealing encryption (ORE) is a primitive for outsourcing encrypted databases which 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.

AB - Order-revealing encryption (ORE) is a primitive for outsourcing encrypted databases which 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.

KW - Encryption

KW - Order-revealing encryption

UR - http://www.scopus.com/inward/record.url?scp=85057624453&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85057624453&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-03326-2_7

DO - 10.1007/978-3-030-03326-2_7

M3 - Conference contribution

AN - SCOPUS:85057624453

SN - 9783030033255

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 181

EP - 210

BT - Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings

A2 - Peyrin, Thomas

A2 - Galbraith, Steven

PB - Springer Verlag

T2 - 24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018

Y2 - 2 December 2018 through 6 December 2018

ER -

Cash D, Liu FH, O’Neill A, Zhandry M, Zhang C. Parameter-hiding order revealing encryption. In Peyrin T, Galbraith S, editors, Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Springer Verlag. 2018. p. 181-210. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-03326-2_7

Parameter-hiding order revealing encryption

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this