Efficient Anonymous Channel and All/Nothing Election Scheme

Park, Choonsik; Itoh, Kazutomo; Kurosawa, Kaoru

doi:10.1007/3-540-48285-7_21

Cited by 194 publications

(147 citation statements)

References 6 publications

Supporting

Mentioning

144

Contrasting

Unclassified

Order By: Relevance

“…Historically the proposals of heuristically secure mix-nets [20,11,12,14,9] have been followed by discovery of security flaws [22,21,5,17,24].…”

Section: On the Provable Security Of Rpcmentioning

confidence: 99%

See 1 more Smart Citation

Randomized Partial Checking Revisited

Khazaei

Wikström

2013

Topics in Cryptology – CT-RSA 2013

View full text Add to dashboard Cite

We study mix-nets with randomized partial checking (RPC) as proposed by Jakobsson, Juels, and Rivest (2002). RPC is a technique to verify the correctness of an execution both for Chaumian and homomorphic mix-nets. The idea is to relax the correctness and privacy requirements to achieve a more efficient mix-net.We identify serious issues in the original description of mix-nets with RPC and show how to exploit these to break both correctness and privacy, both for Chaumian and homomorphic mix-nets. Our attacks are practical and applicable to real world mix-net implementations, e.g., the Civitas and the Scantegrity voting systems.

show abstract

“…Historically the proposals of heuristically secure mix-nets [20,11,12,14,9] have been followed by discovery of security flaws [22,21,5,17,24].…”

Section: On the Provable Security Of Rpcmentioning

confidence: 99%

“…For homomorphic cryptosystems, Park, Itoh and Kurosawa [20] introduced re-encryption mix-nets. Here the mix-servers generate a single joint public key with a verifiably secret shared secret key and decryption is replaced by re-encryption, followed by a joint verifiable decryption step.…”

Section: Introductionmentioning

confidence: 99%

Randomized Partial Checking Revisited

Khazaei

Wikström

2013

Topics in Cryptology – CT-RSA 2013

View full text Add to dashboard Cite

show abstract

“…It performs by permuting messages, and by reencrypting or by decrypting them. The scheme requires a re-encryption mix net based on the El Gamal cryptosystem as introduced by Park et al [22]. However, in order to reduce the trust in the mix process, the mix net should be universally verifiable.…”

Section: Building Blocksmentioning

confidence: 99%

A Practical and Secure Coercion-Resistant Scheme for Internet Voting

Araújo

Foulle

Traoré

2010

Towards Trustworthy Elections

View full text Add to dashboard Cite

Abstract. Juels, Catalano, and Jakobsson (JCJ) proposed at WPES 2005 the first voting scheme that considers real-world threats and that is more realistic for Internet elections. Their scheme, though, has a quadratic work factor and thereby is not efficient for large scale elections. Based on the work of JCJ, Smith proposed an efficient scheme that has a linear work factor. In this paper we first show that Smith's scheme is insecure. Then we present a new coercion-resistant election scheme with a linear work factor that overcomes the flaw of Smith's proposal. Our solution is based on the group signature scheme of Camenisch and Lysyanskaya (Crypto 2004).

show abstract

“…In the first type, each voter sends the ballot to a trusted third party, the Voting Center, in an encrypted form. In the second type, each voter sends the ballot to the Voting Center through an anonymous channel [11,27].…”

Section: A2 Classification: the Two Typesmentioning

confidence: 99%

Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups

Liu

Wei

Wong

2004

Lecture Notes in Computer Science

314

216

View full text Add to dashboard Cite

Abstract. We present a linkable spontaneously anonymous group (LSAG) signature scheme (alternatively known as linkable ring signature scheme) satisfying the following three properties. (1) Anonymity, or signer indistinguishability. (2) Linkability: That two signatures by the same signer can be linked. (3) Spontaneity: No group secret, therefore no group manager or group secret sharing setup. We reduce the security of our scheme to well-known problems under the random oracle model. Using the scheme, we construct a new efficient one-round e-voting system which does not have a registration phase. We also present a new efficient reduction of famous rewind simulation lemma which only relies on elementary probability theory. Threshold extensions of our scheme are also presented.30th April, 2004.

show abstract

Efficient Anonymous Channel and All/Nothing Election Scheme

Cited by 194 publications

References 6 publications

Randomized Partial Checking Revisited

Randomized Partial Checking Revisited

A Practical and Secure Coercion-Resistant Scheme for Internet Voting

Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups

Contact Info

Product

Resources

About