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...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of cryptology Ročník 34; číslo 2
Hlavní autoři:	Cohen, Ran, Coretti, Sandro, Garay, Juan, Zikas, Vassilis
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.04.2021 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!