Faster secure two-party computation in the single-execution setting

DOI10.1007/978-3-319-56617-7_14MaRDI QIDQ5270369zbMATH OpenOpenAlexFDO

Authors Xiao Wang, Alex J. Malozemoff, Jonathan 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)

Recommendations

• Amortizing Garbled Circuits
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• Secure two-party computation is practical
• Fast garbling of circuits under standard assumptions
• Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings

Cites work

• A new approach to practical active-secure two-party computation
• Amortizing Garbled Circuits
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• An empirical study and some improvements of the MiniMac protocol for secure computation
• Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
• Efficient secure two-party computation using symmetric cut-and-choose
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Faster maliciously secure two-party computation using the GPU
• Flexor: Flexible garbling for XOR gates that beats free-XOR
• Generalizing efficient multiparty computation
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• Improved Garbled Circuit: Free XOR Gates and Applications
• MiniLEGO: efficient secure two-party computation from general assumptions
• More efficient oblivious transfer extensions with security for malicious adversaries
• Non-interactive secure computation based on cut-and-choose
• Secure two-party computation is practical
• Secure two-party computation via cut-and-choose oblivious transfer
• Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique (extended abstract)
• The simplest protocol for oblivious transfer
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• Two-output secure computation with malicious adversaries

Cited in

(15)

• An efficient structural attack on NIST submission DAGS
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
• The price of active security in cryptographic protocols
• Fast garbling of circuits under standard assumptions
• Secure two-party computation with low communication
• Faster maliciously secure two-party computation using the GPU
• Efficient secure two-party exponentiation
• Secure two-party computation is practical
• Automatic protocol selection in secure two-party computations
• Non-interactive secure 2PC in the offline/online and batch settings
• Actively secure garbled circuits with constant communication overhead in the plain model
• Faster secure multi-party computation of AES and DES using lookup tables
• The price of active security in cryptographic protocols
• Authenticated BitGC for actively secure rate-one 2PC
• Optimizing authenticated garbling for faster secure two-party computation

Describes a project that uses

Uses Software

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

This page was built for publication: Faster secure two-party computation in the single-execution setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270369)