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

Science China Information Sciences

Direct constructions and proofs for CCA secure (LR)IBE with dual system encryption

Yi Zhao, Bo Yang

Published Sep 21, 2017• 0 citations
Publisher
DOI
10.1007/s11432-016-9204-6

Related papers

A direct construction of continuous leakage-resilient (H)IBE scheme with CCA security from dual system encryption

Yanwei Zhou, Lei Cao, Bo Yang +3 more

Computer Standards & Interfaces•Jul 2, 2022•11 citations

More efficient CCA-secure identity-based dual receiver encryption

Chen Wen, Kai Zhang, Haifeng Qian

Huadong Shifan Daxue xuebao. Ziran kexue ban•Nov 25, 2016•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

LR-RRA-CCA secure functional encryption for randomized functionalities from trapdoor HPS and LAF

Huige Wang, Kefei Chen, Baodong Qin +1 more

Science China Information Sciences•Aug 30, 2017•4 citations

Leakage-Resilient Chosen-Ciphertext Secure Public-Key Encryption from Hash Proof System and One-Time Lossy Filter.

Baodong Qin, Shengli Liu

We present a new generic construction of a public-key encryption (PKE) scheme secure against leakage-resilient chosen-ciphertext attacks (LR-CCA), from any Hash Proof System (HPS) and any one-time lossy filter (OT-LF). Efficient constructions of HPSs and OT-LFs from the DDH and DCR assumptions suggest that our construction is a practical approach to LR-CCA security. Most of practical PKEs with LR-CCA security, like variants of Cramer-Shoup scheme, rooted from Hash Proof Systems, but with leakage rates at most 1/4 − o(1) (defined as the ratio of leakage amount to secret-key size). The instantiations of our construction from the DDH and DCR assumptions result in LR-CCA secure PKEs with leakage rate of 1/2 − o(1). On the other hand, our construction also creates a new approach for constructing IND-CCA secure (leakage-free) PKE schemes, which may be of independent interest.

•Jan 1, 2013•0 citations

A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions

Yehuda Lindell

Lecture notes in computer science•Jan 1, 2003•51 citations
We present a new generic construction of a public-key encryption (PKE) scheme secure against leakage-resilient chosen-ciphertext attacks (LR-CCA), from any Hash Proof System (HPS) and any one-time lossy filter (OT-LF). Efficient constructions of HPSs and OT-LFs from the DDH and DCR assumptions suggest that our construction is a practical approach to LR-CCA security. Most of practical PKEs with LR-CCA security, like variants of Cramer-Shoup scheme, rooted from Hash Proof Systems, but with leakage rates at most 1/4 − o(1) (defined as the ratio of leakage amount to secret-key size). The instantiations of our construction from the DDH and DCR assumptions result in LR-CCA secure PKEs with leakage rate of 1/2 − o(1). On the other hand, our construction also creates a new approach for constructing IND-CCA secure (leakage-free) PKE schemes, which may be of independent interest.