EFPIX: A zero-trust encrypted flood protocol

• URL: http://arxiv.org/abs/2509.08248v1
• Date: Wed, 10 Sep 2025 03:06:42 GMT
• Title: EFPIX: A zero-trust encrypted flood protocol
• Authors: Arin Upadhyay,
• Abstract summary: We propose a flood-based relay communication protocol that achieves end-to-end encryption, plausible deniability for users, and untraceable messages.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a flood-based relay communication protocol that achieves end-to-end encryption, plausible deniability for users, and untraceable messages. It is resistant to changes in topology and infrastructure failures. It is also designed to hide metadata, such as sender and receiver, from those not involved.

Related papers

• Integrity from Algebraic Manipulation Detection in Trusted-Repeater QKD Networks [0.745554610293091]
  Quantum Key Distribution (QKD) allows secure communication without relying on computational assumptions.<n>We present the first protocol that provably provides both confidentiality and integrity.
  arXiv  Detail & Related papers  (2026-01-20T15:44:56Z)
• Transcript Franking for Encrypted Messaging [14.460663943390266]
  We introduce transcript franking, a new type of protocol that allows reporting subsets of conversations.<n>We define syntax, semantics, and security for transcript franking in two-party and group messaging.
  arXiv  Detail & Related papers  (2025-07-25T15:50:42Z)
• Secure Quantum Relay Networks Using Distributed Entanglement without Classical Authentication [0.0]
  Current quantum communication protocols rely heavily on classical authentication for message origin verification.<n>We propose a novel framework for secure quantum relay networks that completely avoids classical authentication.
  arXiv  Detail & Related papers  (2025-07-07T20:25:10Z)
• Enhancing Privacy in Semantic Communication over Wiretap Channels leveraging Differential Privacy [51.028047763426265]
  Semantic communication (SemCom) improves transmission efficiency by focusing on task-relevant information.<n> transmitting semantic-rich data over insecure channels introduces privacy risks.<n>This paper proposes a novel SemCom framework that integrates differential privacy mechanisms to protect sensitive semantic features.
  arXiv  Detail & Related papers  (2025-04-23T08:42:44Z)
• Attacking and Improving the Tor Directory Protocol [14.733204402684215]
  The Tor network enhances clients' privacy by routing traffic through an overlay network of volunteered intermediate relays.<n>The protocol is expected to be secure even when a minority of those authorities get compromised.<n>The current consensus protocol is flawed, allowing only a single compromised authority to create a valid consensus document with malicious relays.
  arXiv  Detail & Related papers  (2025-03-24T05:04:41Z)
• 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)
• Secure Semantic Communication via Paired Adversarial Residual Networks [59.468221305630784]
  This letter explores the positive side of the adversarial attack for the security-aware semantic communication system. A pair of matching pluggable modules is installed: one after the semantic transmitter and the other before the semantic receiver. The proposed scheme is capable of fooling the eavesdropper while maintaining the high-quality semantic communication.
  arXiv  Detail & Related papers  (2024-07-02T08:32:20Z)
• Physical Layer Deception with Non-Orthogonal Multiplexing [52.11755709248891]
  We propose a novel framework of physical layer deception (PLD) to actively counteract wiretapping attempts.<n>PLD combines PLS with deception technologies to actively counteract wiretapping attempts.<n>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)
• Bytes to Schlep? Use a FEP: Hiding Protocol Metadata with Fully Encrypted Protocols [2.225268436173329]
  Fully Encrypted Protocols (FEPs) produce messages that appear completely random. FEPs have relevance well beyond censorship circumvention, as protecting protocol metadata has security and privacy benefits. We provide novel security definitions that capture the metadata-protection goals of FEPs.
  arXiv  Detail & Related papers  (2024-05-22T03:05:33Z)
• Tamper-Evident Pairing [55.2480439325792]
  Tamper-Evident Pairing (TEP) is an improvement of the Push-Button configuration (PBC) standard. TEP relies on the Tamper-Evident Announcement (TEA), which guarantees that an adversary can neither tamper a transmitted message without being detected, nor hide the fact that the message has been sent. This paper provides a comprehensive overview of the TEP protocol, including all information needed to understand how it works.
  arXiv  Detail & Related papers  (2023-11-24T18:54:00Z)
• Vulnerabilities of Deep Learning-Driven Semantic Communications to Backdoor (Trojan) Attacks [70.51799606279883]
  This paper highlights vulnerabilities of deep learning-driven semantic communications to backdoor (Trojan) attacks. Backdoor attack can effectively change the semantic information transferred for poisoned input samples to a target meaning. Design guidelines are presented to preserve the meaning of transferred information in the presence of backdoor attacks.
  arXiv  Detail & Related papers  (2022-12-21T17:22:27Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)

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.