Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

**Access Control Encryption for Equality, Comparison, and More.** / Fuchsbauer, Georg; Gay, Romain; Kowalczyk, Lucas; Orlandi, Claudio.

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Fuchsbauer, G, Gay, R, Kowalczyk, L & Orlandi, C 2017, Access Control Encryption for Equality, Comparison, and More. in S Fehr (ed.), *Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II.* vol. 10175, Springer VS, Springer, Berlin, Heidelberg, Lecture Notes in Computer Science, vol. 10175, pp. 88-118, 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, Netherlands, 28/03/2017. https://doi.org/10.1007/978-3-662-54388-7_4

Fuchsbauer, G., Gay, R., Kowalczyk, L., & Orlandi, C. (2017). Access Control Encryption for Equality, Comparison, and More. In S. Fehr (Ed.), *Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II *(Vol. 10175, pp. 88-118). Springer VS. Lecture Notes in Computer Science, Vol.. 10175 https://doi.org/10.1007/978-3-662-54388-7_4

Fuchsbauer G, Gay R, Kowalczyk L, Orlandi C. 2017. Access Control Encryption for Equality, Comparison, and More. Fehr S, editor. In Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II. Springer, Berlin, Heidelberg: Springer VS. pp. 88-118. (Lecture Notes in Computer Science, Vol. 10175). https://doi.org/10.1007/978-3-662-54388-7_4

Fuchsbauer, Georg et al. "Access Control Encryption for Equality, Comparison, and More". Fehr, Serge (ed.). *Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II.* Springer, Berlin, Heidelberg: Springer VS. (Lecture Notes in Computer Science, Vol. 10175). 2017, 88-118. https://doi.org/10.1007/978-3-662-54388-7_4

Fuchsbauer G, Gay R, Kowalczyk L, Orlandi C. Access Control Encryption for Equality, Comparison, and More. In Fehr S, editor, Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II. Vol. 10175. Springer, Berlin, Heidelberg: Springer VS. 2017. p. 88-118. (Lecture Notes in Computer Science, Vol. 10175). https://doi.org/10.1007/978-3-662-54388-7_4

Fuchsbauer, Georg ; Gay, Romain ; Kowalczyk, Lucas ; Orlandi, Claudio. / **Access Control Encryption for Equality, Comparison, and More**. Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings: 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II. editor / Serge Fehr. Vol. 10175 Springer, Berlin, Heidelberg : Springer VS, 2017. pp. 88-118 (Lecture Notes in Computer Science, Vol. 10175).

@inproceedings{b352d5b77cd54f47b19c083f6089b4c0,

title = "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 read but also what they are allowed to write. The original work of Damg{\aa}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.",

author = "Georg Fuchsbauer and Romain Gay and Lucas Kowalczyk and Claudio Orlandi",

year = "2017",

month = jan,

day = "1",

doi = "10.1007/978-3-662-54388-7_4",

language = "English",

isbn = "978-3-662-54387-0",

volume = "10175",

series = "Lecture Notes in Computer Science",

publisher = "Springer VS",

pages = "88--118",

editor = "Serge Fehr",

booktitle = "Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings",

note = "null ; Conference date: 28-03-2017 Through 31-03-2017",

url = "https://www.iacr.org/workshops/pkc2017/",

}

TY - GEN

T1 - Access Control Encryption for Equality, Comparison, and More

AU - Fuchsbauer, Georg

AU - Gay, Romain

AU - Kowalczyk, Lucas

AU - Orlandi, Claudio

N1 - Conference code: 20

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-662-54388-7_4

DO - 10.1007/978-3-662-54388-7_4

M3 - Article in proceedings

SN - 978-3-662-54387-0

VL - 10175

T3 - Lecture Notes in Computer Science

SP - 88

EP - 118

BT - Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings

A2 - Fehr, Serge

PB - Springer VS

CY - Springer, Berlin, Heidelberg

Y2 - 28 March 2017 through 31 March 2017

ER -