Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More

Nuttapong Attrapadung

Published Jan 1, 2014• 217 citations
Publisher
DOI
10.1007/978-3-642-55220-5_31

Related papers

Dual System Encryption via Doubly Selective Security -- A Generic Framework for Fully-Secure Predicate Encryption

Nuttapong Attrapadung

India Software Engineering Conference•Aug 29, 2014•0 citations

From Weakly Selective to Selective Security in Compact Functional Encryption.

Linfeng Zhou

•Jan 1, 2016•0 citations

Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption

Allison Bishop Lewko, Tatsuaki Okamoto, Amit Sahai +2 more

Lecture notes in computer science•Jan 1, 2010•1,322 citations

Unifying Security Notions of Functional Encryption.

Sanjam Garg, Akshayaram Srinivasan

•Jan 1, 2016•4 citations

Delegation-based conversion from CPA to CCA-secure predicate encryption

Tapas Pandit, Mridul Nandi

In 2011, Yamada et al. proposed CPA to CCA-secure conversions for attribute-based encryption (ABE) based on the properties, verifiability and delegation. Later, the verifiability-based conversion was generalised from ABE to predicate encryption (PE) by Yamada et al. (2012) and Nandi et al. (2017). We observe that for bilinear-pairing based PE schemes, the cost of CCA-decryption blows up to the double of the cost of CPA-decryption due to verifiability testing. Therefore, the conversion based on delegation is mostly acceptable whenever a delegation-based conversion is available for the primitive PE scheme. In this paper, we investigate a generic delegation-based conversion from CPA to CCA-secure predicate encryption schemes. Our conversion generalises the delegation-based conversion of Yamada et al. (2011) from ABE to PE. We show that our conversion captures many subclasses of PE, e.g., (hierarchical) inner-product encryption, (doubly-)spatial encryption and functional encryption for regular languages.

International Journal of Applied Cryptography•Jan 1, 2020•2 citations

Multi-input Functional Encryption

Shafi Goldwasser, Steven Gordon, Vipul Goyal +6 more

Lecture notes in computer science•Jan 1, 2014•359 citations
In 2011, Yamada et al. proposed CPA to CCA-secure conversions for attribute-based encryption (ABE) based on the properties, verifiability and delegation. Later, the verifiability-based conversion was generalised from ABE to predicate encryption (PE) by Yamada et al. (2012) and Nandi et al. (2017). We observe that for bilinear-pairing based PE schemes, the cost of CCA-decryption blows up to the double of the cost of CPA-decryption due to verifiability testing. Therefore, the conversion based on delegation is mostly acceptable whenever a delegation-based conversion is available for the primitive PE scheme. In this paper, we investigate a generic delegation-based conversion from CPA to CCA-secure predicate encryption schemes. Our conversion generalises the delegation-based conversion of Yamada et al. (2011) from ABE to PE. We show that our conversion captures many subclasses of PE, e.g., (hierarchical) inner-product encryption, (doubly-)spatial encryption and functional encryption for regular languages.