Attribute-based encryption for circuits of unbounded depth from lattices
From MaRDI portal
Cited in
(24)- Simple and general counterexamples for private-coin evasive LWE
- Authenticated BitGC for actively secure rate-one 2PC
- (1/ )-rate Boolean garbling scheme from generic groups
- Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR
- A unified framework for succinct garbling from homomorphic secret sharing
- A framework for witness encryption from linearly verifiable SNARKs and applications
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- Registered ABE and adaptively-secure broadcast encryption from succinct LWE
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- Succinct randomized encodings from laconic function evaluation, faster and simpler
- TinyLabels: how to compress garbled circuit input labels, efficiently
- Faster ABE for Turing machines from circular evasive LWE
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- Almost optimal KP and CP-ABE for circuits from succinct LWE
- Distributed broadcast encryption from lattices
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
- Pseudorandom FE, iO and applications
- Zeroizing attacks against evasive and circular evasive LWE
- Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
- ABE for circuits with \(\mathsf{poly}(\lambda)\)-sized keys from LWE
- Computationally succinct authentication from DCR. Attribute-based laconic function evaluation and more
- Simultaneous-message and succinct secure computation: reusable and multiparty protocols
- Succinct garbled circuits with low-depth garbling algorithms
This page was built for publication: Attribute-based encryption for circuits of unbounded depth from lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942942)
