Constant-round maliciously secure two-party computation in the RAM model

DOI10.1007/S00145-019-09321-3zbMATH Open1435.94131OpenAlexW2941238521MaRDI QIDQ2010585FDOQ2010585

Authors: Carmit Hazay, Avishay Yanai 

Publication date: 27 November 2019

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-019-09321-3

Recommendations

• Constant-round maliciously secure two-party computation in the RAM model
• Secure multiparty RAM computation in constant rounds
• How to efficiently evaluate RAM programs with malicious security
• Cut-and-choose for garbled RAM
• Efficient maliciously secure multiparty computation for RAM

zbMATH Keywords

constant-roundgarbled RAM2PCORAM

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites Work

• Relations Among Complexity Measures
• Identity-Based Encryption from the Weil Pairing
• Efficient selective identity-based encryption without random oracles
• A proof of security of Yao's protocol for two-party computation
• Security and composition of multiparty cryptographic protocols
• Title not available (Why is that?)
• Foundations of Cryptography
• Efficient Two-Party Secure Computation on Committed Inputs
• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Secure two-party computation via cut-and-choose oblivious transfer
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• LEGO for Two-Party Secure Computation
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Secure two-party computation is practical
• Title not available (Why is that?)
• Software protection and simulation on oblivious RAMs
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• Path ORAM
• Privacy-preserving group data access via stateless oblivious RAM simulation
• Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Garbled RAM from one-way functions
• How to efficiently evaluate RAM programs with malicious security
• Perfectly secure oblivious RAM without random oracles
• Efficient non-interactive secure computation
• How to garble RAM programs?
• Garbled RAM revisited
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• Secure multiparty RAM computation in constant rounds
• Black-box parallel garbled RAM
• Private database access with HE-over-ORAM architecture
• Efficient, oblivious data structures for MPC
• Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost

Cited In (5)

• How to efficiently evaluate RAM programs with malicious security
• Efficient maliciously secure multiparty computation for RAM
• Secure multiparty RAM computation in constant rounds
• Constant-round maliciously secure two-party computation in the RAM model
• Cut-and-choose for garbled RAM

This page was built for publication: Constant-round maliciously secure two-party computation in the RAM model

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