Round-preserving parallel composition of probabilistic-termination cryptographic protocols

DOI10.4230/LIPICS.ICALP.2017.37MaRDI QIDQ5111368zbMATH OpenOpenAlexFDO

Authors Ran Cohen, Sandro Coretti, Juan Garay, Vassilis Zikas

Publication date 27 May 2020

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

zbMATH Keywords

broadcastcryptographic protocolssecure multi-party computation

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14)

Recommendations

• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• Probabilistic Termination and Composability of Cryptographic Protocols
• Probabilistic termination and composability of cryptographic protocols
• Sequential composition of protocols without simultaneous termination
• Round-optimal secure multi-party computation

Cited in

(11)

• Broadcast-optimal two-round MPC
• Probabilistic termination and composability of cryptographic protocols
• On the round complexity of randomized Byzantine agreement
• Multiparty generation of an RSA modulus
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• Completeness theorems for adaptively secure broadcast
• Proof-of-reputation blockchain with Nakamoto fallback
• Optimal extension protocols for Byzantine broadcast and agreement
• Round-optimal Byzantine agreement
• Probabilistic Termination and Composability of Cryptographic Protocols
• Sequential composition of protocols without simultaneous termination

This page was built for publication: Round-preserving parallel composition of probabilistic-termination cryptographic protocols

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