On black-box constructions of predicate encryption from trapdoor permutations

DOI10.1007/978-3-642-10366-7_12zbMATH Open1267.94073OpenAlexW1505443129MaRDI QIDQ3650693FDOQ3650693

Authors: Arkady Yerukhimovich, Jonathan Katz 

Publication date: 15 December 2009

Published in: Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10366-7_12

Recommendations

• On black-box reductions between predicate encryption schemes
• 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

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited In (6)

• Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions
• Transforming hidden vector encryption schemes from composite to prime order groups
• Large universe subset predicate encryption based on static assumption (without random oracle)
• On black-box reductions between predicate encryption schemes
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Obfustopia built on secret-key functional encryption

This page was built for publication: On black-box constructions of predicate encryption from trapdoor permutations

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