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

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
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
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
Software protection and simulation on oblivious RAMs
Oblivious RAM with O((logN)3) Worst-Case Cost
Path ORAM
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
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

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)