Neural Networks Meet Elliptic Curve Cryptography: A Novel Approach to Secure Communication

• URL: http://arxiv.org/abs/2407.08831v1
• Date: Thu, 11 Jul 2024 19:34:16 GMT
• Title: Neural Networks Meet Elliptic Curve Cryptography: A Novel Approach to Secure Communication
• Authors: Mina Cecilie Wøien, Ferhat Ozgur Catak, Murat Kuzlu, Umit Cali,
• Abstract summary: The proposed approach explores the application of asymmetric cryptography within a neural network framework. It employs a set of five distinct cryptographic keys to examine the efficacy and robustness of communication security against eavesdropping attempts.
• Score: 0.8399688944263844
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In recent years, neural networks have been used to implement symmetric cryptographic functions for secure communications. Extending this domain, the proposed approach explores the application of asymmetric cryptography within a neural network framework to safeguard the exchange between two communicating entities, i.e., Alice and Bob, from an adversarial eavesdropper, i.e., Eve. It employs a set of five distinct cryptographic keys to examine the efficacy and robustness of communication security against eavesdropping attempts using the principles of elliptic curve cryptography. The experimental setup reveals that Alice and Bob achieve secure communication with negligible variation in security effectiveness across different curves. It is also designed to evaluate cryptographic resilience. Specifically, the loss metrics for Bob oscillate between 0 and 1 during encryption-decryption processes, indicating successful message comprehension post-encryption by Alice. The potential vulnerability with a decryption accuracy exceeds 60\%, where Eve experiences enhanced adversarial training, receiving twice the training iterations per batch compared to Alice and Bob.

Related papers

• Provably Secure Public-Key Steganography Based on Admissible Encoding [66.38591467056939]
  The technique of hiding secret messages within seemingly harmless covertext is known as provably secure steganography (PSS) PSS evolves from symmetric key steganography to public-key steganography, functioning without the requirement of a pre-shared key. This paper proposes a more general elliptic curve public key steganography method based on admissible encoding.
  arXiv  Detail & Related papers  (2025-04-28T03:42:25Z)
• Quantum stream cipher and Quantum block cipher -The Era of 100 Gbit/sec real-time encryption- [0.0]
  In the theory of cryptology, the Shannon impossibility theorem states that the upper bound of the security of a plaintext against a ciphertext-only attack is the entropy of the secret key. Such challenges have been attempted with quantum stream cipher and quantum data locking as block cipher. Both ciphers are designed by means of differentiating the receiving performance of Bob with key and Eve without key according to the principle of quantum communication theory.
  arXiv  Detail & Related papers  (2025-04-24T04:28:17Z)
• Cryptanalysis via Machine Learning Based Information Theoretic Metrics [58.96805474751668]
  We propose two novel applications of machine learning (ML) algorithms to perform cryptanalysis on any cryptosystem. These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem. We show that our classification model correctly identifies the encryption schemes that are not IND-CPA secure, such as DES, RSA, and AES ECB, with high accuracy.
  arXiv  Detail & Related papers  (2025-01-25T04:53:36Z)
• 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)
• Transformers -- Messages in Disguise [3.74142789780782]
  NN based cryptography is being investigated due to its ability to learn and implement random cryptographic schemes. R is comprised of three new NN layers: the (i) projection layer, (ii) inverse projection layer, and (iii) dot-product layer. This results in an ANC network that (i) is computationally efficient, (ii) ensures the encrypted message is unique, and (iii) does not induce any communication overhead.
  arXiv  Detail & Related papers  (2024-11-15T15:42:29Z)
• Physical Layer Deception with Non-Orthogonal Multiplexing [52.11755709248891]
  We propose a novel framework of physical layer deception (PLD) to actively counteract wiretapping attempts. PLD combines PLS with deception technologies to actively counteract wiretapping attempts. We prove the validity of the PLD framework with in-depth analyses and demonstrate its superiority over conventional PLS approaches.
  arXiv  Detail & Related papers  (2024-06-30T16:17:39Z)
• Bi-CryptoNets: Leveraging Different-Level Privacy for Encrypted Inference [4.754973569457509]
  We decompose the input data into sensitive and insensitive segments according to importance and privacy. The sensitive segment includes some important and private information such as human faces. We take strong homomorphic encryption to keep security, whereas the insensitive one contains some background and we add perturbations.
  arXiv  Detail & Related papers  (2024-02-02T10:35:05Z)
• Secure Deep-JSCC Against Multiple Eavesdroppers [13.422085141752468]
  We propose an end-to-end (E2E) learning-based approach for secure communication against multiple eavesdroppers. We implement deep neural networks (DNNs) to realize a data-driven secure communication scheme. Our experiments show that employing the proposed secure neural encoding can decrease the adversarial accuracy by 28%.
  arXiv  Detail & Related papers  (2023-08-05T14:40:35Z)
• Eavesdropper localization for quantum and classical channels via nonlinear scattering [58.720142291102135]
  Quantum key distribution (QKD) offers theoretical security based on the laws of physics. We present a novel approach to eavesdropper location that can be employed in quantum as well as classical channels. We demonstrate that our approach outperforms conventional OTDR in the task of localizing an evanescent outcoupling of 1% with cm precision inside standard optical fibers.
  arXiv  Detail & Related papers  (2023-06-25T21:06:27Z)
• Human-imperceptible, Machine-recognizable Images [76.01951148048603]
  A major conflict is exposed relating to software engineers between better developing AI systems and distancing from the sensitive training data. This paper proposes an efficient privacy-preserving learning paradigm, where images are encrypted to become human-imperceptible, machine-recognizable'' We show that the proposed paradigm can ensure the encrypted images have become human-imperceptible while preserving machine-recognizable information.
  arXiv  Detail & Related papers  (2023-06-06T13:41:37Z)
• 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)
• Perfectly Secure Steganography Using Minimum Entropy Coupling [60.154855689780796]
  We show that a steganography procedure is perfectly secure under Cachin 1998's information-theoretic model of steganography. We also show that, among perfectly secure procedures, a procedure maximizes information throughput if and only if it is induced by a minimum entropy coupling.
  arXiv  Detail & Related papers  (2022-10-24T17:40:07Z)
• Security and Privacy Enhanced Gait Authentication with Random Representation Learning and Digital Lockers [3.3549957463189095]
  Gait data captured by inertial sensors have demonstrated promising results on user authentication. Most existing approaches stored the enrolled gait pattern insecurely for matching with the pattern, thus, posed critical security and privacy issues. We present a gait cryptosystem that generates from gait data the random key for user authentication, meanwhile, secures the gait pattern.
  arXiv  Detail & Related papers  (2021-08-05T06:34:42Z)
• ESPN: Extremely Sparse Pruned Networks [50.436905934791035]
  We show that a simple iterative mask discovery method can achieve state-of-the-art compression of very deep networks. Our algorithm represents a hybrid approach between single shot network pruning methods and Lottery-Ticket type approaches.
  arXiv  Detail & Related papers  (2020-06-28T23:09:27Z)
• TEDL: A Text Encryption Method Based on Deep Learning [10.428079716944463]
  This paper proposes a novel text encryption method based on deep learning called TEDL. Results of experiments and relevant analyses show that TEDL performs well for security, efficiency, generality, and has a lower demand for the frequency of key redistribution.
  arXiv  Detail & Related papers  (2020-03-09T11:04:36Z)

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.