Deniable Attribute Based Encryption for Branching Programs from LWE
From MaRDI portal
Recommendations
- Attribute-based functional encryption on lattices
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Fully secure attribute-based encryption for t-CNF from LWE
- Attribute-based conditional proxy re-encryption in the standard model under LWE
- Attribute-based access control for inner product functional encryption from LWE
- Attribute-based encryption for finite automata from LWE
- A practical compiler for attribute-based encryption: new decentralized constructions and more
- An expressive and provably secure ciphertext-policy attribute-based encryption
- Attribute-based encryption for circuits from multilinear maps
Cites work
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Advances in Cryptology - EUROCRYPT 2004
- Advances in cryptology -- CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14--18, 2011. Proceedings
- Attribute-based encryption for circuits
- Bi-deniable public-key encryption
- Bonsai trees, or how to delegate a lattice basis
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Circular and KDM security for identity-based encryption
- Classical hardness of learning with errors
- Constraining pseudorandom functions privately
- Deniable Functional Encryption
- Efficient lattice (H)IBE in the standard model
- Faster Bootstrapping with Polynomial Error
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- From selective to adaptive security in functional encryption
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Functional encryption: definitions and challenges
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1088228 (Why is no real title available?)
- Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
- Lower and upper bounds for deniable public-key encryption
- On lattices, learning with errors, random linear codes, and cryptography
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Predicate encryption for circuits from LWE
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Reusable garbled circuits and succinct functional encryption
- Riding on asymmetry: efficient ABE for branching programs
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
Cited in
(6)- Fully deniable interactive encryption
- Deniable fully homomorphic encryption from learning with errors
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Compact (targeted homomorphic) inner product encryption from LWE
- Explainable arguments
- Deniable cryptosystems: simpler constructions and achieving leakage resilience
This page was built for publication: Deniable Attribute Based Encryption for Branching Programs from LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181031)
