MyOPE: Malicious SecuritY for Oblivious Polynomial Evaluation

Autor: Malika Izabachène, Anca Nitulescu, Paola de Perthuis, David Pointcheval
Přispěvatelé: Cosmian, Protocol Labs, Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Clemente Galdi, Stanislaw Jarecki, European Project: 966570,CryptAnalytics
Jazyk: angličtina
Rok vydání: 2022
Předmět:
Zdroj: Lecture Notes in Computer Science
SCN 2022-13th Conference on Cryptography and Security for Networks
SCN 2022-13th Conference on Cryptography and Security for Networks, Sep 2022, Amalfi, Italy. pp.663-686, ⟨10.1007/978-3-031-14791-3_29⟩
Lecture Notes in Computer Science ISBN: 9783031147906
DOI: 10.1007/978-3-031-14791-3_29⟩
Popis: International audience; Oblivious Polynomial Evaluation (OPE) schemes are interactive protocols between a sender with a private polynomial and a receiver with a private evaluation point where the receiver learns the evaluation of the polynomial in their point and no additional information. In this work, we introduce MyOPE, a "short-sighted" non-interactive polynomial evaluation scheme with a polylogarithmic communication complexity in the presence of malicious senders. In addition to strong privacy guarantees, MyOPE enforces honest sender behavior and consistency by adding verifiability to the calculations. The main building block for this new verifiable OPE is an inner product argument (IPA) over rings that guarantees an inner product relation holds between committed vectors. Our IPA works for vectors with elements from generic rings of polynomials and has constant-size proofs that consist in one commitment only while the verification, once the validity of the vector-commitments has been checked, consists is one quadratic equation only. We further demonstrate the applications of our IPA for verifiable OPE using Fully Homomorphic Encryption (FHE) over rings of polynomials: we prove the correctness of an inner product between the vector of powers of the evaluation point and the vector of polynomial coefficients, along with other inner-products necessary in this application's proof. MyOPE builds on generic secure encoding techniques for succinct commitments, that allow realworld FHE parameters and Residue Number System (RNS) optimizations, suitable for high-degree polynomials.
Databáze: OpenAIRE
Externí odkaz: