IEEE International Symposium on Information Theory (ISIT)

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

Charles A. Anderson, Akira Otsuka, Mueler-Quade Joern, Goichiro Hanaoka, Hideki Imai

Published Dec 15, 2003• 0 citations

Related papers

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

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

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

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

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

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

Unconditionally Secure Oblivious Polynomial Evaluation: A Survey and New Results

Louis Cianciullo, Hossein Ghodosi

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

Carmit Hazay

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

Carmit Hazay