Adaptively Secure Two-Party Computation with Erasures

DOI10.1007/978-3-642-00862-7_8zbMath1237.94072OpenAlexW2155605313MaRDI QIDQ3623039

Andrew Y. Lindell

Publication date: 29 April 2009

Published in: Topics in Cryptology – CT-RSA 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00862-7_8

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

On the feasibility of extending oblivious transfer ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ Efficient one-sided adaptively secure computation ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ On black-box complexity of universally composable security in the CRS model ⋮ How to Simulate It – A Tutorial on the Simulation Proof Technique

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• Adaptive versus non-adaptive security of multi-party protocols
• Security and composition of multiparty cryptographic protocols
• Information-theoretically secure protocols and security under composition
• Universally composable two-party and multi-party secure computation
• Oblivious Transfer Is Symmetric
• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
• Foundations of Cryptography
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Theory of Cryptography

This page was built for publication: Adaptively Secure Two-Party Computation with Erasures