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

Constant-Round Private Function Evaluation with Linear Complexity

Jonathan I. Katz, Lior Malka

Published Jan 1, 2011• 48 citations
Publisher
DOI
10.1007/978-3-642-25385-0_30

Related papers

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

Private Function Evaluation with Linear Complexity

Shuaishuai Li, Cong Zhang, Anyu Wang +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

Linear-Complexity Private Function Evaluation is Practical

Marco Holz, Ágnes Kiss, Deevashwer Rathee +1 more

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

Low-randomness constant-round private XOR computations

Carlo Blundo, Clemente Galdi, Giuseppe Persiano

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

Randomness Recycling in Constant-Round Private Computations

Carlo Blundo, Clemente Galdi, Pino Persiano

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

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