Multi-client predicate-only encryption for conjunctive equality tests

3Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose the first multi-client predicate-only encryption scheme capable of efficiently testing the equality of two encrypted vectors. Our construction can be used for the privacy-preserving monitoring of relations among multiple clients. Since both the clients’ data and the predicates are encrypted, our system is suitable for situations in which this information is considered sensitive. We prove our construction plaintext and predicate private in the generic bilinear group model using random oracles, and secure under chosen-plaintext attack with unbounded corruptions under the symmetric external Diffie–Hellman assumption. Additionally, we provide a proof-of-concept implementation that is capable of evaluating one thousand predicates defined over the inputs of ten clients in less than a minute on commodity hardware.

Cite

CITATION STYLE

APA

van de Kamp, T., Peter, A., Everts, M. H., & Jonker, W. (2018). Multi-client predicate-only encryption for conjunctive equality tests. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11261 LNCS, pp. 135–157). Springer Verlag. https://doi.org/10.1007/978-3-030-02641-7_7

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