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

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

Carmit Hazay

Published Jan 1, 2015• 50 citations
Publisher
DOI
10.1007/978-3-662-46497-7_4

Related papers

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

Carmit Hazay

Journal of Cryptology•Aug 21, 2017•35 citations

Unconditionally Secure Oblivious Polynomial Evaluation: A Survey and New Results

Louis Cianciullo, Hossein Ghodosi

Journal of Computer Science and Technology•Mar 31, 2022•5 citations

Information theoretic secure oblivious polynomial evaluation: Model, bounds and constructions

J. Mueller-Quade, A Otsuka, G Hanaoka +3 more

•Jan 1, 2004•0 citations

Unconditionally Secure Distributed Oblivious Polynomial Evaluation

Louis Cianciullo, Hossein Ghodosi

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

Information Theoretically Secure Oblivious Polynomial Evaluation: Model, Bounds, and Constructions

Goichiro Hanaoka, Hideki Imai, Joern Mueller-Quade +3 more

Lecture notes in computer science•Jan 1, 2004•14 citations

A New Unconditionally-secure Oblivious Polynomial Evaluation Protocol

Wang Jiang-an, WANG Qinglong -

INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences•Jan 30, 2013•0 citations