Adaptive versus non-adaptive security of multi-party protocols

DOI10.1007/s00145-004-0135-xzbMath1091.94020OpenAlexW2065579695MaRDI QIDQ1882568

Stefan Dziembowski, Tal Malkin, Yuval Ishai, Ran Canetti, Ivan B. Damgård

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1007/s00145-004-0135-x

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Related Items (13)

Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Completeness theorems for adaptively secure broadcast ⋮ Perfect MPC over layered graphs ⋮ A full proof of the BGW protocol for perfectly secure multiparty computation ⋮ Efficient one-sided adaptively secure computation ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Adaptively Secure Two-Party Computation with Erasures ⋮ Efficient perfectly secure computation with optimal resilience ⋮ On the power of secure two-party computation ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ On the Power of Secure Two-Party Computation

This page was built for publication: Adaptive versus non-adaptive security of multi-party protocols