Revealing Encryption for Partial Ordering

Helene Haagh; Yue Ji; Chenxing Li; Claudio Orlandi; Yifan Song

Paper 2016/972 Original: eprint.iacr.org/2016/972 ↗

Revealing Encryption for Partial Ordering

Helene Haagh

Yue Ji

Chenxing Li

Claudio Orlandi

Yifan Song

Abstract

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 is less than or equal to y, y is less than or equal to x 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.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2017-09-21: last updated; 2016-10-12: published
Short URL: https://ia.cr/2016/972
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2016/972,
      author = {Helene Haagh and Yue Ji and Chenxing Li and Claudio Orlandi and Yifan Song},
      title = {Revealing Encryption for Partial Ordering},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/972},
      year = {2016},
      url = {https://eprint.iacr.org/2016/972}
}