Secure multiparty RAM computation in constant rounds
From MaRDI portal
Recommendations
- Constant-round maliciously secure two-party computation in the RAM model
- Constant-round maliciously secure two-party computation in the RAM model
- Efficient maliciously secure multiparty computation for RAM
- Cut-and-choose for garbled RAM
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
Cites work
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Black-box constructions for secure computation
- Black-box non-black-box zero knowledge
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constant-round maliciously secure two-party computation in the RAM model
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fully homomorphic encryption using ideal lattices
- Garbled RAM from one-way functions
- Garbled RAM revisited
- How to garble RAM programs?
- How to run Turing machines on encrypted data
- LEGO for Two-Party Secure Computation
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- On lattices, learning with errors, random linear codes, and cryptography
- Perfect Non-interactive Zero Knowledge for NP
- Relations Among Complexity Measures
- Software protection and simulation on oblivious RAMs
- Succinct randomized encodings and their applications
- Time bounded random access machines
Cited in
(24)- Adaptively secure garbling schemes for parallel computations
- Gradual GRAM and secure computation for RAM programs
- Adaptively secure computation for RAM programs
- An improved affine equivalence algorithm for random permutations
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Constant-round maliciously secure two-party computation in the RAM model
- How to efficiently evaluate RAM programs with malicious security
- Multi-party Indirect Indexing and Applications
- Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
- Efficient maliciously secure multiparty computation for RAM
- Multi-client Oblivious RAM Secure Against Malicious Servers
- Collusion-resistant functional encryption for RAMs
- Constant-round maliciously secure two-party computation in the RAM model
- Tri-state circuits. A circuit model that captures RAM
- Multiparty garbling from OT with linear scaling and RAM support
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Cut-and-choose for garbled RAM
- Doubly efficient cryptography: commitments, arguments and RAM MPC
- Secret-shared shuffle
- The oblivious machine. Or: how to put the C into MPC
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Distributed Oblivious RAM for Secure Two-Party Computation
This page was built for publication: Secure multiparty RAM computation in constant rounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179368)
