Oblivious polynomial evaluation

2004 ◽  
Vol 19 (4) ◽  
pp. 550-554 ◽  
Author(s):  
Hong-Da Li ◽  
Dong-Yao Ji ◽  
Deng-Guo Feng ◽  
Bao Li
Keyword(s):  
Polynomial Evaluation ◽  
Oblivious Polynomial Evaluation

scholarly journals Secure Multiparty Computation via Oblivious Polynomial Evaluation

2013 ◽  
pp. 253-278
Author(s):  
Mert Özarar ◽  
Attila Özgit
Keyword(s):  
Secure Multiparty Computation ◽  
Future Research ◽  
Primary Concern ◽  
Multiparty Computation ◽  
Polynomial Evaluation ◽  
Oblivious Polynomial Evaluation ◽  
Private Data ◽  
Significant Research ◽  
Critical Issues ◽  
Combinational Logic Circuits

The number of opportunities for cooperative computation has exponentially been increasing with growing interaction via Internet technologies. These computations could occur between almost trusted partners, between partially trusted partners, or even between competitors. Most of the time, the communicating parties may not want to disclose their private data to the other principal while taking the advantage of collaboration, hence concentrating on the results rather than private data values. For performing such computations, one party must know inputs from all the participants; however, if none of the parties can be trusted enough to know all the inputs, privacy will become a primary concern. Hence, the techniques for Secure Multiparty Computation (SMC) are quite relevant and practical to overcome such kind of privacy gaps. The subject of SMC has evolved from earlier solutions of combinational logic circuits to the recent proposals of anonymity-enabled computation. In this chapter, the authors put together the significant research that has been carried out on SMC. They demonstrate the concept by concentrating on a specific technique called Oblivious Polynomial Evaluation (OPE) together with concrete examples. The authors put critical issues and challenges and the level of adaptation achieved before the researchers. They also provide some future research proposals based on the literature survey.

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

2014 ◽  
Vol 14 (1) ◽  
pp. 73-84 ◽  
Author(s):  
Rafael Tonicelli ◽  
Anderson C. A. Nascimento ◽  
Rafael Dowsley ◽  
Jörn Müller-Quade ◽  
Hideki Imai ◽  
...  
Keyword(s):  
Polynomial Evaluation ◽  
Oblivious Polynomial Evaluation

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

2004 ◽  
pp. 62-73 ◽  
Author(s):  
Goichiro Hanaoka ◽  
Hideki Imai ◽  
Joern Mueller-Quade ◽  
Anderson C. A. Nascimento ◽  
Akira Otsuka ◽  
...  
Keyword(s):  
Evaluation Model ◽  
Polynomial Evaluation ◽  
Oblivious Polynomial Evaluation

scholarly journals Verifiable and Private Oblivious Polynomial Evaluation

2020 ◽  
pp. 49-65
Author(s):  
Hardik Gajera ◽  
Matthieu Giraud ◽  
David Gérault ◽  
Manik Lal Das ◽  
Pascal Lafourcade
Keyword(s):  
Polynomial Evaluation ◽  
Oblivious Polynomial Evaluation
Sign in / Sign up

Export Citation Format

Share Document