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

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

J. Mueller-Quade, A Otsuka, G Hanaoka, H. Imai, A. Nascimento, Andreas Winter

Published Jan 1, 2004• 0 citations
OpenAlex

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 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

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

Unconditionally Secure Distributed Oblivious Polynomial Evaluation

Louis Cianciullo, Hossein Ghodosi

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