An Internet Voting Protocol with Receipt-Free and Coercion-Resistant

Meng, Bo

doi:10.1109/cit.2007.23

Cited by 12 publications

(13 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Expanded properties: universal verifiability, receiptfreeness [12,13], coercion-resistance [14] A lot of protocols use ad hoc physical assumption or the trusted third party to accomplish receipt-freeness. Papers [14,15,16,17] are better in the implementation of the expanded properties. They do not use strong physical assumption.…”

Section: The Coercion-resistant Internet Voting Model Without Physicamentioning

confidence: 99%

“…Finally, to our best knowledge, we originally give an internet voting model with coercion-resistance without physical assumptions based on our proposed deniable encryption scheme. We also compare the typical internet voting protocols [14,15,16,17] with our proposed model. The result can be found in TABLE II.…”

Section: The Proposed Internet Voting Modelmentioning

confidence: 99%

“…According to the rules the authorities tallies the ballot and publish its results. The tallying algorithm can be found in [16].…”

Section: Voting Phasementioning

confidence: 99%

See 2 more Smart Citations

An Efficient Receiver Deniable Encryption Scheme and Its Applications

Meng¹,

Wang²

2010

JNW

Self Cite

View full text Add to dashboard Cite

Deniable encryption is an important cryptographic primitive, essential in all cryptographic protocols where a coercive adversary comes to play with high potential. Deniable encryption plays a key role in the internet/electronic voting, electronic bidding, electronic auctions and secure multiparty computation. In this study a practical efficient receiver deniable encryption scheme based on BCP commitment scheme and idea of Klonowski et al. is proposed. The proposed scheme is a one-move scheme without any pre-encryption information required to be sent between the sender and the receiver prior to encryption. Moreover, the overhead is low in term of the size of the ciphertext. At the same time we compare the typical deniable encryption schemes with our proposed scheme. Finally, applying the proposed deniable encryption, we originally give a coercion-resistant internet voting model without physical assumptions. We also compare the typical internet voting protocols with our proposed model.

show abstract

Section: The Coercion-resistant Internet Voting Model Without Physicamentioning

confidence: 99%

Section: The Proposed Internet Voting Modelmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient Receiver Deniable Encryption Scheme and Its Applications

Meng¹,

Wang²

2010

JNW

Self Cite

View full text Add to dashboard Cite

show abstract

“…His protocol has receiptfreeness and coercion-resistance and it with weak physical assumptions: a one way anonymous channel between voter and authority. Meng [27] also proposes an Internet voting protocol applied designated verifier proof and proof of knowledge of two ciphertexts of the same plaintext based the same idea. The protocol also supposes there is a one way anonymous channel between voter and authority.…”

Section: Related Workmentioning

confidence: 99%

A Receipt-free Coercion-resistant Remote Internet Voting Protocol without Physical Assumptions through Deniable Encryption and Trapdoor Commitment Scheme

Meng¹,

Li²,

Qin³

2010

JSW

Self Cite

View full text Add to dashboard Cite

The secure remote Internet voting protocol play an important role in Internet voting system. The direction of development of remote Internet voting protocol is that implementation of receipt-freeness and coercion-resistance is from with strong physical assumptions to with weak physical assumptions. The final purpose is that receipt-freeness and coercion-resistance is implemented without physical assumptions. In this paper firstly, a receipt-free coercion-resistant remote Internet voting protocol based on MW deniable encryption scheme and BCP commitment scheme is developed. To our best knowledge the proposed remote Internet voting protocol, which has receipt-freeness and coercion-resistance, is the first remote Internet voting protocol implemented without physical assumptions. Secondly, we analyze receipt-freeness and coercion-resistance of the proposed remote Internet voting protocol. Finally, we compare security properties of several typical protocols with our present protocol.

show abstract

“…Receipt-freeness, first introduced in [27] and [30], is considered a very important property for remote Evoting systems and many research works have been dedicated to it [7] [23] [42] [43]. It means that voters are not able to provide any proof of their voting strategies to others.…”

Section: Receipt-freenessmentioning

confidence: 99%

Receipt-freeness and coercion resistance in remote E-voting systems

Ruan

Zou

2017

IJSN

View full text Add to dashboard Cite

Remote Electronic Voting (E-voting) is a more convenient and efficient methodology when compared with traditional voting systems. It allows voters to vote for candidates remotely, however, remote E-voting systems have not yet been widely deployed in practical elections due to several potential security issues, such as vote-privacy, robustness and verifiability. Attackers' targets can be either voting machines or voters. In this paper, we mainly focus on three important security properties related to voters: receipt-freeness, voteselling resistance, and voter-coercion resistance. In such scenarios, voters are willing or forced to cooperate with attackers. We provide a survey of existing remote E-voting systems, to see whether or not they are able to satisfy these three properties to avoid corresponding attacks. Furthermore, we identify and summarize what mechanisms they use in order to satisfy these three security properties.

show abstract

An Internet Voting Protocol with Receipt-Free and Coercion-Resistant

Cited by 12 publications

References 20 publications

An Efficient Receiver Deniable Encryption Scheme and Its Applications

An Efficient Receiver Deniable Encryption Scheme and Its Applications

A Receipt-free Coercion-resistant Remote Internet Voting Protocol without Physical Assumptions through Deniable Encryption and Trapdoor Commitment Scheme

Receipt-freeness and coercion resistance in remote E-voting systems

Contact Info

Product

Resources

About