Skip to main content
Conference Proceedings

Revealing Encryption for Partial Ordering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10655 LNCS 3-22
DOI: 10.1007/978-3-319-71045-7_1
5Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

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=y, x>y, x

Author supplied keywords

Cite

CITATION STYLE

APA

Haagh, H., Ji, Y., Li, C., Orlandi, C., & Song, Y. (2017). Revealing Encryption for Partial Ordering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10655 LNCS, pp. 3–22). Springer Verlag. https://doi.org/10.1007/978-3-319-71045-7_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free