An Efficient Predicate Encryption with Constant Pairing Computations and Minimum Costs

DOI10.1109/TC.2016.2526000MaRDI QIDQ2985230zbMATH OpenOpenAlexWikidataFDO

Authors Intae Kim, Seongoun Hwang, Jong Hwan Park, Chanil Park

Publication date 16 May 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2016.2526000

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient fully CCA-secure predicate encryptions from pair encodings
• Construction of fully CCA-secure predicate encryptions from pair encoding schemes
• Simplifying design and analysis of complex predicate encryption schemes
• Predicate encryption for circuits from LWE
• CCA-secure predicate encryption from pair encoding in prime order groups: generic and efficient
• Verifiable predicate encryption and applications to CCA security and anonymous predicate authentication
• Predicate encryption with partial public keys
• Subset predicate encryption and its applications
• Multi-client predicate-only encryption for conjunctive equality tests
• Predicate encryption supporting disjunctions, polynomial equations, and inner products

Cited in

(2)

• Efficient anonymous multi-group broadcast encryption
• Leakage-resilient attribute-based encryption with attribute-hiding

This page was built for publication: An Efficient Predicate Encryption with Constant Pairing Computations and Minimum Costs

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