Unconditionally Secure Oblivious Polynomial Evaluation:A Survey and New Results
作者机构：College of Science and EngineeringJames Cook UniversityTownsvilleQLD 4811Australia
出 版 物：《Journal of Computer Science & Technology》 (计算机科学技术学报（英文版）)
年 卷 期：2022年第37卷第2期
页 面：443-458页
核心收录：
学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学]
主 题：oblivious polynomial evaluation unconditionally secure information theoretic
摘 要：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)*** protocol has attracted a lot of attention recently,as it has wide ranging applications in the field of *** this article we review some of these applications and,additionally,take an in-depth look at the special case of information theoretic ***,we provide a current and critical review of the existing information theoretic OPE protocols in the *** divide these protocols into two distinct cases(three-party and distributed OPE)allowing for the easy distinction and classification of future information theoretic OPE *** addition to this work,we also develop several modifications and extensions to existing schemes,resulting in increased security,flexibility and ***,we also identify a security flaw in a previously published OPE scheme.
维普期刊数据库