Deniable Attribute Based Encryption for Branching Programs from LWE

DOI10.1007/978-3-662-53644-5_12zbMath1400.94111OpenAlexW2535452436MaRDI QIDQ3181031

Feng-Hao Liu, Daniel Apon, Xiong Fan

Publication date: 22 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53644-5_12

zbMATH Keywords

Learning with Errors (LWE)flexibly bi-deniable attribute-based encryption (ABE) schemepolynomial-size branching programs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Deniable fully homomorphic encryption from learning with errors ⋮ Explainable arguments ⋮ Compact (Targeted Homomorphic) Inner Product Encryption from LWE ⋮ Fully deniable interactive encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Advances in cryptology -- CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14--18, 2011. Proceedings
• Deniable Functional Encryption
• Riding on Asymmetry: Efficient ABE for Branching Programs
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Faster Bootstrapping with Polynomial Error
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Circular and KDM Security for Identity-Based Encryption
• Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
• Functional Encryption: Definitions and Challenges
• Lower and Upper Bounds for Deniable Public-Key Encryption
• Predicate Encryption for Circuits from LWE
• From Selective to Adaptive Security in Functional Encryption
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• Bi-Deniable Public-Key Encryption
• How to use indistinguishability obfuscation
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Advances in Cryptology - EUROCRYPT 2004
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Attribute-based encryption for circuits
• Reusable garbled circuits and succinct functional encryption
• Classical hardness of learning with errors
• Constraining Pseudorandom Functions Privately
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Deniable Attribute Based Encryption for Branching Programs from LWE