Safecloud: A Distributed, Encrypted Storage Cloud for Streaming

• URL: http://arxiv.org/abs/2606.09870v1
• Date: Tue, 02 Jun 2026 02:12:42 GMT
• Title: Safecloud: A Distributed, Encrypted Storage Cloud for Streaming
• Abstract summary: We present Safecloud, a distributed, encrypted, self-pricing storage and streaming network.<n>Each file is split into chunks, encrypted on the owner's device, and distributed across Drops and Jets.<n>Only the owner, or an authorised grantee, can decrypt.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present Safecloud, a distributed, encrypted, self-pricing storage and streaming network whose storage and routing nodes never see plaintext and never hold keys. Each file is split into chunks, encrypted on the owner's device, and distributed across Drops (browser tabs storing ciphertext in IndexedDB) and Jets (federated routing servers). Only the owner, or an authorised grantee, can decrypt. We make five contributions: (1) A one-root key hierarchy: every key derives deterministically from a single root via HKDF, and owner and range-scoped grantee derive identical chunk keys (derivation agreement); a subtree key derives its range and nothing else (delegation containment). (2) Convergent content addressing: identical content yields identical ciphertext and identifiers, enabling deduplication without plaintext exposure, with identifiers binding authenticated ciphertext so a keyless Drop verifies integrity (blind verifiability). (3) Three parallel trees over one navigation path (Merkle for integrity, key-derivation for confidentiality, access for authorisation), with sound Merkle-verified retrieval. (4) The key tree doubles as a streaming index: a player derives each segment key in O(1), seeking by derivation, while parallel tracks (video, audio, captions) are independent subtrees unlockable per-track and per-segment, a combination we believe no prior encrypted-storage network offers. (5) Jets and Drops earn Safebux verifiably, kept honest by a one-signature proof-of-storage challenge under chilling-effect Proof-of-Corruption, a zero-sum economy that is significantly cheaper than Filecoin's proof-of-replication sealing (which is slow and provides no confidentiality). We give the architecture, cryptographic construction, a threat model, and an open-source reference implementation, stating precisely what is implemented versus designed.

Related papers

• Stealing Reasoning Traces from Proprietary LLM APIs [84.58379404903394]
  We develop a scalable decryption jailbreak for encrypted reasoning traces.<n>It circumvents anti-distillation mechanisms, allowing adversaries to extract a proprietary model's reasoning.<n>It inadvertently reveals hazardous information hidden within the reasoning process.
  arXiv  Detail & Related papers  (2026-08-10T17:24:50Z)
• snaproot: Decentralized File Integrity Verification Using Blockchain-Anchored Cryptographic Hashing [0.0]
  We present snaproot, a lightweight system that implements the hash-anchoring paradigm of Haber and Stornetta on the Solana blockchain.<n> snaproot generates a SHA-256 hash of a file and stores it immutably on-chain as a permanent reference record.<n>We present a formal threat model, a security analysis grounded in the second-preimage resistance of SHA-256, and an empirical evaluation on Solana Devnet across file sizes from 1 KB to 500 MB.
  arXiv  Detail & Related papers  (2026-06-09T09:25:49Z)
• VA-DAR: A PQC-Ready, Vendor-Agnostic Deterministic Artifact Resolution for Serverless, Enumeration-Resistant Wallet Recovery [1.7429038786735553]
  VA-DAR is a keyed-discovery protocol for ACE-GF-based wallets.<n>It supports cross-device recovery using only a user-provided identifier and a single recovery passphrase.
  arXiv  Detail & Related papers  (2026-03-03T07:33:10Z)
• MerkleSpeech: Public-Key Verifiable, Chunk-Localised Speech Provenance via Perceptual Fingerprints and Merkle Commitments [0.0]
  We propose MerkleSpeech, a system for public-key verifiable, chunk-localised speech provenance.<n>The system computes perceptual fingerprints over short speech chunks, commits them in a Merkle tree whose root is signed with an issuer key.<n>We present experiments targeting very low false positive rates under resampling, bandpass filtering, and additive noise.
  arXiv  Detail & Related papers  (2026-02-10T11:58:19Z)
• Enhancing Distributed Authorization With Lagrange Interpolation And Attribute-Based Encryption [0.7829352305480287]
  In todays security landscape, every user wants to access large amounts of data with confidentiality and authorization.<n>To access secure data, researchers use access control lists to grant authentication and provide authorization.<n>To cope with these two problems, we proposed multiparty execution on the server.
  arXiv  Detail & Related papers  (2025-12-25T06:26:14Z)
• Trustless Distributed Symmetric-key Encryption [0.6597195879147557]
  We focus on the symmetric-key setting, allowing both threshold encryption and threshold decryption. Previous work relies on the presence of a trusted third party. We propose to remove the requirement of a trusted third party by designing a dealer-free setup.
  arXiv  Detail & Related papers  (2024-08-28T20:56:30Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• 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)
• 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)
• HERS: Homomorphically Encrypted Representation Search [56.87295029135185]
  We present a method to search for a probe (or query) image representation against a large gallery in the encrypted domain. Our encryption scheme is agnostic to how the fixed-length representation is obtained and can therefore be applied to any fixed-length representation in any application domain.
  arXiv  Detail & Related papers  (2020-03-27T01:10:54Z)

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.