Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols

DOI10.4230/LIPIcs.ICALP.2017.37zbMath1441.68013OpenAlexW2740377119MaRDI QIDQ5111368

Juan A. Garay, Sandro Coretti, Vassilis Zikas, Ran Cohen

Publication date: 27 May 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/icalp/icalp2017.html#CohenCGZ17

zbMATH Keywords

cryptographic protocolsbroadcastsecure multi-party computation

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14)

Related Items (10)

On the round complexity of randomized Byzantine agreement ⋮ Proof-of-reputation blockchain with Nakamoto fallback ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Round-optimal Byzantine agreement ⋮ Completeness theorems for adaptively secure broadcast ⋮ From fairness to full security in multiparty computation ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Multiparty generation of an RSA modulus ⋮ Broadcast-optimal two-round MPC

This page was built for publication: Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols