Rancang Bangun Sistem Keamanan Penyimpanan Data Pada Sistem E-Voting

Dewasa ini, perkembangan teknologi informasi telah merambah dunia politik salah satunya dalam hal pemilihan umum Beberapa negara telah menerapkan sistem pemilihan umum dengan memanfaatkan teknologi informasi yang kemudian dikenal dengan sebutan e-voting. Dilihat dari tingginya nilai kerahasiaan dan keamanan informasi dalam sebuah pemilu, maka dibutuhkan sistem pemilihan umum elektronik (e-voting) yang aman baik dari segi teknis maupun penyimpanan data. Tugas akhir ini menggabungkan beberapa metode pengamanan data seperti penggunaan fungsi hash SHA256, digital signature, dan algoritma enkripsi asimetris RSA yang diterapkan pada basis data serta protokol pengiriman data dalam sistem evoting. Fokus yang dikerjakan lebih terarah pada aplikasi “backend” dari sistem yaitu dengan menggunakan web service sebagai aplikasi utama yang menjembatani pengiriman data suara baik dari TPS ke server maupun server ke server sekaligus menjamin keamanan, kerahasiaan, serta integritas data suara yang dikirimkan.. Dari uji coba metode pengamanan data di atas, didapatkan hasil bahwa sistem e-voting ini mampu menangani beberapa ancaman keamanan sistem utamanya pada basis data x dan pengiriman data dari serangan replay attack, packet sniffing, pemalsuan data suara, serta mampu menjamin privasi pemilih dan integritas data yang dapat dijadikan salah satu alternatif pengamanan basis data dalam berbagai jenis bentuk front-end sistem e-voting. ========================================================================================================== Nowadays, information technology development finally reaches politics field for example information technology in government election. Some of major country have been using an election system applying information technology in its core known as e-voting. In an election, the needs of security and secrecy is really high. We can conclude that we need an e-voting system that can provide both security in technics and the data storage. This theses uses some kind of data security methods such as hash function SHA256, Digital Signature, and Asymmetric Encryption Algorithm RS. Those methods are applied at the database of e-vote system and the protocol used for sending data in the entire system. The focus of this theses is the “back-end” application of the entire e-vote system. Web services used as the middleware to send data between TPS to server or server to server also assuring the secrecy, security, and integrity of data sent. From the tests of data security methods in e-vote system, the results say that this design can offers a good security against some security threat. The threat is the ones that is focused on database and sending data. Examples of the threats are replay attack, man in the middle attack, fake voting data. The test also conclude that the system can provide the privacy of voter and data xii integrity. This theses be used as an alternative way to securing database on some kind e-vote system front-end

Tempora-Fusion: Time-Lock Puzzle with Efficient Verifiable Homomorphic Linear Combination

To securely transmit sensitive information into the future, Time-Lock Puzzles (TLPs) have been developed. Their applications include scheduled payments, timed commitments, e-voting, and sealed-bid auctions. Homomorphic TLP is a key variant of TLP that enables computation on puzzles from different clients. This allows a solver/server to tackle only a single puzzle encoding the computation\u27s result. However, existing homomorphic TLPs lack support for verifying the correctness of the computation results. We address this limitation by introducing Tempora-Fusion, a TLP that allows a server to perform homomorphic linear combinations of puzzles from different clients while ensuring verification of computation correctness. This scheme avoids asymmetric-key cryptography for verification, thus paving the way for efficient implementations. We discuss our scheme\u27s application in various domains, such as federated learning, scheduled payments in online banking, and e-voting

Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus

Time-lock puzzles (TLP) are a fascinating type of cryptographic problem that is easy to generate, but takes a certain time to solve, even when arbitrary parallel speedup is allowed. TLPs have wide-ranging applications including fairness, round efficient computation, and more. To reduce the effort needed to solve large numbers of TLPs, prior work has proposed batching techniques to reduce the cost of solving. However, these proposals either require: (1) a trusted setup or (2) the puzzle size linear in the maximum batch size, which implies setting an a priori bound on the maximum size of the batch. Any of these limitations restrict the utility of TLPs in decentralized and dynamic settings like permissionless blockchains. In this work, we demonstrate the feasibility and usefulness of a TLP that overcomes all of the above limitations. Our construction is based on indistinguishable obfuscation and shows that there are no fundamental barriers in achieving such a TLP construction. As a main application of our TLP, we show how to improve the resilience of consensus protocols toward network-level adversaries in the following two settings: (1) We show a generic compiler that boosts the resilience of a Byzantine broadcast protocol $\Pi$ as follows: if $\Pi$ is secure against $t<n$ weakly adaptive corruptions, then the compiled protocol is secure against $t<n$ strongly adaptive corruptions. Here, `strong\u27 refers to adaptively corrupting a party and deleting messages that it sent while still honest. Our compiler is round and communication preserving, and gives the first expected constant-round Byzantine broadcast protocol against a strongly adaptive adversary for the dishonest majority setting. (2) We adapt the Nakamoto consensus protocol to a weak model of synchrony where the adversary can adaptively create minority partitions in the network. Unlike prior works, we do not assume that all honest messages are delivered within a known upper bound on the message delay. To the best of our knowledge, this is the first work to show that it is possible to achieve consensus in the permissionless setting even after relaxing the standard synchrony assumption