An Improved Dynavote E-Voting Protocol Implementation

2013 ◽  
pp. 72-90
Author(s):  
Abdulwasiu Kailani AbdulRahim ◽  
Olusegun Folorunso ◽  
Sushil Sharma
Keyword(s):  
Data Mining ◽  
Population Data ◽  
Public Key Cryptography ◽  
Public Key ◽  
Voter Registration ◽  
Electronic Voting ◽  
Protocol Implementation ◽  
Fingerprint Biometrics ◽  
Performance Results

Electronic voting—the use of computers or computerized voting equipment to cast and tabulate and tally ballots in an election in a trustable manner—is a pillar of e-Government. The DynaVote voting protocol system proposed by Cetinkaya and Koc (2007) is assumed secure and practicable on a network. However, the DynaVote e-Voting protocol does not completely protect the voting counter against impersonated votes, especially when the pseudo-Vote identities are known by the wrong voter or compromised by authorities. To address this problem, a prototype called improved DynaVote e-Vote protocol was designed to protect the counter from anomalies associated with counting impersonated votes (multiple votes) in the same election. This was achieved by introducing biometric fingerprint and pseudo voter identities (PVID) encryption for each voter during voter registration via online or data mining of population data containing fingerprint biometrics. Furthermore, fingerprint reader and RSA public key cryptography is used in PVID to eliminate counting impersonated votes. The performance results showed that improved DynaVote e-Vote protocol is more reliable, eligible, and accurate, and protects voter privacy against other e-Vote protocols.

An Improved Dynavote E-Voting Protocol Implementation

2011 ◽  
Vol 3 (3) ◽  
pp. 44-61
Author(s):  
Abdulwasiu Kailani AbdulRahim ◽  
Olusegun Folorunso ◽  
Sushil Sharma
Keyword(s):  
Data Mining ◽  
Population Data ◽  
Public Key Cryptography ◽  
Public Key ◽  
Voter Registration ◽  
Electronic Voting ◽  
Protocol Implementation ◽  
Fingerprint Biometrics ◽  
Performance Results

Electronic voting—the use of computers or computerized voting equipment to cast and tabulate and tally ballots in an election in a trustable manner—is a pillar of e-Government. The DynaVote voting protocol system proposed by Cetinkaya and Koc (2007) is assumed secure and practicable on a network. However, the DynaVote e-Voting protocol does not completely protect the voting counter against impersonated votes, especially when the pseudo-Vote identities are known by the wrong voter or compromised by authorities. To address this problem, a prototype called improved DynaVote e-Vote protocol was designed to protect the counter from anomalies associated with counting impersonated votes (multiple votes) in the same election. This was achieved by introducing biometric fingerprint and pseudo voter identities (PVID) encryption for each voter during voter registration via online or data mining of population data containing fingerprint biometrics. Furthermore, fingerprint reader and RSA public key cryptography is used in PVID to eliminate counting impersonated votes. The performance results showed that improved DynaVote e-Vote protocol is more reliable, eligible, and accurate, and protects voter privacy against other e-Vote protocols.

scholarly journals Electronic Voting Protocol Using Identity-Based Cryptography

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Gina Gallegos-Garcia ◽  
Horacio Tapia-Recillas
Keyword(s):  
Key Agreement ◽  
Public Key Cryptography ◽  
Public Key ◽  
Electronic Voting ◽  
Certification Authority ◽  
Public Keys ◽  
Core Components ◽  
Identity Based ◽  
High Flexibility ◽  
Agreement Protocols

Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps.

Analisis dan Implementasi Protokol Otentikasi FIDO U2F

2017 ◽  
Vol 9 (1) ◽  
pp. 30-35
Author(s):  
Sunderi Pranata ◽  
Hargyo Tri Nugroho ◽  
Hirofumi Yamaki
Keyword(s):  
Public Key Cryptography ◽  
Authentication Protocol ◽  
Public Key ◽  
Next Generation ◽  
Index Terms ◽  
Mitm Attack

It is known that password itself is not enough for formidable authentication method since it has a lot of vulnerabilities. Multi factor authentication (MFA) is introduced for the next generation for good authentication to address that issue. MFA combines two or more of three principles of good security, “something you know”, “something you have”, and “something you are”. Most MFA mechanisms work as one time passwords (OTP). However, they can still be vulnerable to phishing and MiTM attack. On top of that, OTP can be hard to use as it requires user to input another password given by the device (SMS, token, authenticator). Implemented in small USB U2F device, FIDO U2F delivers easier yet stronger security on authentication process which implements public key cryptography, challenge-response protocol, and phishing and MitM protection.  Index Terms— Authentication protocol, FIDO U2F, Multi factor authentication, OTP

IMPLEMENTASI ALGORITMA SCHMIDT-SAMOA PADA ENKRIPSI DEKRIPSI EMAIL BERBASIS ANDROID

2013 ◽  
Vol 9 (1) ◽  
Author(s):  
Willy Ristanto ◽  
Willy Sudiarto Raharjo ◽  
Antonius Rachmat Chrismanto
Keyword(s):  
Public Key Cryptography ◽  
Text Messages ◽  
Public Key ◽  
Client Application ◽  
Performance Measurements ◽  
Encryption And Decryption ◽  
Number Variation

Cryptography is a technique for sending secret messages. This research builds an Android-based email client application which implement cryptography with Schmidt-Samoa algorithm, which is classified as a public key cryptography. The algorithm performs encryption and decryption based on exponential and modulus operation on text messages. The application use 512 and 1024 bit keys. Performance measurements is done using text messages with character number variation of 5 – 10.000 characters to obtain the time used for encryption and decryption process. As a result of this research, 99,074% data show that decryption process is faster than encryption process. In 512 bit keys, the system can perform encryption process in 520 - 18.256 miliseconds, and decryption process in 487 - 5.688 miliseconds. In 1024 bit keys, system can perform encryption process in 5626 – 52,142 miliseconds (7.388 times slower than 512 bit keys) and decryption process with time 5463 – 15,808 miliseconds or 8.290 times slower than 512 bit keys.

Public-Key Encryption

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Elliptic Curve ◽  
Public Key Cryptography ◽  
Public Key ◽  
Public Key Encryption ◽  
Hybrid Encryption ◽  
Public Key Cryptosystems ◽  
Encryption And Decryption ◽  
Encryption Schemes ◽  
Hard Problems ◽  
Set Up

In this chapter, we introduce public-key encryption. We first consider the motivation behind the concept of public-key cryptography and introduce the hard problems on which popular public-key encryption schemes are based. We then discuss two of the best-known public-key cryptosystems, RSA and ElGamal. For each of these public-key cryptosystems, we discuss how to set up key pairs and perform basic encryption and decryption. We also identify the basis for security for each of these cryptosystems. We then compare RSA, ElGamal, and elliptic-curve variants of ElGamal from the perspectives of performance and security. Finally, we look at how public-key encryption is used in practice, focusing on the popular use of hybrid encryption.

Sign in / Sign up

Export Citation Format

Share Document