On Black-Box Reductions between Predicate Encryption Schemes

DOI10.1007/978-3-642-28914-9_25zbMath1303.94081OpenAlexW1851429826MaRDI QIDQ2891499

Virendra Kumar, Vipul Goyal, Satya Lokam, Mohammad Mahmoody

Publication date: 15 June 2012

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_25

zbMATH Keywords

communication complexityidentity-based encryptionpredicate encryptionblack-box reductions

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions ⋮ On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models

This page was built for publication: On Black-Box Reductions between Predicate Encryption Schemes