Adaptively Secure Two-Party Computation with Erasures

DOI10.1007/978-3-642-00862-7_8MaRDI QIDQ3623039zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Adaptively secure computation with partial erasures
• scientific article; zbMATH DE number 1256784
• Two-round adaptively secure multiparty computation from standard assumptions
• Adaptively secure, universally composable, multiparty computation in constant rounds
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation

Cites work

• A proof of security of Yao's protocol for two-party computation
• Adaptive versus non-adaptive security of multi-party protocols
• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Foundations of Cryptography
• scientific article; zbMATH DE number 3856987 (Why is no real title available?)
• scientific article; zbMATH DE number 5009201 (Why is no real title available?)
• scientific article; zbMATH DE number 176562 (Why is no real title available?)
• scientific article; zbMATH DE number 1256784 (Why is no real title available?)
• scientific article; zbMATH DE number 503243 (Why is no real title available?)
• scientific article; zbMATH DE number 503347 (Why is no real title available?)
• scientific article; zbMATH DE number 1088227 (Why is no real title available?)
• scientific article; zbMATH DE number 1504548 (Why is no real title available?)
• scientific article; zbMATH DE number 1418290 (Why is no real title available?)
• Information-theoretically secure protocols and security under composition
• Oblivious Transfer Is Symmetric
• Security and composition of multiparty cryptographic protocols
• Theory of Cryptography
• Universally composable two-party and multi-party secure computation

Cited in

(13)

• On black-box complexity of universally composable security in the CRS model
• On the feasibility of extending oblivious transfer
• Adaptively secure computation with partial erasures
• On Adaptively Secure Multiparty Computation with a Short CRS
• scientific article; zbMATH DE number 5009201 (Why is no real title available?)
• How to Protect Yourself without Perfect Shredding
• Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
• How to simulate it -- a tutorial on the simulation proof technique
• Efficient one-sided adaptively secure computation
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• One-Sided Adaptively Secure Two-Party Computation
• Adaptively secure MPC with sublinear communication complexity
• Constant-round adaptive zero-knowledge proofs for NP

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

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