期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Unconditionally Secure Oblivious Polynomial Evaluation:A Survey and New Results 被引量:1
1
作者 Louis Cianciullo Hossein Ghodosi 《Journal of Computer Science & Technology》 SCIE EI CSCD 2022年第2期443-458,共16页
Oblivious polynomial evaluation(OPE)is a two-party protocol that allows a receiver,R to learn an evaluation f(α),of a sender,S's polynomial(f(x)),whilst keeping both a and f(x)private.This protocol has attracted ... Oblivious polynomial evaluation(OPE)is a two-party protocol that allows a receiver,R to learn an evaluation f(α),of a sender,S's polynomial(f(x)),whilst keeping both a and f(x)private.This protocol has attracted a lot of attention recently,as it has wide ranging applications in the field of cryptography.In this article we review some of these applications and,additionally,take an in-depth look at the special case of information theoretic OPE.Specifically,we provide a current and critical review of the existing information theoretic OPE protocols in the literature.We divide these protocols into two distinct cases(three-party and distributed OPE)allowing for the easy distinction and classification of future information theoretic OPE protocols.In addition to this work,we also develop several modifications and extensions to existing schemes,resulting in increased security,flexibility and efficiency.Lastly,we also identify a security flaw in a previously published OPE scheme. 展开更多
关键词 oblivious polynomial evaluation unconditionally secure information theoretic
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部