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

Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes

Johannes Blömer, Gennadij Liske

Published Jan 1, 2016• 12 citations
Publisher
DOI
10.1007/978-3-319-29485-8_25

Related papers

Constructions of Fully Secure Predicate Encryption Schemes

Patrick Schleiter

•Jan 1, 2015•0 citations

A generic construction of CCA-secure deterministic encryption

Meijuan Huang, Bo Yang, Yi Zhao +3 more

Information Processing Letters•Oct 21, 2019•7 citations

Fully secure predicate-based broadcast encryption

Shangping Wang, 胡予濮, 孙瑾

•Jan 1, 2014•0 citations

On CCA-Secure Fully Homomorphic Encryption

Jake Loftus, Alexander May, Nigel Paul Smart +1 more

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

The Efficient CCA Secure Public-Key Encryption Scheme

Kang Li, Zhiyi Wang

Chinese Journal of Computers•May 19, 2011•2 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
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.