A Multiple User Cryptography Approach Using a One-Time User Key Model and a (1, n) Threshold Polynomial Secret Sharing
Cryptography · 14.04.2026 · 10 (2) · 26
DOI: 10.3390/cryptography10020026 ↗Kurz gefasst
Fachartikel in der Zeitschrift Cryptography, online erschienen am 14.04.2026. Verfasst von Alessandro Caniglia und 4 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: European Union-Next Generation EU, Project “European Digital Innovation Hub for Secure Digital Transformation EDIH4DT”-Next Generation EU, Italian Presidenza del Consiglio dei Ministri, Patti Territoriali per l’alta formazione delle imprese.
Abstract (Originalsprache)
Classical approaches to cryptography exhibit several limitations when applied to scenarios involving more than two users. The One-Time User Key (OTUK) meta-cryptographic model addresses these limitations by enabling multi-user encryption that is flexible, applicable to any cryptographic algorithm, and designed for systematic deployment without compromising system security. Each user possesses an individual key from which One-Time keys are derived; these keys feed a secret-sharing function (ω) that establishes the multi-user encrypted channel. In this paper, we present a polynomial-based implementation of the ω function under a (1,n) threshold model. The generated polynomial has roots at points corresponding to valid user keys and is mapped to the real encryption key. We provide a formal threat model, pseudocode for the complete protocol, and a detailed computational analysis across the numerical domains N, Z, and R. Furthermore, we present experimental benchmarks measuring encryption/decryption speed, scalability up to 30 users, parameter sensitivity, and a comparative evaluation against Shamir’s Secret Sharing scheme. A systematic security analysis examines partial-information attacks, derivative-root distance margins, and brute-force resistance, demonstrating that the effective security margin remains above 245 bits for configurations of up to 30 users with 256-bit keys. The proposed method offers a concrete, efficient, and secure foundation for multi-user encrypted communication in domains such as IoT, public administration, and e-health.
Förderung
- European Union-Next Generation EU
- Project “European Digital Innovation Hub for Secure Digital Transformation EDIH4DT”-Next Generation EU
- Italian Presidenza del Consiglio dei Ministri, Patti Territoriali per l’alta formazione delle imprese
- “Patto: Sistema Universitario Pugliese – Open Apulian University”
Zitieren
APA
Caniglia, A., Franchini, F., Galantucci, S., Pirlo, G., & Semeraro, G. (2026). A Multiple User Cryptography Approach Using a One-Time User Key Model and a (1, n) Threshold Polynomial Secret Sharing. Cryptography, 10(2), 26. https://doi.org/10.3390/cryptography10020026
Vancouver
Caniglia A, Franchini F, Galantucci S, Pirlo G, Semeraro G. A Multiple User Cryptography Approach Using a One-Time User Key Model and a (1, n) Threshold Polynomial Secret Sharing. Cryptography. 2026;10(2):26. doi:10.3390/cryptography10020026
BibTeX
@article{Caniglia2026,
author = {Caniglia, Alessandro and Franchini, Felice and Galantucci, Stefano and Pirlo, Giuseppe and Semeraro, Gianfranco},
title = {A Multiple User Cryptography Approach Using a One-Time User Key Model and a (1, n) Threshold Polynomial Secret Sharing},
journal = {Cryptography},
year = {2026},
volume = {10},
number = {2},
pages = {26},
doi = {10.3390/cryptography10020026}
}
EUVIMED