Secure E-voting System by Utilizing Homomorphic Properties of the Encryption Algorithm
Cryptography technique is used to encrypt the information such as voter's data, voter's choice, and the voting result before that data stored on the server. [...]the system can ensure authenticity and security of voting information [1]. To achieve that, there are several numbers that need...
Gespeichert in:
| Veröffentlicht in: | Telkomnika 2018-04, Vol.16 (2), p.862-867 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 867 |
|---|---|
| container_issue | 2 |
| container_start_page | 862 |
| container_title | Telkomnika |
| container_volume | 16 |
| creator | Suwandi, Rifki Nasution, Surya Michrandi Azmi, Fairuz |
| description | Cryptography technique is used to encrypt the information such as voter's data, voter's choice, and the voting result before that data stored on the server. [...]the system can ensure authenticity and security of voting information [1]. To achieve that, there are several numbers that need to be generated before with following procedure. 2.1.Key Generation In the Paillier algorithm, to generate the private key and public key, we need to select two different big prime numbers p and q with ged (pą,(p-1)(ą-1)=1. The function of random number r in both algorithms is to make the result of encryption message that has exactly same value will different result of ciphertext. [...]these algorithms can guarantee the uniqueness of the data to be stored. [5] Rifki S, Surya M N, Fairuz A. Okamoto-Uchiyama Homomorphic Encryption Algorithm Implementation in E-Voting System. |
| doi_str_mv | 10.12928/TELKOMNIKA.V16İ2.8420 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2031257349</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2031257349</sourcerecordid><originalsourceid>FETCH-proquest_journals_20312573493</originalsourceid><addsrcrecordid>eNqNS1uqwjAUDKJgUddgwO_2Jic-mk-Rihef4ONXtEQbaZuapEJdlYtwYebCXYAzDAPzQKhLSUCBQ_izixbz9XL1Ox8HBzp8vyAI-0BqyANGwOfAWR15dMiZ70SaqGPMjTiMCAx46KHDVsSlFjjyH8rK_Iq3lbEiw-cK761M5fMvm6nMUReJjPFGq0JoK4XB6oJt4q55rKvCSpXjcXpVWtoka6PG5ZQa0fn3FupNo91k5hda3Uth7PGmSp276giEURiMWJ-z71YfgEVL0A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2031257349</pqid></control><display><type>article</type><title>Secure E-voting System by Utilizing Homomorphic Properties of the Encryption Algorithm</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Suwandi, Rifki ; Nasution, Surya Michrandi ; Azmi, Fairuz</creator><creatorcontrib>Suwandi, Rifki ; Nasution, Surya Michrandi ; Azmi, Fairuz</creatorcontrib><description>Cryptography technique is used to encrypt the information such as voter's data, voter's choice, and the voting result before that data stored on the server. [...]the system can ensure authenticity and security of voting information [1]. To achieve that, there are several numbers that need to be generated before with following procedure. 2.1.Key Generation In the Paillier algorithm, to generate the private key and public key, we need to select two different big prime numbers p and q with ged (pą,(p-1)(ą-1)=1. The function of random number r in both algorithms is to make the result of encryption message that has exactly same value will different result of ciphertext. [...]these algorithms can guarantee the uniqueness of the data to be stored. [5] Rifki S, Surya M N, Fairuz A. Okamoto-Uchiyama Homomorphic Encryption Algorithm Implementation in E-Voting System.</description><identifier>ISSN: 1693-6930</identifier><identifier>EISSN: 2302-9293</identifier><identifier>DOI: 10.12928/TELKOMNIKA.V16İ2.8420</identifier><language>eng</language><publisher>Yogyakarta: Ahmad Dahlan University</publisher><subject>Algorithms ; Cheating ; Computer science ; Confidentiality ; Cryptography ; Data encryption ; Electronic voting systems ; Encryption ; Informatics ; Online voting ; Prime numbers ; Public Key Infrastructure ; Voting machines</subject><ispartof>Telkomnika, 2018-04, Vol.16 (2), p.862-867</ispartof><rights>Copyright Ahmad Dahlan University Apr 2018</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Suwandi, Rifki</creatorcontrib><creatorcontrib>Nasution, Surya Michrandi</creatorcontrib><creatorcontrib>Azmi, Fairuz</creatorcontrib><title>Secure E-voting System by Utilizing Homomorphic Properties of the Encryption Algorithm</title><title>Telkomnika</title><description>Cryptography technique is used to encrypt the information such as voter's data, voter's choice, and the voting result before that data stored on the server. [...]the system can ensure authenticity and security of voting information [1]. To achieve that, there are several numbers that need to be generated before with following procedure. 2.1.Key Generation In the Paillier algorithm, to generate the private key and public key, we need to select two different big prime numbers p and q with ged (pą,(p-1)(ą-1)=1. The function of random number r in both algorithms is to make the result of encryption message that has exactly same value will different result of ciphertext. [...]these algorithms can guarantee the uniqueness of the data to be stored. [5] Rifki S, Surya M N, Fairuz A. Okamoto-Uchiyama Homomorphic Encryption Algorithm Implementation in E-Voting System.</description><subject>Algorithms</subject><subject>Cheating</subject><subject>Computer science</subject><subject>Confidentiality</subject><subject>Cryptography</subject><subject>Data encryption</subject><subject>Electronic voting systems</subject><subject>Encryption</subject><subject>Informatics</subject><subject>Online voting</subject><subject>Prime numbers</subject><subject>Public Key Infrastructure</subject><subject>Voting machines</subject><issn>1693-6930</issn><issn>2302-9293</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNS1uqwjAUDKJgUddgwO_2Jic-mk-Rihef4ONXtEQbaZuapEJdlYtwYebCXYAzDAPzQKhLSUCBQ_izixbz9XL1Ox8HBzp8vyAI-0BqyANGwOfAWR15dMiZ70SaqGPMjTiMCAx46KHDVsSlFjjyH8rK_Iq3lbEiw-cK761M5fMvm6nMUReJjPFGq0JoK4XB6oJt4q55rKvCSpXjcXpVWtoka6PG5ZQa0fn3FupNo91k5hda3Uth7PGmSp276giEURiMWJ-z71YfgEVL0A</recordid><startdate>20180401</startdate><enddate>20180401</enddate><creator>Suwandi, Rifki</creator><creator>Nasution, Surya Michrandi</creator><creator>Azmi, Fairuz</creator><general>Ahmad Dahlan University</general><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BVBZV</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20180401</creationdate><title>Secure E-voting System by Utilizing Homomorphic Properties of the Encryption Algorithm</title><author>Suwandi, Rifki ; Nasution, Surya Michrandi ; Azmi, Fairuz</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20312573493</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Cheating</topic><topic>Computer science</topic><topic>Confidentiality</topic><topic>Cryptography</topic><topic>Data encryption</topic><topic>Electronic voting systems</topic><topic>Encryption</topic><topic>Informatics</topic><topic>Online voting</topic><topic>Prime numbers</topic><topic>Public Key Infrastructure</topic><topic>Voting machines</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Suwandi, Rifki</creatorcontrib><creatorcontrib>Nasution, Surya Michrandi</creatorcontrib><creatorcontrib>Azmi, Fairuz</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>East & South Asia Database</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>Telkomnika</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Suwandi, Rifki</au><au>Nasution, Surya Michrandi</au><au>Azmi, Fairuz</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Secure E-voting System by Utilizing Homomorphic Properties of the Encryption Algorithm</atitle><jtitle>Telkomnika</jtitle><date>2018-04-01</date><risdate>2018</risdate><volume>16</volume><issue>2</issue><spage>862</spage><epage>867</epage><pages>862-867</pages><issn>1693-6930</issn><eissn>2302-9293</eissn><abstract>Cryptography technique is used to encrypt the information such as voter's data, voter's choice, and the voting result before that data stored on the server. [...]the system can ensure authenticity and security of voting information [1]. To achieve that, there are several numbers that need to be generated before with following procedure. 2.1.Key Generation In the Paillier algorithm, to generate the private key and public key, we need to select two different big prime numbers p and q with ged (pą,(p-1)(ą-1)=1. The function of random number r in both algorithms is to make the result of encryption message that has exactly same value will different result of ciphertext. [...]these algorithms can guarantee the uniqueness of the data to be stored. [5] Rifki S, Surya M N, Fairuz A. Okamoto-Uchiyama Homomorphic Encryption Algorithm Implementation in E-Voting System.</abstract><cop>Yogyakarta</cop><pub>Ahmad Dahlan University</pub><doi>10.12928/TELKOMNIKA.V16İ2.8420</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1693-6930 |
| ispartof | Telkomnika, 2018-04, Vol.16 (2), p.862-867 |
| issn | 1693-6930 2302-9293 |
| language | eng |
| recordid | cdi_proquest_journals_2031257349 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Algorithms Cheating Computer science Confidentiality Cryptography Data encryption Electronic voting systems Encryption Informatics Online voting Prime numbers Public Key Infrastructure Voting machines |
| title | Secure E-voting System by Utilizing Homomorphic Properties of the Encryption Algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T15%3A15%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Secure%20E-voting%20System%20by%20Utilizing%20Homomorphic%20Properties%20of%20the%20Encryption%20Algorithm&rft.jtitle=Telkomnika&rft.au=Suwandi,%20Rifki&rft.date=2018-04-01&rft.volume=16&rft.issue=2&rft.spage=862&rft.epage=867&rft.pages=862-867&rft.issn=1693-6930&rft.eissn=2302-9293&rft_id=info:doi/10.12928/TELKOMNIKA.V16%C4%B02.8420&rft_dat=%3Cproquest%3E2031257349%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2031257349&rft_id=info:pmid/&rfr_iscdi=true |