Network oblivious transfer
From MaRDI portal
Publication:2829221
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
- scientific article; zbMATH DE number 1722683 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 4051007 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1030984 (Why is no real title available?)
- scientific article; zbMATH DE number 1418289 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- A Framework for Efficient and Composable Oblivious Transfer
- A new approach to practical active-secure two-party computation
- A zero-one law for cryptographic complexity with respect to computational UC security
- Advances in Cryptology - CRYPTO 2003
- Amortizing Garbled Circuits
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Brief announcement: Breaking the \(O(nm)\) bit barrier, secure multiparty computation with a static adversary
- Communication Locality in Secure Multi-party Computation
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Dishonest majority multi-party computation for binary circuits
- Efficient constant round multi-party computation combining BMR and SPDZ
- Efficient oblivious transfer protocols
- Efficient secure two-party computation using symmetric cut-and-choose
- Encoding functions with constant online rate or how to compress garbled circuits keys
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Founding Cryptography on Oblivious Transfer – Efficiently
- Garbled circuits checking garbled circuits: more efficient and secure two-party computation
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
- Improved Garbled Circuit: Free XOR Gates and Applications
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Multiparty Computation from Somewhat Homomorphic Encryption
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- OT-Combiners via Secure Computation
- Oblivious Transfer Is Symmetric
- Oblivious-Transfer Amplification
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Perfectly secure message transmission
- Perfectly-Secure MPC with Linear Communication Complexity
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Protocols for multiparty coin toss with dishonest majority
- Reusable garbled circuits and succinct functional encryption
- Robuster Combiners for Oblivious Transfer
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable Secure Multiparty Computation
- Scalable and Unconditionally Secure Multiparty Computation
- Secure multiparty computation goes live
- Semi-homomorphic encryption and multiparty computation
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- The simplest protocol for oblivious transfer
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
Cited in
(5)
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)
