Secure Blockchain Decentralized Voting for Verified Users

The paper focuses onintroducing a decentralized e-voting scheme that uses blockchain to achieve security and anonymity. A blockchain network based on Ethereum was applied, to provide a decentralized and distributed database based on the Peer-to-Peer architecture. During the implementation, smart contractswere used. Thanks to this, it is possible to code the terms of the contract required to perform the transaction. The proof-of-conceptimplementation uses the blind signature protocol and encryption with the RSA algorithm. Presented in this paper scheme for blockchain decentralized voting is fully implemented and potential issues are analyzed and discussed.

Download Full-text

Blockchain Decentralized Voting for Verified Users with a Focus on Anonymity

10.5121/csit.2021.110805 ◽

2021 ◽

Author(s):

Piotr Pospiech ◽

Aleksander Marianski ◽

Michal Kedziora

Keyword(s):

Distributed Database ◽

Peer To Peer ◽

Blind Signature ◽

Smart Contracts ◽

Rsa Algorithm ◽

Voting Scheme

The paper presents decentralized voting scheme for verified users while maintaining their anonymity. A blockchain network was applied, which is a decentralized and distributed database based on the Peer-to-Peer architecture. During the implementation, the Ethereum network was used. Thanks to this, it is possible to code the terms of the contract required to perform the transaction. Ethereum and the use of smart contracts were also discussed in paper. The implementation uses the blind signature protocol by David Chaum and encryption with the Rivest-Shamir-Adleman (RSA) algorithm. Presented in this paper scheme for blockchain decentralized voting for verified users with focus on anonymity is then fully implemented and identified potential issues are analysed and discussed.

Download Full-text

Peer-to-Peer Usage Analysis

Encyclopedia of Multimedia Technology and Networking, Second Edition ◽

10.4018/978-1-60566-014-1.ch154 ◽

2009 ◽

pp. 1136-1141

Author(s):

Florent Masseglia ◽

Pascal Poncelet ◽

Maguelonne Teisseire

Keyword(s):

Data Mining ◽

Distributed Database ◽

Peer To Peer ◽

Communication Model ◽

P2p Systems ◽

P2p File Sharing ◽

Limited Edition ◽

Usage Analysis ◽

High Dynamics ◽

P2p System

With the huge number of information sources available on the Internet and the high dynamics of their data, peer-to-peer (P2P) systems propose a communication model in which each party has the same capabilities and can initiate a communication session. These networks allow a group of computer users with the same networking program to connect with each other and directly access resources from one another. P2P architectures also provide a good infrastructure for data and computer intensive operations such as data mining. In this article we consider a new data mining approach for improving resource searching in a dynamic and distributed database such as an unstructured P2P system, that is, in Masseglia, Poncelet, and Teisseire (2006) we call this problem P2P usage analysis. More precisely we aim at discovering frequent behaviors among users of such a system. We will focus on the sequential order between actions performed on each node (requests or downloads) and show how this order has to be taken into account for extracting useful knowledge. For instance, it may be discovered, in a P2P file sharing network that for 77% of nodes from which a request is sent for “Mandriva Linux,” the file “Mandriva Linux 2005 CD1 i585-Limited- Edition-Mini.iso” is chosen and downloaded; then a new request is performed with the possible name of the remaining iso images (i.e., “Mandriva Linux 2005 Limited Edition”), and in the large number of returned results the image corresponding to “Mandriva Linux 2005 CD2 i585-Limited-Edition-Mini.iso” is chosen and downloaded. Such knowledge is very useful for proposing the user with often downloaded or requested files according to a majority of behaviors. It could also be useful in order to avoid extra bandwidth consumption, which is the main cost of P2P queries (Ng, Chu, Rao, Sripanidkulchai, & Zhang, 2003).

Download Full-text

New Transaction Management Model

Encyclopedia of Mobile Computing and Commerce ◽

10.4018/978-1-59904-002-8.ch116 ◽

2007 ◽

pp. 693-699

Author(s):

Z. Abdul-Mehdi ◽

A. Mamat ◽

H. Ibrahim ◽

M. Dirs

Keyword(s):

Fault Tolerance ◽

Distributed Database ◽

Mobile Node ◽

Peer To Peer ◽

Management Model ◽

Transaction Management ◽

Proxy Server ◽

Mobile Nodes

In this article, we consider the distributed database that can make up mobile nodes and the peer-to-peer concept. These nodes are peers and may be replicated both for fault-tolerance, dependability, and to compensate for nodes that are currently disconnected. Thus we have a distributed replicated database where several sites must participate in the synchronization of transactions. The capabilities of the distributed replicated database are extended to allow mobile nodes to plan disconnection, with the capability of updating the database on behalf of the mobile node by using a fixed proxy server to make these updates during the mobile disconnection, once a mobile reconnects automatically, synchronously, and integrates into the database.

Download Full-text