Network oblivious transfer
From MaRDI portal
Publication:2829221
DOI10.1007/978-3-662-53008-5_13zbMATH Open1391.94772OpenAlexW2488896491MaRDI QIDQ2829221FDOQ2829221
Authors: Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon 
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
Recommendations
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
- Oblivious transfer in incomplete networks
- Founding Cryptography on Oblivious Transfer – Efficiently
- More efficient oblivious transfer extensions
- Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation
Cites Work
- Title not available (Why is that?)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Efficient oblivious transfer protocols
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Improved Garbled Circuit: Free XOR Gates and Applications
- Oblivious Transfer Is Symmetric
- Title not available (Why is that?)
- A Framework for Efficient and Composable Oblivious Transfer
- 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
- Semi-homomorphic encryption and multiparty computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
- Perfectly secure message transmission
- Protocols for multiparty coin toss with dishonest majority
- Secure multiparty computation goes live
- Scalable and Unconditionally Secure Multiparty Computation
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reusable garbled circuits and succinct functional encryption
- Perfectly-Secure MPC with Linear Communication Complexity
- OT-Combiners via Secure Computation
- Title not available (Why is that?)
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Title not available (Why is that?)
- Scalable Secure Multiparty Computation
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- The Simplest Protocol for Oblivious Transfer
- Title not available (Why is that?)
- Amortizing Garbled Circuits
- Two Halves Make a Whole
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- A zero-one law for cryptographic complexity with respect to computational UC security
- Robuster Combiners for Oblivious Transfer
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
- Oblivious-Transfer Amplification
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Dishonest Majority Multi-Party Computation for Binary Circuits
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- Communication Locality in Secure Multi-party Computation
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- Brief announcement
- Title not available (Why is that?)
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
Cited In (5)
Uses Software
This page was built for publication: Network oblivious transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829221)
