Network Oblivious Transfer
From MaRDI portal
Publication:2829221
DOI10.1007/978-3-662-53008-5_13zbMath1391.94772OpenAlexW2488896491MaRDI QIDQ2829221
Adam Sealfon, Srinivasan Raghuraman, Ranjit Kumaresan
Publication date: 27 October 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_13
Related Items (2)
Oblivious transfer in incomplete networks ⋮ Must the communication graph of MPC protocols be an expander?
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
- Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- Amortizing Garbled Circuits
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Dishonest Majority Multi-Party Computation for Binary Circuits
- Multiparty Computation from Somewhat Homomorphic Encryption
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- A New Approach to Practical Active-Secure Two-Party Computation
- The Simplest Protocol for Oblivious Transfer
- Two Halves Make a Whole
- Semi-homomorphic Encryption and Multiparty Computation
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Improved Garbled Circuit: Free XOR Gates and Applications
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Protocols for Multiparty Coin Toss with Dishonest Majority
- A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
- Oblivious Transfer Is Symmetric
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Robuster Combiners for Oblivious Transfer
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
- Scalable and Unconditionally Secure Multiparty Computation
- Secure Multiparty Computation Goes Live
- Perfectly secure message transmission
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Communication Locality in Secure Multi-party Computation
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Oblivious-Transfer Amplification
- Perfectly-Secure MPC with Linear Communication Complexity
- OT-Combiners via Secure Computation
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Reusable garbled circuits and succinct functional encryption
- Scalable Secure Multiparty Computation
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
- Brief announcement
This page was built for publication: Network Oblivious Transfer
