Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)

DOI10.1007/978-3-030-95312-6_18zbMath1492.94163OpenAlexW4210592236MaRDI QIDQ2152174

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

zbMATH Keywords

functional encryptionlaconic function evaluationlaconic oblivious transfer

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Stronger security for reusable garbled circuits, general definitions and attacks
• Laconic oblivious transfer and its applications
• Functional encryption for bounded collusions, revisited
• UC-secure multiparty computation from one-way functions using stateless tokens
• Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
• Functional Encryption: Definitions and Challenges
• Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
• On Ideal Lattices and Learning with Errors over Rings
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Reusable garbled circuits and succinct functional encryption
• On lattices, learning with errors, random linear codes, and cryptography
• Round-optimal secure multi-party computation

This page was built for publication: Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)