Multivariate Cryptography-Based Anonymous Certificate Scheme

• URL: http://arxiv.org/abs/2607.13554v1
• Date: Wed, 15 Jul 2026 07:57:49 GMT
• Title: Multivariate Cryptography-Based Anonymous Certificate Scheme
• Abstract summary: The US National Institute of Standards and Technology (NIST) has recommended the deprecation of certain elliptic curve cryptography (ECC) by 2030.<n>This study proposes a multivariate cryptography-based anonymous certificate scheme, aiming to design quantum-safe anonymous certificates suitable for privacy-sensitive application services.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As quantum computing technology continues to mature, the US National Institute of Standards and Technology (NIST) has outlined a migration timeline for Post-Quantum Cryptography (PQC), recommending the deprecation of certain elliptic curve cryptography (ECC) by 2030. Furthermore, privacy-sensitive application scenarios, such as vehicular communications, require the use of anonymous certificates. However, existing anonymous certificate schemes are still largely based on ECC. Therefore, this study proposes a multivariate cryptography-based anonymous certificate scheme, aiming to design quantum-safe anonymous certificates suitable for privacy-sensitive application services. The proposed multivariate cryptography-based anonymous certificate scheme is supported by rigorous mathematical proofs and illustrated with computational cases.

Related papers

• Pseudonym Scheme Based on Hybrid Certificates for Security Credential Management System in Vehicular Communications [14.260839001419612]
  This study proposes a hybrid certificate that combines the Elliptic-Curve Cryptography (ECC) with Post-Quantum Cryptography (PQC)<n>This design aims to eliminate the possibility of inferring any correlation between the public key in a certificate and that in an enrollment certificate.
  arXiv  Detail & Related papers  (2026-06-12T00:59:42Z)
• Efficient ML-DSA Public Key Management Method with Identity for PKI and Its Application [34.906142924769675]
  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.
  arXiv  Detail & Related papers  (2026-03-26T05:26:31Z)
• 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)
• A Comparative Study of Hybrid Post-Quantum Cryptographic X.509 Certificate Schemes [0.0]
  The U.S. National Institute of Standards and Technology finalized a series of Post-NIST (PQC) standards in August 2024.<n>The design of X.509 certificates that adhere to PQC standards has become a crucial focus in the development of certificate management systems.<n>Several hybrid certificate schemes have been proposed internationally based on the X.509 certificate format.
  arXiv  Detail & Related papers  (2025-10-30T21:51:36Z)
• Integration of quantum random number generators with post-quantum cryptography algorithms [33.72751145910978]
  Post-Quantum Cryptography (PQC) has become a potential solution to prolong the life of existing Public Key Infrastructure (PKI) systems.<n>PQC protocols depend on high-quality randomness for key generation and encapsulation procedures.<n>We demonstrate a proof-of-concept enabling the incorporation of Quantum Random Number Generation (QRNG) devices within communication networks using PQC-based Transport Layer Security (TLS)
  arXiv  Detail & Related papers  (2025-07-01T10:56:39Z)
• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• Provably Secure Public-Key Steganography Based on Admissible Encoding [66.38591467056939]
  The technique of hiding secret messages within seemingly harmless covertext is known as provably secure steganography (PSS)<n>PSS evolves from symmetric key steganography to public-key steganography, functioning without the requirement of a pre-shared key.<n>This paper proposes a more general elliptic curve public key steganography method based on admissible encoding.
  arXiv  Detail & Related papers  (2025-04-28T03:42:25Z)
• CryptoFormalEval: Integrating LLMs and Formal Verification for Automated Cryptographic Protocol Vulnerability Detection [41.94295877935867]
  We introduce a benchmark to assess the ability of Large Language Models to autonomously identify vulnerabilities in new cryptographic protocols. We created a dataset of novel, flawed, communication protocols and designed a method to automatically verify the vulnerabilities found by the AI agents.
  arXiv  Detail & Related papers  (2024-11-20T14:16:55Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.<n>This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Post-Quantum Cryptography Anonymous Scheme -- PQCWC: Post-Quantum Cryptography Winternitz-Chen [0.0]
  Post-quantum cryptographic algorithms are primarily based on lattice-based and hash-based cryptography. This study proposes the Post-Quantum Cryptography Winternitz-Chen (PQCWC) anonymous scheme.
  arXiv  Detail & Related papers  (2024-09-20T00:14:20Z)
• X.509 Information Security Certification Based on Post-Quantum Cryptography [0.0]
  This study explores X.509 security certificates based on Post-Quantum Cryptography (PQC) This study compares mainstream asymmetric cryptographic methods with standard PQC methods. recommendations for a solution based on PQC for X.509 security certificates are proposed.
  arXiv  Detail & Related papers  (2024-08-05T01:38:36Z)
• 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)
• PQCMC: Post-Quantum Cryptography McEliece-Chen Implicit Certificate Scheme [0.0]
  This study proposes a post-quantum cryptography McEliece-Chen (PQCMC) based on an efficient random invertible matrix generation method to issue pseudonymous certificates with less time. This study demonstrates the viability of the implicit certificate scheme based on PQC as a means of countering quantum computing threats.
  arXiv  Detail & Related papers  (2024-01-03T13:34:20Z)

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.