Laconic function evaluation and applications
From MaRDI portal
Cited in
(24)- Pseudorandom obfuscation and applications
- 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 framework for witness encryption from linearly verifiable SNARKs and applications
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- Succinct randomized encodings from laconic function evaluation, faster and simpler
- Black-box constant-round secure 2PC with succinct communication
- Simultaneous-message and succinct secure computation
- Almost optimal KP and CP-ABE for circuits from succinct LWE
- Two-round threshold signature from algebraic one-more learning with errors
- Bounded collusion-resistant registered functional encryption for circuits
- Signature-based witness encryption with compact ciphertext
- Laconic cryptography with preprocessing
- Pseudorandom FE, iO and applications
- 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
- Tweed: adaptively secure lattice-based two-round threshold signatures
- 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
- On succinct non-interactive secure computation with malicious security
- On circuit private, multikey and threshold approximate homomorphic encryption
This page was built for publication: Laconic function evaluation and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944326)
