Abstract
Access Control Encryption (ACE) is a novel paradigm for encryption which allows to control not only what users in the system are allowed to read but also what they are allowed to write. The original work of Damgård et al. [DHO16] introducing this notion left several open questions, in particular whether it is possible to construct ACE schemes with polylogarithmic complexity (in the number of possible identities in the system) from standard cryptographic assumptions. In this work we answer the question in the affirmative by giving (efficient) constructions of ACE for an interesting class of predicates which includes equality, comparison, interval membership, and more. We instantiate our constructions based both on standard pairing assumptions (SXDH) or more efficiently in the generic group model.
Cite
CITATION STYLE
Fuchsbauer, G., Gay, R., Kowalczyk, L., & Orlandi, C. (2017). Access control encryption for equality, comparison, and more. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10175 LNCS, pp. 88–118). Springer Verlag. https://doi.org/10.1007/978-3-662-54388-7_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
