Access Control Encryption for Equality, Comparison, and More

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 write. The original work of Damgard et al. 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.
Type de document :
Communication dans un congrès
Public-Key Cryptography - PKC 2017 - 20th International Conference on Practice and Theory in Public-Key Cryptography, Mar 2017, Amsterdam, Netherlands. pp.88-118, 〈10.1007/978-3-662-54388-7_4〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01470315
Contributeur : Georg Fuchsbauer <>
Soumis le : vendredi 17 février 2017 - 11:49:41
Dernière modification le : jeudi 26 avril 2018 - 10:29:07

Identifiants

Collections

Citation

Georg Fuchsbauer, Romain Gay, Lucas Kowalczyk, Claudio Orlandi. Access Control Encryption for Equality, Comparison, and More. Public-Key Cryptography - PKC 2017 - 20th International Conference on Practice and Theory in Public-Key Cryptography, Mar 2017, Amsterdam, Netherlands. pp.88-118, 〈10.1007/978-3-662-54388-7_4〉. 〈hal-01470315〉

Partager

Métriques

Consultations de la notice

240