You are looking at a specific version 20161012:200444 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- order-revealing encryption
- Contact author(s)
- haagh @ cs au dk
- History
- 2017-09-21: revised
- 2016-10-12: received
- See all versions
- Short URL
- https://ia.cr/2016/972
- License
-
CC BY