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

Lecture notes in computer science

Randomness Recycling in Constant-Round Private Computations

Carlo Blundo, Clemente Galdi, Pino Persiano

Published Jan 1, 1999• 11 citations
Publisher
DOI
10.1007/3-540-48169-9_10

Related papers

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

Low-randomness constant-round private XOR computations

Carlo Blundo, Clemente Galdi, Giuseppe Persiano

International Journal of Information Security•Aug 7, 2006•5 citations

A Randomness-Rounds Tradeoff in Private Computation

Eyal Kushilevitz, Adi Rosén

Springer eBooks•Aug 9, 2007•22 citations

Constant-Round Private Function Evaluation with Linear Complexity

Jonathan I. Katz, Lior Malka

Lecture notes in computer science•Jan 1, 2011•49 citations

Constant-Round Multiparty Private Function Evaluation with (Quasi-)Linear Complexities

Yongfeng Xu, Hanyu Jia, Xiangxue Li +3 more

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

Randomness complexity of private computation

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

Computational Complexity•Nov 1, 1999•27 citations