Adaptively secure computation for RAM programs
From MaRDI portal
Publication:2170045
DOI10.1007/978-3-031-07085-3_7zbMath1497.68216OpenAlexW4285248495MaRDI QIDQ2170045
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Communication complexity, information complexity (68Q11)
Cites Work
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Two-round adaptively secure multiparty computation from standard assumptions
- Black-box parallel garbled RAM
- Time bounded random access machines
- On Adaptively Secure Multiparty Computation with a Short CRS
- On the Power of Secure Two-Party Computation
- Leakage-Tolerant Computation with Input-Independent Preprocessing
- Leakage-Tolerant Interactive Protocols
- Adaptively Secure Multi-Party Computation with Dishonest Majority
- Garbled RAM From One-Way Functions
- On Invertible Sampling and Adaptive Security
- Secure Multiparty RAM Computation in Constant Rounds
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
- Universally composable two-party and multi-party secure computation
- Relations Among Complexity Measures
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- How to Garble RAM Programs?
- Equivocating Yao
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Garbled RAM Revisited
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from any one-way function
- Adaptively secure MPC with sublinear communication complexity
- Unnamed Item
