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

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

Goichiro Hanaoka, Hideki Imai, Joern Mueller-Quade, Anderson C. A. Nascimento, Akira Otsuka, Andreas Winter

Published Jan 1, 2004• 14 citations
Publisher
DOI
10.1007/978-3-540-27800-9_6

Related papers

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

Charles A. Anderson, Akira Otsuka, Mueler-Quade Joern +2 more

IEEE International Symposium on Information Theory (ISIT)•Dec 15, 2003•0 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

Information-theoretically secure oblivious polynomial evaluation in the commodity-based model

Rafael Tonicelli, Anderson C. A. Nascimento, Rafael Dowsley +4 more

International Journal of Information Security•Jun 15, 2014•30 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

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

Carmit Hazay

Lecture notes in computer science•Jan 1, 2015•47 citations

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

Carmit Hazay

Journal of Cryptology•Aug 21, 2017•31 citations