Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
From MaRDI portal
Publication:3179369
DOI10.1007/978-3-662-53641-4_20zbMath1406.94062OpenAlexW2533094742MaRDI QIDQ3179369
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_20
Related Items (4)
Secure Multiparty RAM Computation in Constant Rounds ⋮ An improved affine equivalence algorithm for random permutations ⋮ Adaptively secure computation for RAM programs ⋮ Tri-state circuits. A circuit model that captures RAM
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient selective identity-based encryption without random oracles
- Security and composition of multiparty cryptographic protocols
- Private Database Access with HE-over-ORAM Architecture
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Efficient, Oblivious Data Structures for MPC
- Garbled RAM From One-Way Functions
- How to Efficiently Evaluate RAM Programs with Malicious Security
- Perfectly Secure Oblivious RAM without Random Oracles
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Efficient Non-interactive Secure Computation
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Secure Multiparty RAM Computation in Constant Rounds
- Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- LEGO for Two-Party Secure Computation
- Secure Two-Party Computation Is Practical
- Relations Among Complexity Measures
- Software protection and simulation on oblivious RAMs
- Identity-Based Encryption from the Weil Pairing
- Foundations of Cryptography
- How to Garble RAM Programs?
- Garbled RAM Revisited
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient Two-Party Secure Computation on Committed Inputs
This page was built for publication: Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
