Efficient ML-DSA Public Key Management Method with Identity for PKI and Its Application
- URL: http://arxiv.org/abs/2603.25043v1
- Date: Thu, 26 Mar 2026 05:26:31 GMT
- Title: Efficient ML-DSA Public Key Management Method with Identity for PKI and Its Application
- Abstract summary: We propose a novel identity-based public key management framework for PKI based on post-quantum cryptography, termed textitIPK-pq.<n>Building on the concept of the Composite Public Key (CPK), textitIPK-pq addresses the linear collusion problem inherent in CPK through an enhanced identity mapping mechanism.<n>We provide a formal security proof for textitIPK-pq, covering both individual private key components and the composite private key.
- Score: 34.906142924769675
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: With the rapid evolution of the Industrial Internet of Things (IIoT), the boundaries and scale of the Internet are continuously expanding. Consequently, the limitations of traditional certificate-based Public Key Infrastructure (PKI) have become increasingly evident, particularly in scenarios requiring large-scale certificate storage, verification, and frequent transmission. These challenges are expected to be further amplified by the widespread adoption of post-quantum cryptography. In this paper, we propose a novel identity-based public key management framework for PKI based on post-quantum cryptography, termed \textit{IPK-pq}. This approach implements an identity key generation protocol leveraging NIST ML-DSA and random matrix theory. Building on the concept of the Composite Public Key (CPK), \textit{IPK-pq} addresses the linear collusion problem inherent in CPK through an enhanced identity mapping mechanism. Furthermore, it simplifies the verification of the declared public key's authenticity, effectively reducing the complexity associated with certificate-based key management. We also provide a formal security proof for \textit{IPK-pq}, covering both individual private key components and the composite private key. To validate our approach, formally, we directly implement and evaluate \textit{IPK-pq} within a typical PKI application scenario: Resource PKI (RPKI). Comparative experimental results demonstrate that an RPKI system based on \textit{IPK-pq} yields significant improvements in efficiency and scalability. These results validate the feasibility and rationality of \textit{IPK-pq}, positioning it as a strong candidate for next-generation RPKI systems capable of securely managing large-scale routing information.
Related papers
- Deploying and validating a metropolitan QKD secure network: architecture and field performance [76.02413102965598]
Quantum Key Distribution provides information-theoretic security for key establishment.<n>A metropolitan-scale quantum-secure network between data centers in Milan is reported.<n>Results establish the technical and operational readiness of metropolitan QKD networks for production deployment.
arXiv Detail & Related papers (2026-07-13T15:51:26Z) - The Capacity of Information-Theoretic Secure Aggregation in Federated Learning [38.64656884737012]
We study the $T$-colluding information-theoretic secure aggregation problem with $N$ users.<n>Unlike prior work, we model key distribution through user-to-user communication.<n>We show that the optimal performance can be achieved using only pairwise shared keys.
arXiv Detail & Related papers (2026-06-05T13:53:27Z) - Quantum-Resistant Networks: A Review of Primitives, Protocols and Best Practices [20.8561196053586]
Large-scale quantum computers threaten the public-key cryptographic foundations underpinning today's network security infrastructures.<n>This paper presents the first comprehensive systematization of PQ-resistant network architectures.
arXiv Detail & Related papers (2026-05-05T16:37:58Z) - Send the Key in Cleartext: Halving Key Consumption while Preserving Unconditional Security in QKD Authentication [59.664950447941386]
Quantum Key Distribution (QKD) protocols require Information-Theoretically Secure (ITS) authentication of the classical channel to preserve the unconditional security of the distilled key.<n>Since QKD requires mutual authentication, two independent one-time keys are typically consumed per round, imposing a non-trivial overhead on the net secure key rate.<n>We present a novel ITS authentication scheme based on $varepsilon$-Almost Strongly Universal$ ($varepsilon$-ASU$)
arXiv Detail & Related papers (2026-03-26T14:36:05Z) - Shaping a Quantum-Resistant Future: Strategies for Post-Quantum PKI [0.0]
We present the latest developments in selecting robust Post-Quantum algorithms.<n>Our contribution entails defining requirements for a secure transition to a quantum-resistant Public Key Infrastructure.
arXiv Detail & Related papers (2026-01-16T09:02:10Z) - Quantum Secure Biometric Authentication in Decentralised Systems [0.9347066036125967]
Centralised archi-tectures pose privacy and scalabil-ity challenges due to the aggregation of sensitive data.<n>This work proposes a quantum-secure communication protocol for decen-tralised biometric systems.
arXiv Detail & Related papers (2026-01-08T11:42:18Z) - Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
arXiv Detail & Related papers (2025-12-05T04:40:34Z) - Publicly Verifiable Private Information Retrieval Protocols Based on Function Secret Sharing [45.68069331331365]
Private Information Retrieval (PIR) is a cryptographic primitive that enables users to retrieve data from a database without revealing which item is being accessed.<n>We propose two effective constructions of publicly verifiable PIR (PVPIR) in the multi-server setting, which achieve query privacy, correctness, and verifiability simultaneously.
arXiv Detail & Related papers (2025-09-17T04:28:47Z) - On Post-Quantum Cryptography Authentication for Quantum Key Distribution [0.0]
Quantum Key Distribution (QKD) users authenticate themselves using pre-shared key material to join a quantum network.<n>Public Key Infrastructure (PKI) combined with Post-Quantum Cryptography (PQC) offers a more scalable solution.<n>Unlike traditional PKI, which relies on classical cryptographic algorithms such as RSA, the approach presented in this paper leverages PQC algorithms believed to be resistant to quantum attacks.
arXiv Detail & Related papers (2025-07-28T20:40:11Z) - Public-Key Quantum Authentication and Digital Signature Schemes Based on the QMA-Complete Problem [0.0]
We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur(QMA)-completeness of the consistency of local density matrices.<n>We provide a rigorous security analysis, proving the scheme's unforgeability against adaptive chosen-message attacks by quantum adversaries.
arXiv Detail & Related papers (2025-06-20T10:56:50Z) - A Scalable Framework for Post-Quantum Authentication in Public Key Infrastructures [0.0]
This work explores the performance and scalability of a hierarchical certificate authority framework with automated certificate issuance.<n>The system is designed for compatibility with both classical and PQC algorithms, promoting crypto-agility while ensuring robust security against quantum-based threats.
arXiv Detail & Related papers (2025-04-16T13:18:11Z) - Practical quantum secure direct communication with squeezed states [37.69303106863453]
We report the first table-top experimental demonstration of a CV-QSDC system and assess its security.<n>This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
arXiv Detail & Related papers (2023-06-25T19:23:42Z) - Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive
Privacy Analysis and Beyond [57.10914865054868]
We consider vertical logistic regression (VLR) trained with mini-batch descent gradient.
We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
arXiv Detail & Related papers (2022-07-19T05:47:30Z)
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.