Secure two-party computation via cut-and-choose oblivious transfer

DOI10.1007/s00145-011-9107-0zbMath1278.94056OpenAlexW2120315802MaRDI QIDQ1928765

Benny Pinkas, Yehuda Lindell

Publication date: 4 January 2013

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

Full work available at URL: https://doi.org/10.1007/s00145-011-9107-0

zbMATH Keywords

concrete efficiencycut-and-choosesecure two-party computationmalicious adversaries

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (15)

Efficient set intersection with simulation-based security ⋮ ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Round optimal black-box ``commit-and-prove ⋮ Generalizing Efficient Multiparty Computation ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Breaking and fixing garbled circuits when a gate has duplicate input wires ⋮ Efficient one-sided adaptively secure computation ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Secure linear system computation in the presence of malicious adversaries ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Oblivious transfer based on single-qubit rotations ⋮ The price of active security in cryptographic protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient secure two-party protocols. Techniques and constructions
• A proof of security of Yao's protocol for two-party computation
• Universal classes of hash functions
• Parallel coin-tossing and constant-round secure two-party computation
• Security and composition of multiparty cryptographic protocols
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Quantum Communication Attacks on Classical Cryptographic Protocols
• Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
• How to share a secret
• Improved Garbled Circuit: Free XOR Gates and Applications
• Efficient Set Operations in the Presence of Malicious Adversaries
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
• A Framework for Efficient and Composable Oblivious Transfer
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• LEGO for Two-Party Secure Computation
• Secure Two-Party Computation Is Practical
• A Pseudorandom Generator from any One-way Function
• Foundations of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Efficient Two-Party Secure Computation on Committed Inputs
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Public Key Cryptography - PKC 2006

This page was built for publication: Secure two-party computation via cut-and-choose oblivious transfer