Work

Fast Homomorphic Evaluation of LWR-based PRFs

Year: 2025

Type: conference-paper

Abstract: Certain applications of fully homomorphic encryption (such as transciphering, universal thresholdizers, and PIR) require randomness while operating over encrypted data. This randomness has to be obliviously generated in the encrypted domain and remain encrypted throughout the computation. Moreover, it should be guaranteed that independent-looking random coins can be obliviously generated for different computations.

Source: ACM SIGSAC Conference on Computer and Communications Security (CCS)

DOI: 10.1145/3719027.3765177

Authors: Amit Deo, Marc Joye, Benoît Libert, Benjamin R. Curtis, Mayeul de Bellabre

Institution: Zama (France)

Language: English

Topic: Cryptography and Data Security

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W4416549335

FWCI: 1.496

Cites: 61

Cited by: 2

Related to: 10