• Oblivious Multi-variate Polyno...

Treffer: Oblivious Multi-variate Polynomial Evaluation

Title:
Oblivious Multi-variate Polynomial Evaluation
Authors:
Gavin, Gerald, Minier, Marine
Contributors:
Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Smart Wireless Networking (SWING), Centre Inria de l'Université Grenoble Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), Bimal K. Roy and Nicolas Sendrier
Source:
Progress in Cryptology - INDOCRYPT 2009. :430-442
Publisher Information:
CCSD, 2009.
Publication Year:
2009
Collection:
collection:CNRS
collection:INRIA
collection:UNIV-LYON1
collection:UNIV-LYON2
collection:INSA-LYON
collection:EC-LYON
collection:INRIA-RHA
collection:LIRIS
collection:INRIA_TEST
collection:TESTALAIN1
collection:INRIA2
collection:LABEXIMU
collection:INRIA-RENGRE
collection:CITI
collection:INSA-GROUPE
collection:UDL
collection:UNIV-LYON
collection:HAL-LYON-2-NOUVELLE-VERSION
Subject Terms:
Homomorphic encryption schemes, Oblivious Polynomial Evaluation (OPE), semantic security, Homomorphic encryption schemes; Oblivious Polynomial Evaluation (OPE); semantic security, ACM: G.: Mathematics of Computing, G.4: MATHEMATICAL SOFTWARE, G.4.0: Algorithm design and analysis, [INFO.INFO-NI]Computer Science [cs], Networking and Internet Architecture [cs.NI]
Subject Geographic:
New Delhi, India
Original Identifier:
HAL:
Document Type:
Konferenz conferenceObject<br />Conference papers
Language:
English
Relation:
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-10628-6_28
DOI:
10.1007/978-3-642-10628-6_28
Availability:
https://inria.hal.science/inria-00524361
Accession Number:
edshal.inria.00524361v1
Database:
HAL

Weitere Informationen

n this paper, we propose a protocol for Oblivious Polynomial Evaluation (OPE) considering a multi-variate polynomial. There are two parties, Alice who has a secret multi-variate polynomial f and Bob who has an input x = (x 1,...,x T ). Thus, Bob wants to compute f(x) without any information leakage: Alice learns nothing about x and Bob learns only what can be inferred from f(x). In [4], the authors proposed a solution for this problem using Oblivious Transfer (OT) protocol only. In this paper, we propose efficient OPE protocols for the multi-variate case based upon additive and multiplicative homomorphic encryption schemes defined on the same domain. Our protocol only reveals the number of monomials.