TY - GEN
T1 - Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
AU - Hazay, Carmit
N1 - Publisher Copyright: © International Association for Cryptologic Research 2015.
PY - 2015
Y1 - 2015
N2 - 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 for these problems (and others). Our starting point is the [6] technique (CRYPTO 2011) for verifiable delegation of polynomial evaluations, using algebraic PRFs. We use this tool, that is useful to achieve verifiability in the outsourced setting, in order to achieve privacy in the standard two-party setting. Our results imply new simple and efficient oblivious polynomial evaluation (OPE) protocols. We further show that our OPE protocols are readily used for secure set-intersection, implying much simpler protocols in the plain model. As a side result, we demonstrate the usefulness of algebraic PRFs for various search functionalities, such as keyword search and oblivious transfer with adaptive queries. Our protocols are secure under full simulationbased definitions in the presence of malicious adversaries.
AB - 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 for these problems (and others). Our starting point is the [6] technique (CRYPTO 2011) for verifiable delegation of polynomial evaluations, using algebraic PRFs. We use this tool, that is useful to achieve verifiability in the outsourced setting, in order to achieve privacy in the standard two-party setting. Our results imply new simple and efficient oblivious polynomial evaluation (OPE) protocols. We further show that our OPE protocols are readily used for secure set-intersection, implying much simpler protocols in the plain model. As a side result, we demonstrate the usefulness of algebraic PRFs for various search functionalities, such as keyword search and oblivious transfer with adaptive queries. Our protocols are secure under full simulationbased definitions in the presence of malicious adversaries.
KW - Committed Oblivious PRF
KW - Efficient Secure Computation
KW - Oblivious Polynomial Evaluation
KW - Secure Set-Intersection
UR - http://www.scopus.com/inward/record.url?scp=84924352675&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-46497-7_4
DO - 10.1007/978-3-662-46497-7_4
M3 - منشور من مؤتمر
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 90
EP - 120
BT - Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings
A2 - Dodis, Yevgeniy
A2 - Nielsen, Jesper Buus
PB - Springer Verlag
T2 - 12th Theory of Cryptography Conference, TCC 2015
Y2 - 23 March 2015 through 25 March 2015
ER -