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

From Weakly Selective to Selective Security in Compact Functional Encryption, Revisited

Linfeng Zhou

Published Jan 1, 2016• 0 citations
OpenAlex

Related papers

From Weakly Selective to Selective Security in Compact Functional Encryption.

Linfeng Zhou

•Jan 1, 2016•0 citations

From Selective to Adaptive Security in Functional Encryption

Prabhanjan Ananth, Zvika Brakerski, Gil Segev +1 more

Lecture notes in computer science•Jan 1, 2015•128 citations

Generic Constructions of Compact and Tightly Selective-Opening Secure Public-Key Encryption Schemes

Jiaxin Pan, Benedikt Wagner, Runzhi Zeng

Journal of Cryptology•Mar 25, 2026•0 citations

Tightly Secure Inner-Product Functional Encryption Revisited: Compact, Lattice-Based, and More

Shuai Han, Hongxu Yi, Shengli Liu +1 more

Lecture notes in computer science•Jan 1, 2025•1 citation

Semantically Secure Functional Encryption, Revisited.

Manuel Barbosa, Pooya Farshim

•Jan 1, 2012•1 citation

Selective Opening Secure Functional Encryption

Yuanyuan Ji, Haixia Xu, Peili Li

Functional encryption (FE) has more fine-grained control to encrypted data than traditional encryption schemes. The well-accepted security of FE is indistinguishability-based security (IND-FE) and simulation-based security (SIMFE), but the security is not sufficient.For example, if an adversary has the ability to access a vector of ciphertexts and can ask to open some information of the messages, such as coins used in the encryption or secret key in multikey setting, whether the privacy of the unopened messages is guaranteed.This is called selective opening attack (SOA).In this paper, we propose a stronger security of FE which is secure against SOA (we call SO-FE) and propose a concrete construction of SO-FE scheme in the standard model.Our scheme is a non-adaptive IND-FE which satisfies selective opening secure in the simulation sense.In addition, the scheme can encrypt messages of any bit length other than bitwise and it is secure against SOA-C and SOAK simultaneously while the two attacks were appeared in different model before.According to the different functionality f, our scheme can specialize as IBE, ABE and even PE schemes secure against SOA.

•Dec 28, 2015•0 citations
Functional encryption (FE) has more fine-grained control to encrypted data than traditional encryption schemes. The well-accepted security of FE is indistinguishability-based security (IND-FE) and simulation-based security (SIMFE), but the security is not sufficient.For example, if an adversary has the ability to access a vector of ciphertexts and can ask to open some information of the messages, such as coins used in the encryption or secret key in multikey setting, whether the privacy of the unopened messages is guaranteed.This is called selective opening attack (SOA).In this paper, we propose a stronger security of FE which is secure against SOA (we call SO-FE) and propose a concrete construction of SO-FE scheme in the standard model.Our scheme is a non-adaptive IND-FE which satisfies selective opening secure in the simulation sense.In addition, the scheme can encrypt messages of any bit length other than bitwise and it is secure against SOA-C and SOAK simultaneously while the two attacks were appeared in different model before.According to the different functionality f, our scheme can specialize as IBE, ABE and even PE schemes secure against SOA.