Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption.

Romain Gay; Iordanis Kerenidis; Hoeteck Wee

Paper 2015/665

Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption.

Romain Gay, Iordanis Kerenidis, and Hoeteck Wee

Abstract

We initiate a systematic treatment of the communication complexity of conditional disclosure of secrets (CDS), where two parties want to disclose a secret to a third party if and only if their respective inputs satisfy some predicate. We present a general upper bound and the first non-trivial lower bounds for conditional disclosure of secrets. Moreover, we achieve tight lower bounds for many interesting setting of parameters for CDS with linear reconstruction, the latter being a requirement in the application to attribute-based encryption. In particular, our lower bounds explain the trade-off between ciphertext and secret key sizes of several existing attribute-based encryption schemes based on the dual system methodology.

Metadata

Available format(s): PDF
Publication info: A major revision of an IACR publication in CRYPTO 2015
Keywords: communication complexity conditional disclosure of secrets attribute-based encryption
Contact author(s): rgay @ di ens fr
History: 2015-07-05: received
Short URL: https://ia.cr/2015/665
License: CC BY

BibTeX

@misc{cryptoeprint:2015/665,
      author = {Romain Gay and Iordanis Kerenidis and Hoeteck Wee},
      title = {Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption.},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/665},
      year = {2015},
      url = {https://eprint.iacr.org/2015/665}
}