AoNT Trap: Borromean-Entangled Mutable Chameleon Trapdoor Hash All-or-Nothing Stream Cipher

• URL: http://arxiv.org/abs/2608.18403v1
• Date: Wed, 19 Aug 2026 00:18:19 GMT
• Title: AoNT Trap: Borromean-Entangled Mutable Chameleon Trapdoor Hash All-or-Nothing Stream Cipher
• Abstract summary: This work introduces the Borromean-angled Chameleon Trapdoor Hash All-or-Nothing (AoNT) Stream Cipher (BEC-Trap)<n>BEC-Trap is a novel construction that merges Borromean interdependence, trapdoor-enabled mutability, and streaming encryption into a unified framework.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work introduces the Borromean-Entangled Chameleon Trapdoor Hash All-or-Nothing (AoNT) Stream Cipher (BEC-Trap), a novel construction that merges Borromean interdependence, trapdoor-enabled mutability, and streaming encryption into a unified framework. The (BEC-Trap) cipher links key (K), initialization vector (V ), and internal state (St) in a Borromean structure, ensuring that breaking, guessing, or removing any one component collapses the entire keystream, providing a computational (AoNT) interdependence under standard cryptographic assumptions. A chameleon trapdoor hash is integrated to permit controlled collisions, enabling seamless rekeying, (V ) refresh, and state rotation without resynchronizing endpoints. This design provides confidentiality, forward secrecy, and adaptive key management with low computational overhead, making it suitable for high-throughput secure messaging, IoT communications, and privacy-preserving blockchain channels. Security analysis of the (BEC-Trap) shows that the construction is resistant to key-recovery attacks, state compromise, and desynchronization attempts, delivering a robust cryptographic primitive for next-generation secure communications.

Related papers

• Pushing Forward Multi-Secret-Key Homomorphic Encryption for Private Average Aggregation [45.381652768314375]
  Homomorphic Encryption naturally fits the client--aggregator communication pattern of Federated Learning.<n>We propose lightweight multi-secret-key protocols for private average aggregation based on RLWE-based Homomorphic Encryption.<n>Our results show that the proposed approach substantially reduces ciphertext expansion and online cost, while preserving practical homomorphic aggregation performance.
  arXiv  Detail & Related papers  (2026-09-01T23:21:48Z)
• A Threshold Homomorphic Blockchain Architecture for Secure and Scalable IoT Sensor Data Aggregation [0.9059656093018312]
  This work introduces Phi-PHE-BC, a topology-aware homomorphic blockchain architecture for secure and privacy-preserving IoT sensor data aggregation.<n>Results across topology scaling, validator sensitivity, threshold decryption, and Byzantine-load experiments indicate that Phi-PHE-BC is a practical architecture for secure, privacy-preserving, and topology-aware IoT sensor aggregation.
  arXiv  Detail & Related papers  (2026-08-24T15:41:18Z)
• Privacy-Enhanced Zero-Order Federated Learning via xMK-CKKS over Wireless Channels [8.23636165923649]
  Homomorphic encryption (HE) enables privacy-preserving aggregation in federated learning (FL)<n>We propose a four-phase protocol that enables xMK-CKKS, a famous multi-key HE scheme, aggregation over a shared wireless channel without channel estimation.
  arXiv  Detail & Related papers  (2026-05-28T15:56:43Z)
• An Efficient and Privacy-Preserving Architecture for Cross-Institutional Collaborative RAG [35.62196578084403]
  Retrieval-Augmented Generation empowers LLMs with external knowledge.<n>Strict privacy regulations create severe "data silos" that obstruct such collaboration.<n>We present FedRAG, a high- throughput, privacy-preserving federated RAG framework.
  arXiv  Detail & Related papers  (2026-05-25T11:18:19Z)
• Compiling Activation Steering into Weights via Null-Space Constraints for Stealthy Backdoors [48.881343993730844]
  Safety-aligned large language models (LLMs) are increasingly deployed in real-world pipelines.<n> adversaries can distribute backdoored checkpoints that behave normally under standard evaluation but jailbreak when a hidden trigger is present.<n>Recent post-hoc weight-editing methods offer an efficient approach to injecting such backdoors.
  arXiv  Detail & Related papers  (2026-04-14T06:48:33Z)
• QLink: Quantum-Safe Bridge Architecture for Blockchain Interoperability [0.0]
  QLink is a quantum-safe Layer 3 interoperability protocol.<n>It integrates postquantum cryptography (PQC) quantum key distribution (QKD) and hardware security modules (HSMs)<n>QLink establishes a practical and future-proof pathway for blockchain interoperability.
  arXiv  Detail & Related papers  (2025-12-20T19:54:30Z)
• A Hybrid Chaos-Based Cryptographic Framework for Post-Quantum Secure Communications [2.474908349649168]
  We present CryptoChaos, a novel hybrid cryptographic framework that synergizes deterministic chaos theory with cutting-edge cryptographic primitives to achieve robust, post-quantum resilient encryption.<n> CryptoChaos harnesses the intrinsic unpredictability of four discrete chaotic maps to generate a high-entropy, multidimensional key from a unified entropy pool.
  arXiv  Detail & Related papers  (2025-04-11T15:24:21Z)
• Privacy Enhanced QKD Networks: Zero Trust Relay Architecture based on Homomorphic Encryption [0.0]
  Quantum key distribution (QKD) enables unconditionally secure symmetric key exchange between parties.<n>Traditional solutions rely on trusted relay nodes, which perform intermediate re-encryption of keys using one-time pad (OTP) encryption.<n>We propose a zero-trust relay design that applies fully homomorphic encryption (FHE) to perform intermediate OTP re-encryption.
  arXiv  Detail & Related papers  (2025-03-21T10:20:06Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• 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)
• 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)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Stream privacy amplification for quantum cryptography [1.3535770763481902]
  Existing security proofs require accumulating a large number of raw key bits for privacy amplification. By modifying the security proof based on quantum error correction, we develop a stream privacy amplification scheme. This scheme can output the final key in a stream way, prevent error from spreading, and hence can put privacy amplification before information reconciliation.
  arXiv  Detail & Related papers  (2021-11-28T11:19:09Z)

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.