Revealing Encryption for Partial Ordering

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Helene Haagh
  • ,
  • Yue Ji, IIIS, Tsinghua University, Beijing. School of Computer Science and School of Computer Science and Technology, Shandong University
  • ,
  • Chenxing Li, IIIS, Tsinghua University, Beijing. School of Computer Science and School of Computer Science and Technology, Shandong University
  • ,
  • Claudio Orlandi
  • Yifan Song, IIIS, Tsinghua University, Beijing. School of Computer Science and School of Computer Science and Technology, Shandong University

We generalize the cryptographic notion of Order Revealing Encryption (ORE) to arbitrary functions and we present a construction that allows to determine the (partial) ordering of two vectors i.e., given E(x) and E(y) it is possible to learn whether x=y, x>y, x<y or whether x and y are incomparable. This is the first non-trivial example of a Revealing Encryption (RE) scheme with output larger than one bit, and which does not rely on cryptographic obfuscation or multilinear maps.

Original languageEnglish
Title of host publicationCryptography and Coding - 16th IMA International Conference, IMACC 2017, Proceedings
EditorsMaire O’Neill
Number of pages20
Place of publicationCham
PublisherSpringer VS
Publication year1 Jan 2017
Pages3-22
ISBN (print)9783319710440
ISBN (Electronic)978-3-319-71045-7
DOIs
Publication statusPublished - 1 Jan 2017
Event16th IMA International Conference, IMACC 2017 - Oxford, United Kingdom
Duration: 12 Dec 201714 Dec 2017
Conference number: 16
https://ima.org.uk/6153/16th-ima-international-conference-on-cryptography-and-coding/

Conference

Conference16th IMA International Conference, IMACC 2017
Nummer16
LandUnited Kingdom
ByOxford
Periode12/12/201714/12/2017
Internetadresse
SeriesLecture Notes in Computer Science
Volume10655
ISSN0302-9743

    Research areas

  • Order-revealing encryption, Revealing encryption, Secret-key cryptography

See relations at Aarhus University Citationformats

ID: 119493917