HexE -- Securing Audio Contents in Voice Chat using Puzzle and Timestamp

• URL: http://arxiv.org/abs/2401.00765v1
• Date: Mon, 1 Jan 2024 14:10:31 GMT
• Title: HexE -- Securing Audio Contents in Voice Chat using Puzzle and Timestamp
• Authors: Aadhitya A,
• Abstract summary: "HexE" aims to create a puzzle-based algorithm which would encrypt and decrypt the audio files. The algorithm works on an NxN SuDoKu-based puzzle which is accepted both by the sender and receiver.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Cryptography is the study of securing information. It is the physical process that scrambles the information by rearrangement and substitution of content, so that it becomes difficult for anyone to understand. In today's world, security has become an inevitable part of our day-to-day life, right from normal browsing to performing critical payment transactions. Hackers work endlessly to break the security present in the apps/websites on which we perform day-to-day operations and salvage valuable information. Because of this, many illegal activities have taken place which affect the user. One such illegal activity is tapping the voice communication between two users. If left unencrypted, the communication between the users is compromised, thereby causing issues. One way to prevent this act is to encrypt the audio in that the contents cannot have tampered with unless the receiver has the valid key to decrypt it. The proposed solution termed "HexE" aims to create a puzzle-based algorithm which would encrypt and decrypt the audio files without manipulating the file header, thus securing the contents. The algorithm works on an NxN SuDoKu-based puzzle which is accepted both by the sender and receiver. Using the timestamp of the event (UNIX based), a grid from the puzzle is chosen which in turn will act as the key for both encryption and decryption. If the timestamp is slightly adjusted, the process will end up in failure during decryption, thus ensuring confidentiality. Another approach to secure the audio files is to implement IPFS (Inter Planetary File System) alongside the puzzle algorithm in which the encrypted audio is stored on it and the receiver can fetch the audio provided if the valid IPFS Hash of the file is present. In this way, the audio file is secured.

Related papers

• Mixing Algorithm for Extending the Tiers of the Unapparent Information Send through the Audio Streams [0.0]
  Secrecy and efficiency can be obtained through steganographic involvement. This paper analyzes and proposes a way out according to the performance based on robustness, security, and hiding capacity.
  arXiv  Detail & Related papers  (2025-02-18T05:08:45Z)
• Sound Conveyors for Stealthy Data Transmission [0.0]
  This study is conducted to hide information in an audio file. This implementation aims to hide a document such as txt, doc, and pdf file formats in an audio file and retrieve the hidden document when necessary. The system supports AES encryption and tolerates both wave and MP3 files.
  arXiv  Detail & Related papers  (2025-02-16T04:02:56Z)
• 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)
• Understanding crypter-as-a-service in a popular underground marketplace [51.328567400947435]
  Crypters are pieces of software whose main goal is to transform a target binary so it can avoid detection from Anti Viruses (AVs) applications. The crypter-as-a-service model has gained popularity, in response to the increased sophistication of detection mechanisms. This paper provides the first study on an online underground market dedicated to crypter-as-a-service.
  arXiv  Detail & Related papers  (2024-05-20T08:35:39Z)
• RiDDLE: Reversible and Diversified De-identification with Latent Encryptor [57.66174700276893]
  This work presents RiDDLE, short for Reversible and Diversified De-identification with Latent Encryptor. Built upon a pre-learned StyleGAN2 generator, RiDDLE manages to encrypt and decrypt the facial identity within the latent space.
  arXiv  Detail & Related papers  (2023-03-09T11:03:52Z)
• 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)
• ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment [90.60126724503662]
  ByzSecAgg is an efficient secure aggregation scheme for federated learning. ByzSecAgg is protected against Byzantine attacks and privacy leakages.
  arXiv  Detail & Related papers  (2023-02-20T11:15:18Z)
• Quantum Advantage in Cryptography [4.847980206213335]
  Quantum cryptography allows us to build communication schemes whose secrecy relies on the laws of physics. This article provides an overview of the principles and state of the art of quantum cryptography.
  arXiv  Detail & Related papers  (2022-06-08T18:00:03Z)
• SISA: Securing Images by Selective Alteration [0.0]
  We present a comparative analysis of the partial and full encryption of the photos. Instead of encrypting or blurring the entire photograph, we only encode selected regions of the image. We leverage the machine learning algorithms like Mask-RCNN and YOLO to select the region of interest.
  arXiv  Detail & Related papers  (2021-06-20T05:31:47Z)
• 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)
• Homomorphically Encrypted Linear Contextual Bandit [39.5858373448478]
  Contextual bandit is a framework for online learning in sequential decision-making problems. We introduce a privacy-preserving bandit framework based on asymmetric encryption. We show that despite the complexity of the setting, it is possible to learn over encrypted data.
  arXiv  Detail & Related papers  (2021-03-17T21:49:21Z)

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.