Gradual GRAM and secure computation for RAM programs

DOI10.1007/978-3-030-57990-6_12MaRDI QIDQ2106643zbMATH OpenOpenAlexFDO

Authors Carmit Hazay, Mor Lilintal

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-57990-6_12

zbMATH Keywords

Boolean circuitssecure two-party computation

Mathematics Subject Classification ID

Cryptography (94A60) Analytic circuit theory (94C05)

Recommendations

• Adaptively secure computation for RAM programs
• Succinct garbling and indistinguishability obfuscation for RAM programs
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
• Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
• Efficient maliciously secure multiparty computation for RAM
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• The complexity of secure RAMs
• Delegating RAM computations with adaptive soundness and privacy
• Secure multiparty RAM computation in constant rounds

Cited in

(4)

• Adaptively secure computation for RAM programs
• NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
• Tri-state circuits. A circuit model that captures RAM
• \textsc{EpiGRAM}: practical garbled RAM

This page was built for publication: Gradual GRAM and secure computation for RAM programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106643)