Adaptively secure computation for RAM programs

DOI10.1007/978-3-031-07085-3_7MaRDI QIDQ2170045zbMATH OpenOpenAlexFDO

Authors Laasya Bangalore, Rafail Ostrovsky, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam

Publication date 30 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-07085-3_7

zbMATH Keywords

adaptive securitygarbled RAMoblivious RAMsecure computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Communication complexity, information complexity (68Q11) Cryptography (94A60)

Recommendations

• Gradual GRAM and secure computation for RAM programs
• Delegating RAM computations with adaptive soundness and privacy
• Efficient maliciously secure multiparty computation for RAM
• Adaptively secure garbling schemes for parallel computations
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
• Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
• The complexity of secure RAMs
• Adaptively secure computation with partial erasures
• Software protection and simulation on oblivious RAMs

Cites work

• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Adaptively secure MPC with sublinear communication complexity
• Adaptively secure multi-party computation with dishonest majority
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Adaptively secure, universally composable, multiparty computation in constant rounds
• Black-box parallel garbled RAM
• Constant round non-malleable protocols using one way functions
• Constant-round maliciously secure two-party computation in the RAM model
• Constant-round non-malleable commitments from any one-way function
• Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
• Garbled RAM from one-way functions
• Garbled RAM revisited
• How to garble RAM programs?
• scientific article; zbMATH DE number 1256784 (Why is no real title available?)
• Leakage-tolerant computation with input-independent preprocessing
• Leakage-Tolerant Interactive Protocols
• On Adaptively Secure Multiparty Computation with a Short CRS
• On Invertible Sampling and Adaptive Security
• On the Power of Secure Two-Party Computation
• Relations Among Complexity Measures
• Secure multiparty RAM computation in constant rounds
• Time bounded random access machines
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Two-round adaptively secure multiparty computation from standard assumptions
• Universally composable two-party and multi-party secure computation

Cited in

(2)

• Gradual GRAM and secure computation for RAM programs
• Better two-round adaptive multi-party computation

This page was built for publication: Adaptively secure computation for RAM programs

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