Secure two-party computation via cut-and-choose oblivious transfer
type: Item
instance of: scholarly article
title: Secure two-party computation via cut-and-choose oblivious transfer
zbMATH Open document ID: 1278.94056
author: Yehuda Lindell
author: Benny Pinkas
published in: Journal of Cryptology
publication date: 2013-01-04T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6121912
zbMATH Keywords: secure two-party computation
zbMATH Keywords: malicious adversaries
zbMATH Keywords: cut-and-choose
zbMATH Keywords: concrete efficiency
MaRDI profile type: Publication
full work available at URL: s00145-011-9107-0
OpenAlex ID: W2120315802
cites work: Security against covert adversaries: Efficient protocols for realistic adversaries
cites work: Q4035733
cites work: Security and composition of multiparty cryptographic protocols
cites work: Q4783717
cites work: Universal classes of hash functions
cites work: Q4940695
cites work: Quantum Communication Attacks on Classical Cryptographic Protocols
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
cites work: Q4434875
cites work: Foundations of Cryptography
cites work: Q4279565
cites work: Efficient Two Party and Multi Party Computation Against Covert Adversaries
cites work: A Pseudorandom Generator from any One-way Function
cites work: Efficient secure two-party protocols. Techniques and constructions
cites work: Efficient Set Operations in the Presence of Malicious Adversaries
cites work: Founding Cryptography on Oblivious Transfer – Efficiently
cites work: Secure Arithmetic Computation with No Honest Majority
cites work: Efficient Two-Party Secure Computation on Committed Inputs
cites work: Improved Garbled Circuit: Free XOR Gates and Applications
cites work: Parallel coin-tossing and constant-round secure two-party computation
cites work: Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
cites work: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
cites work: A proof of security of Yao's protocol for two-party computation
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Q4718481
cites work: Public Key Cryptography - PKC 2006
cites work: Q4231922
cites work: LEGO for Two-Party Secure Computation
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: Secure Two-Party Computation Is Practical
cites work: How to share a secret
DOI: 10.1007/S00145-011-9107-0
description: scientific article; zbMATH DE number 6121912