Adaptive versus non-adaptive security of multi-party protocols

DOI10.1007/S00145-004-0135-XMaRDI QIDQ1882568zbMATH OpenOpenAlexFDO

Authors Ran Canetti, Stefan Dziembowski, Yuval Ishai, Tal Malkin, 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)

Review text

The article is devoted to comparative security analysis of multi-party cryptographic protocols with two types of adversarial settings. In the non-adaptive setting the set of corrupted parties is chosen in advance. In the adaptive case a corrupted member is defined during the course of the communication. The equivalence relations between adaptive and non-adaptive security are studied. It is proved that under the basic definition adaptive security is equivalent to non-adaptive security when the number of parties is logarithmic. For Byzantine adversaries adaptive security is stronger that non-adaptive security.

Recommendations

• scientific article; zbMATH DE number 1722683
• Adaptively secure, universally composable, multiparty computation in constant rounds
• Adaptive security of multi-party protocols, revisited
• scientific article; zbMATH DE number 1256784
• Adaptive security with quasi-optimal rate

Cited in

(20)

• On the power of secure two-party computation
• scientific article; zbMATH DE number 1722683 (Why is no real title available?)
• On the Power of Secure Two-Party Computation
• Adaptive versus Static Security in the UC Model
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• Adaptively Secure Two-Party Computation with Erasures
• Understanding adaptivity: random systems revisited
• 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 MPC with sublinear communication complexity
• Efficient perfectly secure computation with optimal resilience
• 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
• Proximity gaps for Reed-Solomon codes
• Rumors MPC: GOD for dynamic committees, low communication via constant-round chat

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

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