搜索结果: 1-9 共查到“军事学 polynomial evaluation”相关记录9条 . 查询时间(0.188 秒)
Reducing Complexity of Pairing Comparisons using Polynomial Evaluation
elliptic curve cryptosystem implementation polynomials bilinear maps
2018/6/5
We propose a new method for reducing complexity of the pairing comparisons based on polynomials. Thought the construction introduces uncertainty into (usually deterministic) checks, it is easily quant...
Verifiable Private Polynomial Evaluation
verifiable computation private polynomial security models
2017/8/8
Delegating the computation of a polynomial to a server in a verifiable way is challenging. An even more challenging problem is ensuring that this polynomial remains hidden to clients who are able to q...
Methods for Efficient Homomorphic Integer Polynomial Evaluation based on GSW FHE
GSW integer multiplication packing
2016/5/23
We introduce new methods to evaluate integer polynomials
with GSW FHE. Our methods cause much slower noise growth and result
in much better efficiency in the evaluation of low-degree large plaintext...
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...
Zero-knowledge Argument for Polynomial Evaluation with Application to Blacklists
Zero-knowledge argument discrete logarithm polynomial evaluation
2016/1/3
Verification of a polynomial’s evaluation in a secret committed value plays a role in cryptographic applications such as non-membership or membership proofs. We construct a novel special honest verifi...
Detection of Cheaters in Non-interactive Polynomial Evaluation
foundations / Secret sharing non-interactive polynomial evaluation cheating detection
2013/2/21
In this paper, we consider both theoretical and practical aspects of robust NI-PE (non-interactive polynomial evaluation with detection of cheaters). First, we give a necessary condition of adversary ...
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...