Post Quantum Cryptography (PQC) Signatures Without Trapdoors

• URL: http://arxiv.org/abs/2504.14016v1
• Date: Fri, 18 Apr 2025 18:10:17 GMT
• Title: Post Quantum Cryptography (PQC) Signatures Without Trapdoors
• Authors: William J Buchanan,
• Abstract summary: Some of our current public key methods use a trap door to implement digital signature methods.<n>The problem with a back-door is that the actual trap-door method could, in the end, be discovered.<n>With the rise of PQC, we will see a range of methods that will not use trap doors and provide stronger proof of security.
• Score: 0.5439020425819
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Some of our current public key methods use a trap door to implement digital signature methods. This includes the RSA method, which uses Fermat's little theorem to support the creation and verification of a digital signature. The problem with a back-door is that the actual trap-door method could, in the end, be discovered. With the rise of PQC (Post Quantum Cryptography), we will see a range of methods that will not use trap doors and provide stronger proof of security. In this case, we use hash-based signatures (as used with SPHINCS+) and Fiat Shamir signatures using Zero Knowledge Proofs (as used with Dilithium).

Related papers

• Anonymous Public-Key Quantum Money and Quantum Voting [15.80411915665245]
  We develop the formal definitions of privacy for quantum money schemes. We then construct the first public-key quantum money schemes that satisfy these security notions. We show that the no-cloning principle, a result of quantum mechanics, allows us to construct schemes, with security guarantees that are classically impossible.
  arXiv  Detail & Related papers  (2024-11-07T07:21:28Z)
• Relating Quantum Tamper-Evident Encryption to Other Cryptographic Notions [0.0]
  A quantum tamper-evident encryption scheme is a non-interactive symmetric-key encryption scheme mapping classical messages to quantum ciphertexts. This quantum cryptographic primitive was first introduced by Gottesman in 2003. We further our understanding of tamper-evident encryption by formally relating it to other cryptographic primitives in an information-theoretic setting.
  arXiv  Detail & Related papers  (2024-11-05T02:20:29Z)
• 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. 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)
• An Experimentally Validated Feasible Quantum Protocol for Identity-Based Signature with Application to Secure Email Communication [1.156080039774429]
  In 1984, Shamir developed the first Identity-based signature (IBS) to simplify public key infrastructure. IBS protocols rely on several theoretical assumption-based hard problems. Quantum cryptography (QC) is one such approach.
  arXiv  Detail & Related papers  (2024-03-27T04:32:41Z)
• Revocable Quantum Digital Signatures [57.25067425963082]
  We define and construct digital signatures with revocable signing keys from the LWE assumption. In this primitive, the signing key is a quantum state which enables a user to sign many messages. Once the key is successfully revoked, we require that the initial recipient of the key loses the ability to sign.
  arXiv  Detail & Related papers  (2023-12-21T04:10:07Z)
• Protecting Quantum Procrastinators with Signature Lifting: A Case Study in Cryptocurrencies [0.15346678870160887]
  This work deals with protecting quantum procrastinators: users that failed to migrate to post-quantum cryptography in time. We introduce a technique called signature lifting, that allows us to lift a deployed pre-quantum signature scheme satisfying a certain property to a post-quantum signature scheme that uses the same keys. We propose a modification, based on signature lifting, that can be applied in many cryptocurrencies for securely spending pre-quantum coins in presence of quantum adversaries.
  arXiv  Detail & Related papers  (2023-03-12T21:04:02Z)
• 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)
• Secure access system using signature verification over tablet PC [62.21072852729544]
  We describe a highly versatile and scalable prototype for Web-based secure access using signature verification. The proposed architecture can be easily extended to work with different kinds of sensors and large-scale databases.
  arXiv  Detail & Related papers  (2023-01-11T11:05:47Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41: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.