Work

Revealing Encryption for Partial Ordering

Year: 2017

Type: conference-paper

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(\varvec{x})$$ and $$E(\varvec{y})$$ it is possible to learn whether $$\varvec{x}=\varvec{y}$$ , $$\varvec{x}>\varvec{y}$$ , $$\varvec{x}<\varvec{y}$$ or whether $$\varvec{x}$$ and $$\varvec{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.

Source: Lecture notes in computer science

Parent work: Cryptography and Coding: 16th IMA International Conference, IMACC 2017, Oxford, UK, December 12-14, 2017, Proceedings

DOI: 10.1007/978-3-319-71045-7_1

Authors: Helene Haagh, Yue Ji, Chenxing Li, Claudio Orlandi, Yifan Song

Institutions: Aarhus University, Tsinghua University

Language: English

Topic: Cryptography and Data Security

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green