Secure Multiparty RAM Computation in Constant Rounds
From MaRDI portal
Publication:3179368
DOI10.1007/978-3-662-53641-4_19zbMath1406.94055OpenAlexW2537799287MaRDI QIDQ3179368
Divya Gupta, Sanjam Garg, Peihan Miao, Omkant Pandey
Publication date: 21 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53641-4_19
Related Items
Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ An improved affine equivalence algorithm for random permutations ⋮ Adaptively secure computation for RAM programs ⋮ Adaptively secure garbling schemes for parallel computations ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Collusion-resistant functional encryption for RAMs ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ Secret-shared shuffle ⋮ Constant-round maliciously secure two-party computation in the RAM model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Time bounded random access machines
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- How to Run Turing Machines on Encrypted Data
- Black-box constructions for secure computation
- Succinct Randomized Encodings and their Applications
- Garbled RAM From One-Way Functions
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
- Perfect Non-interactive Zero Knowledge for NP
- Founding Cryptography on Oblivious Transfer – Efficiently
- LEGO for Two-Party Secure Computation
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Relations Among Complexity Measures
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Software protection and simulation on oblivious RAMs
- Candidate Multilinear Maps from Ideal Lattices
- How to Garble RAM Programs?
- Fully homomorphic encryption using ideal lattices
- Black-box non-black-box zero knowledge
- Garbled RAM Revisited
- Advances in Cryptology - CRYPTO 2003
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
- On lattices, learning with errors, random linear codes, and cryptography
