Predicate encryption for circuits from LWE
From MaRDI portal
Recommendations
Cites work
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Candidate Multilinear Maps from Ideal Lattices
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient lattice (H)IBE in the standard model
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure functional encryption with general relations from the decisional linear assumption
- Functional encryption for inner product predicates from learning with errors
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Fuzzy Identity-Based Encryption
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- On lattices, learning with errors, random linear codes, and cryptography
- Practical multilinear maps over the integers
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(only showing first 100 items - show all)- Revocable predicate encryption from lattices
- Memory lower bounds of reductions revisited
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Stronger security for reusable garbled circuits, general definitions and attacks
- On the untapped potential of encoding predicates by arithmetic circuits and their applications
- Adaptively simulation-secure attribute-hiding predicate encryption
- Improved inner-product encryption with adaptive security and full attribute-hiding
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Minimizing locality of one-way functions via semi-private randomized encodings
- Tag-based ABE in prime-order groups via pair encoding
- Revocable attribute-based proxy re-encryption
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Non-interactive anonymous router
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Amplifying the security of functional encryption, unconditionally
- Covert authentication from lattices
- From cryptomania to obfustopia through secret-key functional encryption
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Predicate encryption from bilinear maps and one-sided probabilistic rank
- Attribute based encryption for deterministic finite automata from DLIN
- Access control encryption with efficient verifiable sanitized decryption
- Constrained pseudorandom functions from functional encryption
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Attribute-based proxy re-encryption from standard lattices
- Inner-product functional encryption with fine-grained access control
- Multi-party functional encryption
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Turing machines with shortcuts: efficient attribute-based encryption for bounded functions
- Fully secure functional encryption for inner products, from standard assumptions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Verifiable predicate encryption and applications to CCA security and anonymous predicate authentication
- Predicate encryption for multi-dimensional range queries from lattices
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Towards tightly secure lattice short signature and id-based encryption
- Verifiable functional encryption
- An Efficient Predicate Encryption with Constant Pairing Computations and Minimum Costs
- Predicate encryption with partial public keys
- Deniable Attribute Based Encryption for Branching Programs from LWE
- From cryptomania to obfustopia through secret-key functional encryption
- Single-key to multi-key functional encryption with polynomial loss
- Delegating Capabilities in Predicate Encryption Systems
- Predicate Privacy in Encryption Systems
- Homomorphic encryption
- Adaptive simulation security for inner product functional encryption
- A new paradigm for public-key functional encryption for degree-2 polynomials
- Constraining and watermarking PRFs from milder assumptions
- Towards a simpler lattice gadget toolkit
- On the inner product predicate and a generalization of matching vector families
- Collusion resistant traitor tracing from learning with errors
- Private puncturable PRFs from standard lattice assumptions
- Cryptography with updates
- Match me if you can: matchmaking encryption and its applications
- Watermarking cryptographic functionalities from standard lattice assumptions
- Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups
- Functional commitments for all functions, with transparent setup and from SIS
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Multi-key and multi-input predicate encryption from learning with errors
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Multi-input attribute based encryption and predicate encryption
- How to build a trapdoor function from an encryption scheme
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- A survey on functional encryption
- More efficient verifiable functional encryption
- Streaming functional encryption
- Attribute-based multi-input FE (and more) for attribute-weighted sums
- Compact lattice gadget and its applications to hash-and-sign signatures
- CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- One-out-of-many unclonable cryptography: definitions, constructions, and more
- Lattice-based functional commitments: fast verification and cryptanalysis
- Updatable policy-compliant signatures
- Towards compact identity-based encryption on ideal lattices
- Lower bounds for lattice-based compact functional encryption
- Certified everlasting secure collusion-resistant functional encryption, and more
- Lossy cryptography from code-based assumptions
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE
- Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
- Two-round threshold signature from algebraic one-more learning with errors
- Non-interactive zero-knowledge from LPN and MQ
- Learning with errors over group rings constructed by semi-direct product
- FE for inner products and its application to multi-authority ABE
- Fully anonymous secret sharing
- Simultaneous-message and succinct secure computation
- New techniques for preimage sampling: improved NIZKs and more from LWE
- On quantum money and evasive obfuscation
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Two-round threshold signature from algebraic one-more learning with errors
- Dynamic decentralized functional encryption: generic constructions with strong security
- Predicate encryption from lattices: enhanced compactness and refined functionality
- Multi-authority functional encryption with bounded collusions from standard assumptions
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Registered FE beyond predicates: (attribute-based) linear functions and more
This page was built for publication: Predicate encryption for circuits from LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457082)
