On black-box reductions between predicate encryption schemes

DOI10.1007/978-3-642-28914-9_25MaRDI QIDQ2891499zbMATH OpenOpenAlexFDO

Authors Vipul Goyal, Virendra Kumar, 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

black-box reductionscommunication complexityidentity-based encryptionpredicate encryption

Mathematics Subject Classification ID

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

Recommendations

• On black-box constructions of predicate encryption from trapdoor permutations
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Predicate encryption supporting disjunctions, polynomial equations, and inner products
• Subset predicate encryption and its applications
• Predicate encryption from bilinear maps and one-sided probabilistic rank

Cited in

(8)

• On the complexity of collision resistant hash functions: new and old black-box separations
• On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
• On black-box constructions of predicate encryption from trapdoor permutations
• Structure versus hardness through the obfuscation lens
• Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions
• On the (im)plausibility of public-key quantum money from collision-resistant hash functions
• On the black-box complexity of private-key inner-product functional encryption
• Lower bounds on inner-product functional encryption from all-or-nothing encryption primitives

This page was built for publication: On black-box reductions between predicate encryption schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891499)