Adaptively secure laconic function evaluation for NC^1
From MaRDI portal
Publication:2152174
DOI10.1007/978-3-030-95312-6_18zbMATH Open1492.94163OpenAlexW4210592236MaRDI QIDQ2152174FDOQ2152174
Authors: Răzvan Roşie 
Publication date: 6 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-95312-6_18
Recommendations
Cites Work
- On ideal lattices and learning with errors over rings
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- On lattices, learning with errors, random linear codes, and cryptography
- Functional encryption: definitions and challenges
- Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
- Reusable garbled circuits and succinct functional encryption
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Laconic oblivious transfer and its applications
- Fully secure functional encryption for inner products, from standard assumptions
- Stronger security for reusable garbled circuits, general definitions and attacks
- Functional encryption for bounded collusions, revisited
- Round-optimal secure multi-party computation
- UC-secure multiparty computation from one-way functions using stateless tokens
Cited In (7)
- Efficient laconic cryptography from learning with errors
- Multi-input laconic function evaluation
- Laconic function evaluation for Turing machines
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- Succinct homomorphic secret sharing
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE
This page was built for publication: Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152174)
