April 3, 2024, 4:11 a.m. | Wuqiong Pan, Hongliang Gu

cs.CR updates on arXiv.org arxiv.org

arXiv:2312.06987v3 Announce Type: replace
Abstract: This article describes a lightweight additive homomorphic algorithm with the same encryption and decryption keys. Compared to standard additive homomorphic algorithms like Paillier, this algorithm reduces the computational cost of encryption and decryption from modular exponentiation to modular multiplication, and reduces the computational cost of ciphertext addition from modular multiplication to modular addition. This algorithm is based on a new mathematical problem: in two division operations, whether it is possible to infer the remainder or …

addition algorithm algorithms article arxiv ciphertext computational cost cs.cr decryption decryption keys encryption homomorphic encryption keys modular standard

SOC 2 Manager, Audit and Certification

@ Deloitte | US and CA Multiple Locations

Emergency Management Invoice Compliance Reviewer

@ AC Disaster Consulting | Denver, Colorado, United States - Remote

Threat Intelligence Librarian

@ Microsoft | Cheltenham, Gloucestershire, United Kingdom

Cyber Content Operations Manager - Remote in UK

@ Immersive Labs | United Kingdom

(Junior) Security Engineer (m/w/d)

@ CHECK24 | Berlin, Germany

Cyber Security

@ Necurity Solutions | Bengaluru, Karnataka, India