A Gentle Introduction to Blind signatures: From RSA to Lattice-based Cryptography
- URL: http://arxiv.org/abs/2509.02189v1
- Date: Tue, 02 Sep 2025 10:57:41 GMT
- Title: A Gentle Introduction to Blind signatures: From RSA to Lattice-based Cryptography
- Authors: Aditya Bhardwaj, Péter Kutas,
- Abstract summary: In a blind signature scheme, the user blinds their message before sending it to the signer, who signs the blinded message.<n>The user then unblinds the signed message to obtain a valid signature that can be verified publicly.<n>This work aims to thoroughly review the background of lattice-based blind signatures.
- Score: 1.1151919978983578
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Blind signatures were first introduced by David Chaum. They allow a user to have a message signed by a signer without revealing the message itself. This property is particularly useful in applications such as electronic voting and digital cash, where user anonymity is important. In a blind signature scheme, the user blinds their message before sending it to the signer, who signs the blinded message. The user then unblinds the signed message to obtain a valid signature that can be verified publicly, ensuring that the signer cannot trace the signed message back to the original unblinded version. A good analogy is placing the message inside an envelope and having the envelope signed. Once the envelope is opened, the signature remains valid for the enclosed message, ensuring that the content remains confidential. Such constructions provide anonymity and privacy to the user but given a practical quantum computer, the security of traditional crypto-systems providing such features will be broken. To address this, the development of quantum-resistant cryptographic protocols is essential for maintaining the security of digital transactions and data. Aligning with the same goal, this work aims to thoroughly review the background of lattice-based blind signatures. We start with the foundations of digital signatures in the classical settings and then move on to lattice-based constructions.
Related papers
- Adapter Shield: A Unified Framework with Built-in Authentication for Preventing Unauthorized Zero-Shot Image-to-Image Generation [74.5813283875938]
Zero-shot image-to-image generation poses substantial risks related to intellectual property violations.<n>This work presents Adapter Shield, the first universal and authentication-integrated solution aimed at defending personal images from misuse.<n>Our method surpasses existing state-of-the-art defenses in blocking unauthorized zero-shot image synthesis.
arXiv Detail & Related papers (2025-11-25T04:49:16Z) - Privacy-Preserving Biometric Verification with Handwritten Random Digit String [49.77172854374479]
Handwriting verification has stood as a steadfast identity authentication method for decades.<n>However, this technique risks potential privacy breaches due to the inclusion of personal information in handwritten biometrics such as signatures.<n>We propose using the Random Digit String (RDS) for privacy-preserving handwriting verification.
arXiv Detail & Related papers (2025-03-17T03:47:25Z) - Secure Semantic Communication With Homomorphic Encryption [52.5344514499035]
This paper explores the feasibility of applying homomorphic encryption to SemCom.<n>We propose a task-oriented SemCom scheme secured through homomorphic encryption.
arXiv Detail & Related papers (2025-01-17T13:26:14Z) - 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) - The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - 1-out-of-n Oblivious Signatures: Security Revisited and a Generic Construction with an Efficient Communication Cost [2.3864085643100186]
1-out-of-n oblivious signature is a protocol between the user and the signer.
We improve the generic construction of a 1-out-of-n oblivious signature scheme.
arXiv Detail & Related papers (2024-03-31T08:23:30Z) - 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) - Concept and Construction of Group Signature with self-proof capacity for confirming and denying [0.069060054915724]
Group signature is a cryptosystem with central role in cryptography.
New extension concept of group signature is presented, namely group signature with self-proof capacity.
arXiv Detail & Related papers (2023-09-26T03:30:03Z) - 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) - Quotable Signatures for Authenticating Shared Quotes [0.8875650122536799]
Quotable signature schemes are digital signature schemes with the additional property that from the signature for a message, any party can extract signatures for (allowable) quotes from the message.
We define a notion of security for quotable signature schemes and construct a concrete example of a quotable signature scheme.
We consider both how quotable signatures can be used, and why using them could help mitigate the effects of fake news.
arXiv Detail & Related papers (2022-12-21T12:07:46Z)
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.