Amortizing Randomness in Private Multiparty Computations

DOI10.1137/S089548010135274XzbMath1043.94011OpenAlexW1978001347MaRDI QIDQ4443108

Adi Rosén, Eyal Kushilevitz, Rafail Ostrovsky

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s089548010135274x

zbMATH Keywords

cryptographic protocolsrandomnessamortizationprivate distributed computationsround-complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

Lower and upper bounds on the randomness complexity of private computations of AND ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND

This page was built for publication: Amortizing Randomness in Private Multiparty Computations