Metraipolis › archive › dc_795daf79f78b
A Commitment-Based Hybrid Post-Quantum Cryptographic Model for Multi-File Cloud Storage — arXiv:2608.13138
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.13138
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:26:16.876Z
- SHA-256 of the archived text
84b4190a48a5916b8a42e12a5b16df363b981784bcb6db9d69d1320a1aaebea6- Stable URL of this page
https://metraipolis.com/documento/dc_795daf79f78b
How to cite
A Commitment-Based Hybrid Post-Quantum Cryptographic Model for Multi-File Cloud Storage — arXiv:2608.13138 — arXiv (en), https://arxiv.org/abs/2608.13138 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_795daf79f78b (Metraipolis archive dc_795daf79f78b, sha256 84b4190a48a5916b8a42e12a5b16df363b981784bcb6db9d69d1320a1aaebea6)
BibTeX
@misc{dc795daf79f78b,
title = {A Commitment-Based Hybrid Post-Quantum Cryptographic Model for Multi-File Cloud Storage — arXiv:2608.13138},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.13138},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_795daf79f78b; sha256 84b4190a48a5916b8a42e12a5b16df363b981784bcb6db9d69d1320a1aaebea6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13138. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Cloud storage clients increasingly require authentication that remains secure against future quantum-capable adversaries, motivating hybrid constructions that combine classical primitives with standardized post-quantum alternatives. Extended naively to multi-file upload, such constructions incur a per-file lattice signing cost that dominates authentication time and becomes prohibitive at realistic batch sizes. This paper presents a commitment-based hybrid post-quantum model that addresses this bottleneck. It comprises AES-256-GCM bulk encryption, a hybrid X25519 with ML-KEM-768 key encapsulation mechanism, and a hybrid Ed25519 with ML-DSA-65 dual signature, computed over a SHA3-256 batch commitment. The commitment binds all ciphertexts in a batch to a single fixed-size digest that is signed once, reducing the number of post-quantum signature invocations per batch from n to one, independent of batch size; the remaining encryption and hashing is bounded by fast symmetric throughput. On a commodity client platform, averaged over 20 repetitions, this holds signing-phase time near-constant as the batch grows while the per-file baseline scales linearly. At n = 1000, the model reduces signing-phase time by factors of 629, 606, and 725 for 100 KB, 1 MB, and 10 MB files respectively, against a per-file dual-signing baseline sharing every other primitive. Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-08-14 in cs.CR). Categorie arXiv: Cryptography and Security (cs.CR). Pagina del lavoro: https://arxiv.org/abs/2608.13138 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T04:20:00.566Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).