Implementation of Entropically Secure Encryption: Securing Personal Health Data

• URL: http://arxiv.org/abs/2404.16857v1
• Date: Thu, 4 Apr 2024 12:07:33 GMT
• Title: Implementation of Entropically Secure Encryption: Securing Personal Health Data
• Authors: Mehmet Hüseyin Temel, Boris Skoric, Idelfonso Tafur Monroy,
• Abstract summary: Entropically Secure Encryption (ESE) offers unconditional security with shorter keys to the One-Time Pad. We present the first implementation of ESE for bulk encryption.
• Score: 0.704590071265998
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Entropically Secure Encryption (ESE) offers unconditional security with shorter keys compared to the One-Time Pad. In this paper, we present the first implementation of ESE for bulk encryption. The main computational bottleneck for bulk ESE is a multiplication in a very large finite field. This involves multiplication of polynomials followed by modular reduction. We have implemented polynomial multiplication based on the gf2x library, with some modifications that avoid inputs of vastly different length, thus improving speed. Additionally, we have implemented a recently proposed efficient reduction algorithm that works for any polynomial degree. We investigate two use cases: X-ray images of patients and human genome data. We conduct entropy estimation using compression methods whose results determine the key lengths required for ESE. We report running times for all steps of the encryption. We discuss the potential of ESE to be used in conjunction with Quantum Key Distribution (QKD), in order to achieve full information-theoretic security of QKD-protected links for these use cases.

Related papers

• Three-Input Ciphertext Multiplication for Homomorphic Encryption [6.390468088226496]
  Homomorphic encryption (HE) allows computations directly on ciphertexts. HE is essential to privacy-preserving computing, such as neural network inference, medical diagnosis, and financial data analysis. This paper proposes 3-input ciphertext multiplication to reduce complexity of computations.
  arXiv  Detail & Related papers  (2024-10-17T13:40:49Z)
• Quantum Fast Implementation of Functional Bootstrapping and Private Information Retrieval [1.6319731389952283]
  We show that employing a single quantum computation server can significantly enhance both the efficiency and security of privacy-preserving techniques. We propose an efficient quantum algorithm for functional bootstrapping of large plaintexts. Our extension are quantum-based cryptographic tools that may gain dramatic speedups.
  arXiv  Detail & Related papers  (2024-09-30T10:49:18Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• HElium: A Language and Compiler for Fully Homomorphic Encryption with Support for Proxy Re-Encryption [2.2497737056372666]
  homomorphic encryption (FHE) can enable privacy-preserving analysis. FHE adds a large amount of computational overhead and its efficient use requires a high level of expertise. We propose HElium, the first optimizing FHE with native support for proxy re-encryption.
  arXiv  Detail & Related papers  (2023-12-21T19:07:21Z)
• Homomorphic Polynomial Public Key Cryptography for Quantum-secure Digital Signature [0.7864304771129751]
  In their 2022 study, Kuang et al. introduced Multivariable Polynomial Public Key (MPPK) cryptography. They extended MPPK into Homomorphic Polynomial Public Key (HPPK), employing homomorphic encryption for large hidden ring operations.
  arXiv  Detail & Related papers  (2023-11-15T13:54:23Z)
• SOCI^+: An Enhanced Toolkit for Secure OutsourcedComputation on Integers [50.608828039206365]
  We propose SOCI+ which significantly improves the performance of SOCI. SOCI+ employs a novel (2, 2)-threshold Paillier cryptosystem with fast encryption and decryption as its cryptographic primitive. Compared with SOCI, our experimental evaluation shows that SOCI+ is up to 5.4 times more efficient in computation and 40% less in communication overhead.
  arXiv  Detail & Related papers  (2023-09-27T05:19:32Z)
• 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)
• 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)
• Recovering AES Keys with a Deep Cold Boot Attack [91.22679787578438]
  Cold boot attacks inspect the corrupted random access memory soon after the power has been shut down. In this work, we combine a novel cryptographic variant of a deep error correcting code technique with a modified SAT solver scheme to apply the attack on AES keys. Our results show that our methods outperform the state of the art attack methods by a very large margin.
  arXiv  Detail & Related papers  (2021-06-09T07:57:01Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Quantum Fully Homomorphic Encryption by Integrating Pauli One-time Pad with Quaternions [4.182969308816531]
  Quantum fully homomorphic encryption (QFHE) allows to evaluate quantum circuits on encrypted data. We present a novel QFHE scheme, which extends Pauli one-time pad encryption by relying on the quaternion of SU(2).
  arXiv  Detail & Related papers  (2020-12-08T04:54:02Z)

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.