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

Private Function Evaluation with Linear Complexity

Shuaishuai Li, Cong Zhang, Anyu Wang, Xiaoyun Wang

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-35418-1_4

Related papers

Constant-Round Private Function Evaluation with Linear Complexity

Jonathan I. Katz, Lior Malka

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

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

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

Actively Secure Private Function Evaluation

Payman Mohassel, Saeed Sadeghian, Nigel Paul Smart

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