Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols

An important benchmark for multi-party computation protocols (MPC) is their round complexity . For several important MPC tasks, such as broadcast, (tight) lower bounds on the round complexity are known. However, some of these lower bounds can be circumvented when the termination round of every party...

Full description

Bibliographic Details

Published in:	Journal of cryptology Vol. 34; no. 2
Main Authors:	Cohen, Ran, Coretti, Sandro, Garay, Juan, Zikas, Vassilis
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2021 Springer Nature B.V
Subjects:	Coding and Information Theory Combinatorics Communications Engineering Composition Computational Mathematics and Numerical Analysis Computer networks Computer Science Cryptography Distributed processing Lower bounds Networks Probability Theory and Stochastic Processes Protocol Questions Task complexity
ISSN:	0933-2790, 1432-1378
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!