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

Linear-Complexity Private Function Evaluation is Practical

Marco Holz, Ágnes Kiss, Deevashwer Rathee, Thomas H. Schneider

Published Jan 1, 2020• 10 citations
Publisher
DOI
10.1007/978-3-030-59013-0_20

Related papers

Private Function Evaluation with Linear Complexity

Shuaishuai Li, Cong Zhang, Anyu Wang +1 more

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

Constant-Round Private Function Evaluation with Linear Complexity

Jonathan I. Katz, Lior Malka

Lecture notes in computer science•Jan 1, 2011•48 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

Practical Secure Evaluation of Semi-private Functions

Annika Paus, Ahmad‐Reza Sadeghi, Thomas H. Schneider

Lecture notes in computer science•Jan 1, 2009•71 citations

A Practical Universal Circuit Construction and Secure Evaluation of Private Functions

Vladimir Kolesnikov, Thomas H. Schneider

Lecture notes in computer science•Aug 13, 2008•111 citations

Making Private Function Evaluation Safer, Faster, and Simpler

Yi Liu, Qi Wang, Siu‐Ming Yiu

Lecture notes in computer science•Jan 1, 2022•6 citations