Constructing a fully homomorphic encryption scheme with the Yoneda Lemma

• URL: http://arxiv.org/abs/2401.13255v4
• Date: Wed, 05 Feb 2025 05:25:18 GMT
• Title: Constructing a fully homomorphic encryption scheme with the Yoneda Lemma
• Authors: Rémy Tuyéras,
• Abstract summary: The paper redefines the foundations of asymmetric cryptography's homomorphic cryptosystems through the application of the Yoneda Lemma. It demonstrates that widely adopted systems, including ElGamal, RSA, Benaloh, Regev's LWE, and NTRUEncrypt, are directly derived from the principles of the Yoneda Lemma. This synthesis leads to the creation of a holistic homomorphic encryption framework, the Yoneda Encryption Scheme.
• Score: 0.0
• License:
• Abstract: This paper redefines the foundations of asymmetric cryptography's homomorphic cryptosystems through the application of the Yoneda Lemma. It demonstrates that widely adopted systems, including ElGamal, RSA, Benaloh, Regev's LWE, and NTRUEncrypt, are directly derived from the principles of the Yoneda Lemma. This synthesis leads to the creation of a holistic homomorphic encryption framework, the Yoneda Encryption Scheme. Within this framework, encryption is modeled using the bijective maps of the Yoneda Lemma Isomorphism, with decryption following naturally from the properties of these maps. This unification suggests a conjecture for a unified model theory framework, offering a foundation for reasoning about both homomorphic and fully homomorphic encryption (FHE) schemes. As a practical demonstration, the paper introduces the FHE scheme ACES, which supports arbitrary finite sequences of encrypted multiplications and additions without relying on conventional bootstrapping techniques for ciphertext refreshment. This highlights the practical implications of the theoretical advancements and proposes a new approach for leveraging model theory and forcing techniques in cryptography, particularly in the design of FHE schemes.

Related papers

• Secure Semantic Communication With Homomorphic Encryption [52.5344514499035]
  This paper explores the feasibility of applying homomorphic encryption to SemCom. We propose a task-oriented SemCom scheme secured through homomorphic encryption.
  arXiv  Detail & Related papers  (2025-01-17T13:26:14Z)
• Homomorphic Encryption Based on Lattice Post-Quantum Cryptography [0.0]
  Homomorphic encryption methods are vulnerable to quantum computing attacks. This study proposes a lattice-based post-quantum homomorphic encryption scheme. The findings are intended to serve as a reference for developers of homomorphic encryption applications.
  arXiv  Detail & Related papers  (2024-12-23T05:30:44Z)
• The Evolution of Cryptography through Number Theory [55.2480439325792]
  cryptography began around 100 years ago, its roots trace back to ancient civilizations like Mesopotamia and Egypt. This paper explores the link between early information hiding techniques and modern cryptographic algorithms like RSA.
  arXiv  Detail & Related papers  (2024-11-11T16:27:57Z)
• CodeChameleon: Personalized Encryption Framework for Jailbreaking Large Language Models [49.60006012946767]
  We propose CodeChameleon, a novel jailbreak framework based on personalized encryption tactics. We conduct extensive experiments on 7 Large Language Models, achieving state-of-the-art average Attack Success Rate (ASR) Remarkably, our method achieves an 86.6% ASR on GPT-4-1106.
  arXiv  Detail & Related papers  (2024-02-26T16:35:59Z)
• QPP and HPPK: Unifying Non-Commutativity for Quantum-Secure Cryptography with Galois Permutation Group [0.0]
  We leverage two novel primitives: the Quantum Permutation Pad (QPP) for symmetric key encryption and the Homomorphic Polynomial Public Key (HPPK) for Key Encapsulation Mechanism (KEM) and Digital Signatures (DS) QPP achieves quantum-secure symmetric key encryption, seamlessly extending Shannon's perfect secrecy to both classical and quantum-native systems. HPPK, free from NP-hard problems, fortifies symmetric encryption for the plain public key.
  arXiv  Detail & Related papers  (2024-02-02T19:10:43Z)
• Lightweight Public Key Encryption in Post-Quantum Computing Era [0.0]
  Confidentiality in our digital world is based on the security of cryptographic algorithms. In the course of technological progress with quantum computers, the protective function of common encryption algorithms is threatened. Our concept describes the transformation of a classical asymmetric encryption method to a modern complexity class.
  arXiv  Detail & Related papers  (2023-11-24T21:06:42Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Categorical composable cryptography: extended version [1.1970409518725493]
  We formalize the simulation paradigm of cryptography in terms of category theory. We show that protocols secure against abstract attacks form a symmetric monoidal category. Our model is able to incorporate computational security, set-up assumptions and various attack models.
  arXiv  Detail & Related papers  (2022-08-28T15:07:00Z)
• A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
  We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography. In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
  arXiv  Detail & Related papers  (2022-05-07T03:15:15Z)
• Hidden Cosets and Applications to Unclonable Cryptography [15.248351992500078]
  We study a generalization of hidden subspace states to hidden coset states (first introduced by Aaronson and Christiano [STOC '12]). We explore unclonable properties of coset states and several applications.
  arXiv  Detail & Related papers  (2021-07-12T19:04:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.