Randomness complexity of private computation

DOI10.1007/s000370050025zbMath0983.94033OpenAlexW2085125115MaRDI QIDQ1961058

Carlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro

Publication date: 21 April 2002

Published in: Computational Complexity (Search for Journal in Brave)

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

zbMATH Keywords

entropycryptographyrandomness complexityprivate protocols

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Measures of information, entropy (94A17) Information theory (general) (94A15)

Related Items

Randomness-efficient non-interactive zero knowledge, Lower and upper bounds on the randomness complexity of private computations of AND, Random sources in private computation, Tight bounds on the randomness complexity of secure multiparty computation, Unnamed Item, On the Communication Required for Unconditionally Secure Multiplication, Binary decompositions of probability densities and random-bit simulation, Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND