An efficient protocol for secure two-party computation in the presence of malicious adversaries

DOI10.1007/s00145-014-9177-xzbMath1314.94086OpenAlexW1999731694MaRDI QIDQ2344051

Yehuda Lindell, Benny Pinkas

Publication date: 12 May 2015

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

Full work available at URL: https://doi.org/10.1007/s00145-014-9177-x

zbMATH Keywords

Yao's protocolsecure two-party computationreal/ideal simulation paradigmsecurity against malicious adversaries

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Efficient one-sided adaptively secure computation, Improved OR-Composition of Sigma-Protocols, Garbled Circuits as Randomized Encodings of Functions: a Primer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• A proof of security of Yao's protocol for two-party computation
• How to construct constant-round zero-knowledge proof systems for NP
• Security and composition of multiparty cryptographic protocols
• Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Foundations of Cryptography
• Strict Polynomial-Time in Simulation and Extraction
• Foundations of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Revisiting the Efficiency of Malicious Two-Party Computation
• Efficient Two-Party Secure Computation on Committed Inputs
• Theory of Cryptography
• Public Key Cryptography - PKC 2006