Jan. 24, 2022, 2:20 a.m. | Jean-Guillaume Dumas (CASC), Aude Maignan (CASC), Clément Pernet (CASC), Daniel S. Roche

cs.CR updates on arXiv.org arxiv.org

We consider the problem of efficiently evaluating a secret polynomial at a
given public point, when the polynomial is stored on an untrusted server. The
server performs the evaluation and returns a certificate, and the client can
efficiently check that the evaluation is correct using some pre-computed keys.
Our protocols support two important features: the polynomial itself can be
encrypted on the server, and it can be dynamically updated by changing
individual coefficients cheaply without redoing the entire setup. As …

SOC 2 Manager, Audit and Certification

@ Deloitte | US and CA Multiple Locations

Cyber Security Cloud Solution Architect

@ Microsoft | London, London, United Kingdom

Compliance Program Analyst

@ SailPoint | United States

Software Engineer III, Infrastructure, Google Cloud Security and Privacy

@ Google | Sunnyvale, CA, USA

Cryptography Expert

@ Raiffeisen Bank Ukraine | Kyiv, Kyiv city, Ukraine

Senior Cyber Intelligence Planner (15.09)

@ OCT Consulting, LLC | Washington, District of Columbia, United States