Lattice-Based Blind Signatures, Revisited

Hauck, Eduard; Kiltz, Eike; Loss, Julian; Nguyen, Ngoc Khanh

doi:10.1007/978-3-030-56880-1_18

Cited by 37 publications

(8 citation statements)

References 57 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%

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%

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

et al. 2022

View full text Add to dashboard Cite

show abstract

“…This problem motivated Kaim, Canard, Roux-Langlois, and Traoré [42] to distribute the role of EA by using the threshold blind signature scheme from [7]. However, that scheme [7] was shown to be flawed [36].…”

Section: Basic Versionmentioning

confidence: 99%

SoK: Secure E-Voting with Everlasting Privacy

Haines

Mosaheb

Müller

et al. 2023

PoPETs

View full text Add to dashboard Cite

Vote privacy is a fundamental right, which needs to be protected not only during an election, or for a limited time afterwards, but for the foreseeable future. Numerous electronic voting (e-voting) protocols have been proposed to address this challenge, striving for everlasting privacy. This property guarantees that even computationally unbounded adversaries cannot break privacy of past elections. The broad interest in secure e-voting with everlasting privacy has spawned a large variety of protocols over the last three decades. These protocols differ in many aspects, in particular the precise security properties they aim for, the threat scenarios they consider, and the privacy-preserving techniques they employ. Unfortunately, these differences are often opaque, making analysis and comparison cumbersome. In order to overcome this non-transparent state of affairs, we systematically analyze all e-voting protocols designed to provide everlasting privacy. First, we illustrate the relations and dependencies between all these different protocols. Next, we analyze in depth which protocols do provide secure and efficient approaches to e-voting with everlasting privacy under realistic assumptions, and which ones do not. Eventually, based on our extensive and detailed treatment, we identify which research problems in this field have already been solved, and which ones are still open. Altogether, our work offers a well - founded reference point for conducting research on secure e - voting with everlasting privacy as well as for future - proofing privacy in real - world electronic elections.

show abstract

“…A lot of research work has been done to reduce the computational overhead and energy consumption of asymmetric cryptosystems and to propose a more secure and reasonable key management scheme. A review of smart grid-related security issues can be found in [30][31][32][33][34], among others, for smart grid key management schemes. Using the solid security foundation over lattice and higher computational efficiency, this paper proposes a lattice-based smart grid key management scheme to ensure the security of communication phase by constructing intra and inter-cluster multi-hop routing security algorithms; introducing timestamp parameters and identity-based information to ensure the security of key update phase; using symmetric cryptosystem algorithms for encryption to improve communication efficiency; and using probabilistic output authentication information that makes the distribution of the output authentication information independent of the private key of the authenticated subject.…”

Section: Introductionmentioning

confidence: 99%

Identity-Based Key Management Scheme for Smart Grid over Lattice

2023

KSII TIIS

View full text Add to dashboard Cite

At present, the smart grid has become one of the indispensable infrastructures in people's lives. As a commonly used communication method, wireless communication is gradually, being widely used in smart grid systems due to its convenient deployment and wide range of serious challenges to security. For the insecurity of the schemes based on large integer factorization and discrete logarithm problem in the quantum environment, an identity-based key management scheme for smart grid over lattice is proposed. To assure the communication security, through constructing intra-cluster and inter-cluster multi-hop routing secure mechanism. The time parameter and identity information are introduced in the relying phase. Through using the symmetric cryptography algorithm to encrypt improve communication efficiency. Through output the authentication information with probability, the protocol makes the private key of the certification body no relation with the distribution of authentication information. Theoretic studies and figures show that the efficiency of keys can be authenticated, so the number of attacks, including masquerade, reply and message manipulation attacks can be resisted. The new scheme can not only increase the security, but also decrease the communication energy consumption.

show abstract

Lattice-Based Blind Signatures, Revisited

Cited by 37 publications

References 57 publications

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

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

SoK: Secure E-Voting with Everlasting Privacy

Identity-Based Key Management Scheme for Smart Grid over Lattice

Contact Info

Product

Resources

About