Faster Secure Two-Party Computation in the Single-Execution Setting

DOI10.1007/978-3-319-56617-7_14zbMath1415.94465OpenAlexW2598377911MaRDI QIDQ5270369

Alex J. Malozemoff, Xiao Wang, Jonathan N. Katz

Publication date: 23 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

An efficient structural attack on NIST submission DAGS ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ The price of active security in cryptographic protocols

Uses Software

• RELIC
• MiniLEGO
• GitHub
• JustGarble
• FleXOR
• EMP-toolkit

Cites Work

• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
• Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique
• FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
• Amortizing Garbled Circuits
• Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
• A New Approach to Practical Active-Secure Two-Party Computation
• Faster Maliciously Secure Two-Party Computation Using the GPU
• An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation
• The Simplest Protocol for Oblivious Transfer
• Generalizing Efficient Multiparty Computation
• More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
• Two Halves Make a Whole
• Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
• Two-Output Secure Computation with Malicious Adversaries
• Improved Garbled Circuit: Free XOR Gates and Applications
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• Secure Two-Party Computation Is Practical
• MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
• Non-Interactive Secure Computation Based on Cut-and-Choose
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Efficient Two Party and Multi Party Computation Against Covert Adversaries

This page was built for publication: Faster Secure Two-Party Computation in the Single-Execution Setting