More efficient oblivious transfer extensions

DOI10.1007/s00145-016-9236-6zbMath1377.94030OpenAlexW2522469987MaRDI QIDQ2408589

Thomas Schneider, Michael Zohner, Yehuda Lindell, Gilad Asharov

Publication date: 12 October 2017

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://encrypto.de/papers/ALSZ17.pdf

zbMATH Keywords

implementationcryptographic protocolsoblivious transfer extension

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Oblivious transfer with constant computational overhead ⋮ Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection ⋮ Improved Multiplication Triple Generation over Rings via RLWE-Based AHE ⋮ Secure two-party computation in a quantum world ⋮ Cryptographic pseudorandom generators can make cryptosystems problematic ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings

Uses Software

• TASTY
• FairplayMP
• VMCrypt
• SCAPI
• JustGarble
• ABY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• Security and composition of multiparty cryptographic protocols
• High-performance multi-party computation for binary circuits based on oblivious transfer
• Security against covert adversaries: Efficient protocols for realistic adversaries
• A Unified Approach to MPC with Preprocessing Using OT
• Improved OT Extension for Transferring Short Secrets
• Dishonest Majority Multi-Party Computation for Binary Circuits
• Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
• A New Approach to Practical Active-Secure Two-Party Computation
• An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation
• The Simplest Protocol for Oblivious Transfer
• Extending Oblivious Transfer Efficiently
• More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
• Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
• Actively Secure OT Extension with Optimal Overhead
• Improved Garbled Circuit: Free XOR Gates and Applications
• A Framework for Efficient and Composable Oblivious Transfer
• Founding Cryptography on Oblivious Transfer – Efficiently
• Foundations of Cryptography
• On the Feasibility of Extending Oblivious Transfer
• Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
• Advances in Cryptology - CRYPTO 2003
• OT-Combiners via Secure Computation
• A Fast Computer Method for Matrix Transposing

This page was built for publication: More efficient oblivious transfer extensions