Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields

Cryptography and Communications, Journal Year: 2025, Volume and Issue: unknown

Published: Jan. 30, 2025

Language: Английский

---

ANT-ACE: An FHE Compiler Framework for Automating Neural Network Inference

Published: Feb. 22, 2025

Language: Английский

---

Designs for practical SHE schemes based on Ring-LWR

IACR Communications in Cryptology, Journal Year: 2025, Volume and Issue: 2(1)

Published: April 8, 2025

The Learning with Errors problem (LWE) and its variants are among the most popular assumptions underlying lattice-based cryptography. Rounding (LWR) can be thought of as a deterministic variant LWE. In this work, we present thorough study Somewhat Homomorphic Encryption schemes based on Ring-LWR that analogue Ring-LWE-based BFV scheme. Our main contribution is to two new schemes, in LPR Regev paradigms, give analysis their security (provable concrete). technical tools developed process may independent interest community. inherit many benefits being LWR, including avoiding need for expensive Gaussian sampling improved ciphertext size. Indeed, detailed comparison showing our marginally outperform scheme terms Moreover, show both support RNS variants. Regev-type seen an generalisation only prior work direction (Costache-Smart, 2017). particular, resolves tangled modulus issue Costache-Smart proposal led unmanageable noise growth, achieves factor n improvement size public key.

Language: Английский

---

Improved Universal Thresholdizer from Iterative Shamir Secret Sharing

Journal of Cryptology, Journal Year: 2025, Volume and Issue: 38(1)

Published: Jan. 1, 2025

Language: Английский

---

HRA-Secure Homomorphic Lattice-Based Proxy Re-Encryption with Tight Security

IACR Communications in Cryptology, Journal Year: 2025, Volume and Issue: 2(1)

Published: April 8, 2025

We construct an efficient proxy re-encryption (PRE) scheme secure against honest attacks (HRA-secure) with precise concrete security estimates. To get these estimates, we introduce the tight, fine-grained noise-flooding techniques of Li et al. (CRYPTO'22) to RLWE-based (homomorphic) PRE schemes, as well a mixed statistical-computational definition HRA analysis. Our solution also supports homomorphic operations on ciphertexts. Such homomorphism allows for advanced applications, e.g., encrypted computation network statistics across networks, and unlimited hops in case full homomorphism, i.e., when bootstrapping is available. implement our OpenFHE software library apply it problem multi-hop data distribution context 5G virtual slices. experimentally evaluate performance scheme, demonstrating that implementation practical. Moreover, compare method other lattice-based schemes approaches targeting security. These achieve security, but not practical such work. Further, present attack proposed Davidson al.'s (ACISP'19), which was claimed without noise flooding, adding large noise.

Language: Английский

---

Fast multiplication and the PLWE–RLWE equivalence for an infinite family of maximal real subfields of cyclotomic fields

Designs Codes and Cryptography, Journal Year: 2025, Volume and Issue: unknown

Published: April 7, 2025

Language: Английский

---

Conception of a Symmetric Fully Homomorphic Protocol Based on Gentry Scheme

Lecture notes in networks and systems, Journal Year: 2025, Volume and Issue: unknown, P. 302 - 307

Published: Jan. 1, 2025

Language: Английский

---

Encrypted Control Using Modified Learning with Errors-based Schemes

IFAC-PapersOnLine, Journal Year: 2024, Volume and Issue: 58(28), P. 72 - 77

Published: Jan. 1, 2024

Language: Английский

---