Post-Quantum Cryptography Key Expansion Method and Anonymous Certificate Scheme Based on NTRU

• URL: http://arxiv.org/abs/2601.07841v1
• Date: Fri, 02 Jan 2026 00:18:54 GMT
• Title: Post-Quantum Cryptography Key Expansion Method and Anonymous Certificate Scheme Based on NTRU
• Authors: Abel C. H. Chen,
• Abstract summary: NTRU is one of the important lattice-based post-quantum cryptography methods.<n>This study proposes an NTRU-based key expansion method that enables efficient public key expansion.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: NTRU is one of the important lattice-based post-quantum cryptography methods, offering resistance against quantum computing attacks. However, a drawback of NTRU lies in its relatively low efficiency in generating key pairs. Therefore, this study proposes an NTRU-based key expansion method that enables efficient public key expansion. Furthermore, the proposed method is applied to an anonymous certificate scheme, allowing an end entity to generate a key pair only once, after which the certificate authority can expand multiple distinct public keys for anonymity. The experimental results demonstrate that the proposed key expansion method achieves significantly higher efficiency than key pair generation.

Related papers

• Wrangling Entropy: Next-Generation Multi-Factor Key Derivation, Credential Hashing, and Credential Generation Functions [47.715495058757824]
  We present a novel cryptanalytic technique designed to reveal pernicious leaks of entropy across multiple invocations of a cryptographic key derivation or hash function.<n>We show that it can be used to correctly identify each of the known vulnerabilities in the original MFKDF construction.<n>We propose a new construction for MFKDF2,'' a next-generation multi-factor key derivation function that can be proven to be end-to-end secure.
  arXiv  Detail & Related papers  (2025-09-07T02:01:53Z)
• 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)
• 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)
• Secure Composition of Quantum Key Distribution and Symmetric Key Encryption [3.6678562499684517]
  Quantum key distribution (QKD) allows Alice and Bob to share a secret key over an insecure channel with proven information-theoretic security against an adversary whose strategy is bounded only by the laws of physics.<n>We consider the problem of using the QKD established key with a secure symmetric key-based encryption algorithm and use an approach based on hybrid encryption to provide a proof of security for the composition.
  arXiv  Detail & Related papers  (2025-01-14T20:58:02Z)
• A Key Encapsulation Mechanism from Low Density Lattice Codes [0.0]
  Key Encapsulation Mechanisms (KEMs) are a set of cryptographic techniques that are designed to provide symmetric encryption key using asymmetric mechanism (public key)<n>This paper focuses on design and analysis of key encapsulation mechanism from low density lattice codes (KEM-LDLC) to go down the key size by keeping an acceptable level of security.
  arXiv  Detail & Related papers  (2024-12-06T11:56:25Z)
• Quantum-Safe Hybrid Key Exchanges with KEM-Based Authentication [2.102973349909511]
  In PQCrypto 2023, Bruckner, Ramacher and Striecks proposed a novel hybrid AKE (HAKE) protocol, dubbed Muckle+.<n>Muckle# uses post-quantum key-encapsulating mechanisms for implicit authentication inspired by recent works in the area of Transport Layer Security (TLS) protocols.
  arXiv  Detail & Related papers  (2024-11-06T16:28:17Z)
• 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)
• Experimental anonymous quantum conferencing [72.27323884094953]
  We experimentally implement the AQCKA task in a six-user quantum network using Greenberger-Horne-Zeilinger (GHZ)-state entanglement. We also demonstrate that the protocol retains an advantage in a four-user scenario with finite key effects taken into account.
  arXiv  Detail & Related papers  (2023-11-23T19:00:01Z)
• 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)
• MDERank: A Masked Document Embedding Rank Approach for Unsupervised Keyphrase Extraction [41.941098507759015]
  Keyphrases are phrases in a document providing a concise summary of core content, helping readers to understand what the article is talking about in a minute. We propose a novel unsupervised keyword extraction method by leveraging the BERT-based model to select and rank candidate keyphrases with a MASK strategy.
  arXiv  Detail & Related papers  (2021-10-13T11:29:17Z)
• Tight finite-key analysis for generalized high-dimensional quantum key distribution [23.578892457164933]
  We propose a tight finite-key analysis suitable for generalized high-dimensional quantum key distribution protocols. Benefitting from our theory, high-dimensional quantum key distribution protocols with finite resources become experimentally feasible.
  arXiv  Detail & Related papers  (2020-08-08T12:33:53Z)

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.