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

Constructions of Fully Secure Predicate Encryption Schemes

Patrick Schleiter

Published Jan 1, 2015• 0 citations
OpenAlex

Related papers

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

Johannes Blömer, Gennadij Liske

Lecture notes in computer science•Jan 1, 2016•12 citations

Fully secure predicate-based broadcast encryption

Shangping Wang, 胡予濮, 孙瑾

•Jan 1, 2014•0 citations

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

On Black-Box Reductions between Predicate Encryption Schemes

Vipul Goyal, Virendra Kumar, Satya Lokam +1 more

Lecture notes in computer science•Jan 1, 2012•13 citations

Thresholdizing lattice based encryption schemes

Andrew. Xia

In this thesis, we examine a variety of constructions based on secret sharing techniques applied on lattice-based cryptographic primitives constructed from the learning with erros (LWE) assumption. Using secret sharing techniques from [BGG⁺17], we show how to construct paradigms of threshold multi-key fully homomorphic encryption and predicate encryption. Through multi-key fully homomorphic encryption [MW16] and threshold fully homomorphic encryption, we can construct a low-round multi party computation (MPC) scheme with guaranteed output delivery, assuming honest majority in the semi-honest and malicious settings. Applying the secret sharing scheme on predicate encryption constructions from LWE [GVW15], we can obtain a distributed predicate encryption scheme.

•Jan 1, 2018•1 citation

Predicate Encryption from Lattices: Enhanced Compactness and Refined Functionality

Yuejun Wang, Baocang Wang, Qiqi Lai +1 more

Lecture notes in computer science•Jan 1, 2025•1 citation
In this thesis, we examine a variety of constructions based on secret sharing techniques applied on lattice-based cryptographic primitives constructed from the learning with erros (LWE) assumption. Using secret sharing techniques from [BGG⁺17], we show how to construct paradigms of threshold multi-key fully homomorphic encryption and predicate encryption. Through multi-key fully homomorphic encryption [MW16] and threshold fully homomorphic encryption, we can construct a low-round multi party computation (MPC) scheme with guaranteed output delivery, assuming honest majority in the semi-honest and malicious settings. Applying the secret sharing scheme on predicate encryption constructions from LWE [GVW15], we can obtain a distributed predicate encryption scheme.