Round-preserving parallel composition of probabilistic-termination cryptographic protocols
From MaRDI portal
Publication:5111368
DOI10.4230/LIPICS.ICALP.2017.37zbMATH Open1441.68013OpenAlexW2740377119MaRDI QIDQ5111368FDOQ5111368
Juan 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
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
- Multiparty generation of an RSA modulus
- On the round complexity of randomized Byzantine agreement
- Completeness theorems for adaptively secure broadcast
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Proof-of-reputation blockchain with Nakamoto fallback
- Optimal extension protocols for Byzantine broadcast and agreement
- Probabilistic Termination and Composability of Cryptographic Protocols
- Round-optimal Byzantine agreement
- From fairness to full security in multiparty computation
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)
