Paper 2017/009
Access Control Encryption for Equality, Comparison, and More
Georg Fuchsbauer and Romain Gay and Lucas Kowalczyk and Claudio Orlandi
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 \emph{read} but also what they are allowed to \emph{write}. The original work of Damgård et al.~\cite{cryptoeprint:2016:106} 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.
Metadata
- Available format(s)
- Publication info
- Published by the IACR in PKC 2017
- Keywords
- Access Control Encryptionpairingspredicates
- Contact author(s)
-
orlandi @ cs au dk
luke @ cs columbia edu
fuchsbau @ di ens fr
romain gay @ ens fr - History
- 2017-01-11: received
- Short URL
- https://ia.cr/2017/009
- License
-
CC BY