Paper 2015/665

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

Romain Gay, Iordanis Kerenidis, and Hoeteck Wee


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.

Available format(s)
Publication info
A major revision of an IACR publication in CRYPTO 2015
communication complexityconditional disclosure of secretsattribute-based encryption
Contact author(s)
rgay @ di ens fr
2015-07-05: received
Short URL
Creative Commons Attribution


      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},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.