PoEW:Encryption as Consensus and Enabling Data Compression Services?

• URL: http://arxiv.org/abs/2603.07632v1
• Date: Sun, 08 Mar 2026 13:37:09 GMT
• Title: PoEW:Encryption as Consensus and Enabling Data Compression Services?
• Abstract summary: This paper introduces Proof-of-Encryption-Work (PoEW)<n>PoEW is a novel PoW consensus mechanism that repurposes computational power to address the challenge of encryption-based data compression.
• Score: 0.05640465626775259
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Proof-of-Work (PoW) is a fundamental method in decen- tralized digital networks for establishing consensus on a shared ledger. By requiring network participants to solve a mathematical puzzle, PoW maintains network integrity. However, PoW has raised environmental concerns due to its significant energy consumption. This paper introduces Proof-of-Encryption-Work (PoEW), a novel PoW consensus mechanism that repurposes computational power to address the challenge of encryption-based data compression. PoEW uses an ex- haustive key search as the PoW puzzle. Given a lengthy plaintext and a fixed ciphertext, the corresponding key is derived. Since the plain- text is much longer than both the key and the ciphertext, this process compresses the plaintext to the key. This data compression is computa- tionally intensive, while decompression is straightforward.

Related papers

• A Survey on Deep Text Hashing: Efficient Semantic Text Retrieval with Binary Representation [69.50397417361351]
  Text hashing projects original texts into compact binary hash codes.<n>Deep text hashing has demonstrated significant advantages over traditional, data-independent hashing techniques.<n>This survey investigates current deep text hashing methods by categorizing them based on their core components.
  arXiv  Detail & Related papers  (2025-10-31T06:51:37Z)
• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• 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.<n>Such challenges have been attempted with quantum stream cipher and quantum data locking as block cipher.<n>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)
• Secure Semantic Communication With Homomorphic Encryption [52.5344514499035]
  This paper explores the feasibility of applying homomorphic encryption to SemCom.<n>We propose a task-oriented SemCom scheme secured through homomorphic encryption.
  arXiv  Detail & Related papers  (2025-01-17T13:26:14Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.<n>This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• HE is all you need: Compressing FHE Ciphertexts using Additive HE [29.043858170208875]
  Homomorphic Encryption (HE) is a commonly used tool for building privacy-preserving applications. We present a new compression technique that uses an additive homomorphic encryption scheme with small ciphertexts to compress large homomorphic ciphertexts.
  arXiv  Detail & Related papers  (2023-03-16T02:28:40Z)
• Digest of Quantum Stream Cipher based on Holevo-Yuen Theory [0.0]
  This paper introduces an overview and a back ground of our paper that is entitled Quantum stream cipher based on Holevo-Yuen theory. Around 2000, a new quantum stream cipher was proposed as a technique to challenge the possibility of overcoming drawbacks of OTP in practical use.
  arXiv  Detail & Related papers  (2022-06-04T08:17:34Z)
• Deep Keyphrase Completion [59.0413813332449]
  Keyphrase provides accurate information of document content that is highly compact, concise, full of meanings, and widely used for discourse comprehension, organization, and text retrieval. We propose textitkeyphrase completion (KPC) to generate more keyphrases for document (e.g. scientific publication) taking advantage of document content along with a very limited number of known keyphrases. We name it textitdeep keyphrase completion (DKPC) since it attempts to capture the deep semantic meaning of the document content together with known keyphrases via a deep learning framework
  arXiv  Detail & Related papers  (2021-10-29T07:15:35Z)
• 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)
• A quantum encryption design featuring confusion, diffusion, and mode of operation [0.0]
  We propose a non-OTP quantum encryption scheme utilizing a quantum state creation process to encrypt messages. As essentially a non-OTP quantum block cipher the method stands out against existing methods with the following features.
  arXiv  Detail & Related papers  (2020-10-06T22:23:30Z)
• 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.