Uncoercibility In E-Voting And E-Auctioning Mechanisms Using Deniable Encryption

Howlader, Jaydeep; Nair, Vivek; Basu, Saikat; Mal, Ashis Kumar

doi:10.5121/ijnsa.2011.3208

Cited by 8 publications

(5 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Current state of the art. The use of asymmetric encryption in electronic voting is not a new concept (Al-Anie et al, 2011;Howlader et al, 2011;Meng and Wang, 2010). Over a decade ago, Alvarez and Hall (2004) discussed the future of Internet voting and the use of Internet voting in an Arizona county primary.…”

Section: Introductionmentioning

confidence: 99%

Distributed Internet voting architecture: A thin client approach to Internet voting

Helm

2021

Journal of Information Technology

View full text Add to dashboard Cite

Principles required for secure electronic voting using the Internet are known and published. Although the Internet voting functionalities and technologies are well-defined, none of the existing state-sponsored Internet voting approaches in use incorporate a total Internet-based system approach that includes voter registration, the voting process, and vote counting. The distributed Internet voting architecture concept discussed in this article uses a novel thin client approach to Internet voting. The architecture uses existing technologies and knowledge to create a viable whole system approach to Internet voting. This article describes various aspects and processes necessary to support an integrated approach. The application programming interface software for many of the critical functions was developed in Python and functionality tested. A virtual network, including a cloud-based functionality, was created and used to evaluate the various conceptual aspects of the proposed architecture. This included the concepts associated with programming and accessing smart cards, capturing and saving fingerprint data, structuring virtual private networks using tunneling and Internet Protocol Security, encrypting ballots using asymmetric encryption, using symmetric encryption for secret cookies, thin client interaction, and creating hash functions to be used within a blockchain structure in a Merkle tree architecture. The systems’ primary user targets are individuals remotely located from their home voting precincts and senior citizens who have limited mobility and mostly reside in assisted living facilities. The research supports the contention that a cybersecure Internet voting system that significantly reduces the opportunity for mail-in voter fraud, helps to ensure privacy for the voter, including nonrepudiation, nonattribution, receipt freeness, and vote acknowledgment can be created using existing technology.

show abstract

Section: Introductionmentioning

confidence: 99%

Distributed Internet voting architecture: A thin client approach to Internet voting

Helm

2021

Journal of Information Technology

View full text Add to dashboard Cite

show abstract

“…However the mechanism requires prior registration of the participants. Deniable encryption ; to relax the untappable channel was independently applied in and . The notion of deniability allows the coerced bidder to produce fake message corresponding to her public transcripts.…”

Section: Introductionmentioning

confidence: 99%

Sealed‐bid auction: a cryptographic solution to bid‐rigging attack in the collusive environment

Howlader

Mal

2015

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

Sealed‐Bid auction is an efficient and rational way to establish the price and trading goods in the open market. However sealed‐bid auctions are subject to bid‐rigging attack. Receipt‐free mechanisms are proposed to prevent bid‐rigging. So far, all the proposed receipt‐free mechanisms are based on strict assumptions: i) The channel between bidders and the auction authorities (like auctioneer, sealer, registering authority etc.) must be untappable, 2) the authorities are assumed to be honest (not colluded), hence ensure privacy and anonymity of bids. Moreover, the existing receipt‐free mechanisms are bandwidth intensive (estimated difference between the minimum and maximum bidding price). In this paper, we present a receipt‐free sealed‐bid auction mechanism which can withstand public channel and colluded authorities. The proposed mechanism can work even under the situation where all the authorities except one are colluded. Unlike the existing mechanisms, the computational complexity of the proposed mechanism is independent of the bandwidth and only depends on the number of valid bids. The auction mechanism requires O(mlogm) computational steps to resolve the winner, where m is the number of valid bids in the system. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

“…Abe & Suzuki [18] Chen et al [28] Her et al [29] Huang et al [30] Howlader et al [10] Gao et al [8] [21,12] ware proposed in [24,13] to relax the untappable channel. The notion of deniability allows the bidders to plausibly evade the coercer.…”

Section: Constraints and Assumptionsmentioning

confidence: 99%

Practical Receipt-Free Sealed-Bid Auction in the Coercive Environment

Howlader

Roy

Mal

2014

Information Security and Cryptology -- ICISC 2013

Self Cite

View full text Add to dashboard Cite

Abstract. Sealed-Bid auction is an efficient and rational method to establish the price in open market. However sealed-bid auctions are subject to bid-rigging attack. Receipt-free mechanisms were proposed to prevent bid-rigging. The prior receipt-free mechanisms are based on two assumptions; firstly, existence of untappable channel between bidders and auction authorities. Secondly, mechanisms assume the authorities to be honest (not colluding). Moreover the bandwidth required to communicate the receipt-free bids is huge. This paper presents a sealed-bid auction mechanism to resist bid-rigging. The proposed method does not assume untappable channel nor consider the authorities to be necessarily honest. The proposed mechanism also manages the bandwidth efficiently, and improves the performance of the system.

show abstract

Uncoercibility In E-Voting And E-Auctioning Mechanisms Using Deniable Encryption

Abstract: The uncoercibility to prevent rigging in e-voting and e-auction have been studied in different literatures. It is realized that the notion of a virtual booth

Cited by 8 publications

References 22 publications

Distributed Internet voting architecture: A thin client approach to Internet voting

Distributed Internet voting architecture: A thin client approach to Internet voting

Sealed‐bid auction: a cryptographic solution to bid‐rigging attack in the collusive environment

Practical Receipt-Free Sealed-Bid Auction in the Coercive Environment

Contact Info

Product

Resources

About