Riding on asymmetry: efficient ABE for branching programs

DOI10.1007/978-3-662-48797-6_23MaRDI QIDQ2811146zbMATH OpenOpenAlexFDO

Authors Sergey Gorbunov, Dhinakaran Vinayagamurthy

Publication date 10 June 2016

Published in Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48797-6_23

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Attribute-based encryption for circuits
• Attribute-based encryption for circuits
• Succinct and adaptively secure ABE for ABP from \(k\)-Lin
• CP-ABE for circuits (and More) in the symmetric key setting
• Fast, compact, and expressive attribute-based encryption

Cited in

(26)

• Bounded functional encryption for Turing machines: adaptive security from general assumptions
• Deniable Attribute Based Encryption for Branching Programs from LWE
• Key-homomorphic pseudorandom functions from LWE with small modulus
• Watermarking cryptographic functionalities from standard lattice assumptions
• Private puncturable PRFs from standard lattice assumptions
• ABE for circuits with constant-size secret keys and adaptive security
• Dual system encryption framework in prime-order groups via computational pair encodings
• Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
• Attribute based encryption for deterministic finite automata from DLIN
• Constraining and watermarking PRFs from milder assumptions
• A survey of lattice based expressive attribute based encryption
• Optimal broadcast encryption from pairings and LWE
• Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
• Multi-theorem preprocessing NIZKs from lattices
• Adaptive oblivious transfer with access control from lattice assumptions
• Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
• Attribute-based encryption for circuits
• Multi-input attribute based encryption and predicate encryption
• Succinct and adaptively secure ABE for ABP from \(k\)-Lin
• 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
• ABE for DFA from LWE against bounded collusions, revisited
• Leakage-resilient \textsf{IBE}/\textsf{ABE} with optimal leakage rates from lattices
• Direct computation of branching programs and its applications to more efficient lattice-based cryptography
• Leakage-resilient \textsf{IBE}/\textsf{ABE} with optimal leakage rates from lattices
• Towards tightly secure lattice short signature and id-based encryption

This page was built for publication: Riding on asymmetry: efficient ABE for branching programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811146)