Cryptography and Coding | Zendy

Máire O’Neill | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Cryptography and Coding

Author(s) -

Máire O’Neill

Publication year - 2017

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

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

Subject(s) - computer science , cryptography , neural cryptography , coding (social sciences) , theoretical computer science , coding theory , computer security , encryption , public key cryptography , mathematics , statistics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research