Adaptively secure garbling schemes for parallel computations
From MaRDI portal
Publication:2175942
DOI10.1007/978-3-030-36033-7_11zbMath1455.94142OpenAlexW2990252296MaRDI QIDQ2175942
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_11
Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed systems (68M14)
Related Items (1)
Cites Work
- Adaptive garbled RAM from laconic oblivious transfer
- Sorting in \(c \log n\) parallel steps
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Adaptively secure garbling with near optimal online complexity
- Be adaptive, avoid overcommitting
- Identity-based encryption from the Diffie-Hellman assumption
- Laconic oblivious transfer and its applications
- Black-box parallel garbled RAM
- Adaptively indistinguishable garbled circuits
- New constructions of identity-based and key-dependent message secure encryption schemes
- Oblivious Parallel RAM and Applications
- Fully Succinct Garbled RAM
- Cryptography for Parallel RAM from Indistinguishability Obfuscation
- Adaptively Secure Garbled Circuits from One-Way Functions
- Garbled RAM From One-Way Functions
- Adaptive Security of Yao’s Garbled Circuits
- Secure Multiparty RAM Computation in Constant Rounds
- Delegating RAM Computations with Adaptive Soundness and Privacy
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database
- Time/Space Trade-Offs for Reversible Computation
- Space bounds for a game on graphs
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- How to Garble RAM Programs?
- Garbled Circuits as Randomized Encodings of Functions: a Primer
- Garbled RAM Revisited
This page was built for publication: Adaptively secure garbling schemes for parallel computations
