Cryptology ePrint Archive: Report 2016/972

Revealing Encryption for Partial Ordering

Helene Haagh and Yue Ji and Chenxing Li and Claudio Orlandi and and 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.

Category / Keywords: secret-key cryptography, order-revealing encryption, revealing encryption

Original Publication (with minor differences): 16th IMA International Conference, IMACC 2017

Date: received 7 Oct 2016, last revised 21 Sep 2017

Contact author: haagh at cs au dk

Available format(s): PDF | BibTeX Citation

Note: Full version of paper accepted at IMACC 2017

Version: 20170921:121728 (All versions of this report)

Short URL: ia.cr/2016/972


[ Cryptology ePrint archive ]