Randomness versus fault-tolerance

DOI10.1007/S001459910005zbMath0957.68044OpenAlexW2035912926MaRDI QIDQ1976006

Eyal Kushilevitz, Ran Canetti, Rafail Ostrovsky, Adi Rosén

Publication date: 8 May 2000

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001459910005

zbMATH Keywords

multiparty protocols

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Tight bounds on the randomness complexity of secure multiparty computation ⋮ VSS Made Simpler

This page was built for publication: Randomness versus fault-tolerance