Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles

Fauzi, Prastudy; Lipmaa, Helger

doi:10.1007/978-3-319-29485-8_12

Cited by 17 publications

(8 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They apply to any public-key encryption scheme which allows for re-encryption and for which a sigma protocol for correct re-encryption is known. There are also more efficient proofs of correct shuffle which have since emerged [16][17][18]. These new proofs are roughly three times faster than [4,44,49] and the cost of the verifiable mixing is close to optional, meaning little further improvement is possible.…”

Section: Propertiesmentioning

confidence: 99%

SoK: Techniques for Verifiable Mix Nets

Haines

Müller

2020

2020 IEEE 33rd Computer Security Foundations Symposium (CSF)

View full text Add to dashboard Cite

Since David Chaum introduced the idea of mix nets 40 years ago, they have become widely used building blocks for privacy-preserving protocols. Several important applications, such as secure e-voting, require that the employed mix net be verifiable. In the literature, numerous techniques have been proposed to make mix nets verifiable. Some of them have also been employed in politically binding elections. Verifiable mix nets differ in many aspects, including their precise verifiability levels, possible trust assumptions, and required cryptographic primitives; unfortunately, these differences are often opaque, making comparison painful. To shed light on this intransparent state of affairs, we provide the following contributions. For each verifiability technique proposed to date, we first precisely describe how the underlying basic mix net is to be extended and which (additional) cryptographic primitives are required, and then study its verifiability level, including possible trust assumptions, within one generic and expressive verifiability framework. Based on our uniform treatment, we are able to transparently compare all known verifiability techniques for mix nets, including their advantages and limitations. Altogether, our work offers a detailed and expressive reference point for the design, employment, and comparison of verifiable mix nets.

show abstract

Section: Propertiesmentioning

confidence: 99%

SoK: Techniques for Verifiable Mix Nets

Haines

Müller

2020

2020 IEEE 33rd Computer Security Foundations Symposium (CSF)

View full text Add to dashboard Cite

show abstract

“…This is possible in our case because public key for encryption is assumed to be witness-samplable and the argument is quasi-adaptive. This explains why we do not refer to the notion of culpable soundness, as in [10,7].…”

Section: Shuffle Argumentmentioning

confidence: 99%

“…Although one can prove every NP statement in zero-knowledge (going through a proof of circuit satisfiability, for instance), the literature has extensively explored more efficient alternatives for concrete statements which appear often in practice. Among them, some of the most important are: proofs of membership in linear spaces [13,17,14,16], range proofs [3,20,4], membership in a set [20,2], or correctness of a shuffle [5,10,18,7].…”

Section: Introductionmentioning

confidence: 99%

“…These problems have been studied following a variety of approaches and techniques. For instance, they have been studied both in the interactive [1,3,9] and the non-interactive setting [20,4,10,18,7], and in the latter setting, both under falsifiable (but not always standard) [20,10] and non-falsifiable assumptions [4,18,7] (like knowledge of exponent type of assumptions).…”

Section: Introductionmentioning

confidence: 99%

“…Let k = (−v 2 /v 1 , 1)the "decryption key" (i.e. v k = 0 and (0, 1)k = 1)7 . We multiply by k on the right the equation from condition c) to "decrypt" [C] 2 and [D] 2 .…”

mentioning

confidence: 99%

See 2 more Smart Citations