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