搜索结果: 1-4 共查到“军事学 oblivious polynomial evaluation”相关记录4条 . 查询时间(0.14 秒)
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
Efficient Secure Computation Oblivious Polynomial Evaluation Secure Set-Intersection
2016/1/5
In this paper we study the two fundamental functionalities oblivious polynomial evaluation in the
exponent and set-intersection, and introduce a new technique for designing efficient secure protocols...
Efficient Oblivious Polynomial Evaluation with Simulation-Based Security
secure two-party computation efficient protocols full simulation-based security
2009/9/27
The study of secure multiparty computation has yielded powerful feasibility results showing
that any efficient functionality can be securely computed in the presence of malicious adver-
saries. Desp...
Efficient Oblivious Polynomial Evaluation with Simulation-Based Security
secure two-party computation efficient protocols full simulation-based security
2009/9/22
The study of secure multiparty computation has yielded powerful feasibility results showing
that any efficient functionality can be securely computed in the presence of malicious adver-
saries. Desp...
Sequentially Composable Information Theoretically Secure Oblivious Polynomial Evaluation
Oblivious polynomial evaluation OPE Oblivious Equality Testing Problem
2009/6/15
Oblivious polynomial evaluation (OPE) consists of a twoparty
protocol where a sender inputs a polynomial P, and a receiver
inputs a single value i. At the end of the protocol, the sender learns
not...