Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Computational Complexity

Randomness complexity of private computation

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

Published Nov 1, 1999• 27 citations
Publisher
DOI
10.1007/s000370050025

Related papers

Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND

Eyal Kushilevitz Z, Rafail Ostrovsky, Emmanuel Prouff +3 more

Lecture notes in computer science•Jan 1, 2019•2 citations

On the number of random bits in totally private computation

Carlo Blundo, Alfredo De Santis, Giuseppe Persiano +1 more

Lecture notes in computer science•Jan 1, 1995•12 citations

A Randomness-Rounds Tradeoff in Private Computation

Eyal Kushilevitz Z, Adi Rosén

Springer eBooks•Aug 9, 2007•20 citations

Randomness Recycling in Constant-Round Private Computations

Carlo Blundo, Clemente Galdi, Pino Persiano

Lecture notes in computer science•Jan 1, 1999•10 citations

Random Sources in Private Computation

Geoffroy Couteau, Adi Rosén

Lecture notes in computer science•Jan 1, 2022•1 citation

Randomness Recycling in Constant-Round Private Computations (extended Abstract)

Carlo Blundo, Clemente Galdi, Pino Persiano

International Symposium on Distributed Computing•Sep 27, 1999•2 citations