Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
نویسندگان
چکیده
منابع مشابه
An Algebraic Approach to Maliciously Secure Private Set Intersection
Private set intersection is an important area of research and has been the focus of many works over the past decades. It describes the problem of finding an intersection between the input sets of at least two parties without revealing anything about the input sets apart from their intersection. In this paper, we present a new approach to compute the intersection between sets based on a primitiv...
متن کاملSecure Multiparty Overall Mean Computation via Oblivious Polynomial Evaluation
The number of opportunities for cooperative computation has exponentially been increasing with growing interaction via Internet technologies. 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 and perhaps useless data values. To conduct ...
متن کاملCryptanalysis on a novel unconditionally secure oblivious polynomial evaluation protocol
Vanishree et.al proposed a novel unconditionally oblivious polynomial evaluation protocol and they claimed that can fulfill both sender and receiver’s security. Here, this protocol is cryptanalyzed. We find that it has a fatal fault which cannot implement the receiver’s security at all and show the detail analyzing process. Keywords oblivious polynomial evaluation, oblivious transfer, multi-par...
متن کاملA Novel Unconditionally Secure Oblivious Polynomial Evaluation Protocol
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P , and a receiver whose input is a value x. At the end of the protocol, the receiver learns P (x) and nothing more about P , while the sender remains oblivious of both x and P (x). It is used as a primitive in many applications including protocols for private comparison of data, for mutual...
متن کاملOblivious Polynomial Evaluation and Oblivious Neural Learning
We study the problem of Oblivious Polynomial Evaluation (OPE), where one party has a polynomial P and the other party, with an input x, wants to learn P (x) in an oblivious way. Previously existing protocols are based on some intractability assumptions that have not been well studied [10, 9], and these protocols are only applicable for polynomials over finite fields. In this paper, we propose e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2017
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-017-9263-y