BLAZE: Practical Lattice-Based Blind Signatures for Privacy-Preserving Applications

Alkadri, Nabil Alkeilani; Bansarkhani, Rachid El; Buchmann, Johannes

doi:10.1007/978-3-030-51280-4_26

Cited by 15 publications

(12 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A kind of signature that requires interaction is blind signature, where a user wants to obtain a signature by a signer on some message m, without the signer obtaining any information about the message m. Currently, in the setting of lattice-based blind signatures, the tree of commitments technique introduced in [4] to reduce the abort probability has been successfully used a couple of times, first in the same paper [4] as an improvement of the signature scheme BLAZE [3] and then in [16] to construct a provably-secure (in contrast to BLAZE and BLAZE+) but inefficient scheme which involves three rounds of communication.…”

Section: Settings Where Our Results Is Not Usefulmentioning

confidence: 99%

“…µ , z (3) ). Repeating this argument µ times, letting P Π send a (i) i to its verifier V Π in round i, getting c i as answer and rewinding P Σ accordingly, at the end we eventually finish, after µ + 1 executions of P Σ , with a valid transcript (a…”

Section: Soundnessmentioning

confidence: 99%

“…Therefore, it seems natural that, for deniability, we need a protocol with full zero-knowledge (ZK) 3 in the plain model (with no extra assumptions like a random oracle, a common reference string, a public key infrastructure, etc.). Achieving ZK in the plain model requires at least three rounds of interaction.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

How to Avoid Repetitions in Lattice-Based Deniable Zero-Knowledge Proofs

et al. 2022

View full text Add to dashboard Cite

Interactive zero-knowledge systems are a very important cryptographic primitive, used in many applications, especially when deniability (also known as non-transferability) is desired. In the lattice-based setting, the currently most efficient interactive zero-knowledge systems employ the technique of rejection sampling, which implies that the interaction does not always finish correctly in the first execution; the whole interaction must be re-run until abort does not happen. While repetitions due to aborts are acceptable in theory, in some practical applications it is desirable to avoid re-runs for usability reasons. In this work we present a generic technique that departs from an interactive zero-knowledge system (that might require multiple re-runs to complete the protocol) and obtains a 3-moves zero-knowledge system (without re-runs). The transformation combines the well-known Fiat-Shamir technique with a couple of initially exchanged messages. The resulting 3-moves system enjoys honest-verifier zero-knowledge and can be easily turned into a fully deniable proof using standard techniques. We show some practical scenarios where our transformation can be beneficial and we also discuss the results of an implementation of our transformation.

show abstract

Section: Settings Where Our Results Is Not Usefulmentioning

confidence: 99%

Section: Soundnessmentioning

confidence: 99%

See 1 more Smart Citation

How to Avoid Repetitions in Lattice-Based Deniable Zero-Knowledge Proofs

et al. 2022

View full text Add to dashboard Cite

show abstract

“…In [3], blindness is formalised based on an indistinguishability game. An adversary A (acting as a signer) chooses a secret key/public key pair (sk, pk) and two messages 0 , 1 , and then interacts with two requesters: one who requests a signature on 0 , and one who requests a signature on 1 .…”

Section: Empowering Scriptless Blockchain: Adaptor Signaturementioning

confidence: 99%

“…For example, Ethereum 2.0 upgrade 2 is expected to support some quantum-safe cryptographic tools. Moreover, Algorand has recently introduced state proofs 3 , where a post-quantum signature scheme (based on lattice problems) is used. Beyond these, we are not aware of a large-scale adoption of PQ tools in the blockchain setting and hope our work will pave the way towards a wider adoption of PQ cryptography for blockchain applications.…”

Section: Introductionmentioning

confidence: 99%

A Survey on Exotic Signatures for Post-quantum Blockchain: Challenges and Research Directions

et al. 2023

View full text Add to dashboard Cite

Blockchain technology provides efficient and secure solutions to various online activities by utilizing a wide range of cryptographic tools. In this paper, we survey the existing literature on post-quantum secure digital signatures that possess exotic advanced features and which are crucial cryptographic tools used in the blockchain ecosystem for (i) account management, (ii) consensus efficiency, (iii) empowering scriptless blockchain, and (iv) privacy. The exotic signatures that we particularly focus on in this work are the following: multi-/aggregate, threshold, adaptor, blind and ring signatures. Herein the term exotic refers to signatures with properties which are not just beyond the norm for signatures e.g. unforgeability, but also imbue new forms of functionalities. Our treatment of such exotic signatures includes discussions on existing challenges and future research directions in the post-quantum space. We hope that this article will help to foster further research to make post-quantum cryptography more accessible so that blockchain systems can be made ready in advance of the approaching quantum threats.

show abstract

A lattice‐based blind ring signature scheme for sensitive data protection in blockchain applications

Khanum

Mustafa

2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryEvery transaction is made public and verified by a third party, and the transparency of blockchain applications leads to privacy leaks. Everyone can access the transaction, making it easier for network analysis to identify the user's identity, which is a major problem with the blockchain. Financial institutions have become hesitant to adopt blockchain technology; as a result, preventing its spread. To confirm that encryption and security are maintained for transactions in the blockchain, this research introduces a zero‐knowledge proof (ZKP) based transaction validation scheme. To increase the security of blockchain applications, the proposed lattice‐based blind ring signature (LBRS) scheme integrates blind and ring signatures and is applied to sensitive data. The data are encrypted using this encryption scheme before being stored with the transactional information in the blocks. The encrypted data is then stored in the blocks, which users can retrieve after verification. The encrypted data is then stored in blocks, which users can retrieve after verification. A verification scheme based on the ZKP is used to prevent unauthorized access and changes to the data. The proposed LBRS scheme meets the security analysis requirement. The performance of an LBRS scheme is compared to other relevant models in terms of execution time, encryption time, and decryption time. Overall, the results are more encouraging and reassuring than other relevant works of interest. Finally, this model provides better computational security and satisfies the requirements like correctness and security analysis.

show abstract

BLAZE: Practical Lattice-Based Blind Signatures for Privacy-Preserving Applications

Cited by 15 publications

References 28 publications

How to Avoid Repetitions in Lattice-Based Deniable Zero-Knowledge Proofs

How to Avoid Repetitions in Lattice-Based Deniable Zero-Knowledge Proofs

A Survey on Exotic Signatures for Post-quantum Blockchain: Challenges and Research Directions

A lattice‐based blind ring signature scheme for sensitive data protection in blockchain applications

Contact Info

Product

Resources

About