Rui Shi, Huamin Feng, Chunjie Cao, Yang Yang · 6 authors
Anonymous credentials are an essential cryptography primitive to protect user privacy and provide fine-grained access control for proving ownership and rights of specific credentials. There are currently two roadmaps to designing anonymous credentials: one is signature credentials, which are constructed by signature with efficient protocols and non-interactive zero-knowledge proofs, and the other is functional credentials, which are transformed from predicate encryption schemes. However, none of the existing instances of anonymous credentials support$expressive$access policies expressed as conjunction, disjunction, or arbitrary Boolean formulas, which are particularly useful for cloud services. In this paper, we propose a new fast and expressive anonymous credential, called FEAC. It is constructed with the unique$dual$$randomness$$splitting$technique, which combines the most efficient anonymous key-policy attribute-based encryption (USENIX 24) and short randomizable signature (CT-RSA 18) to balance efficiency, expressiveness, and security, demonstrating a new way to instantiate anonymous credentials. Furthermore, our credential presentation protocol offloads most of the time-consuming computation to the cloud server (11 pairing) to reduce the computational burden on the user side (2 pairing). We propose formal definitions and formal security proofs of FEAC. We provide implementations and evaluate the performance of FEAC, comparing it to state-of-the-art work.
GOWTHAMANI R. GOWTHAMANI R., J. Granty Regina Elwin, Kavin A, Rahul A · 6 authors
Elections are the base for a democratic society, but there are problems like fraud tampering, slow result processing in the current voting systems. To solve these problems, this project introduces a Blockchain-Based Voting System as a scalable solution. This system uses IOTA's Tangle (a Directed Acyclic Graph model) to provide fast, scalable, and feeless transactions, making it suitable for large-scale voting. The personal details are kept secret by using Zero-Knowledge Proofs (ZKPs). A Hybrid Cloud Model is used, where sensitive data is stored securely on private servers, while the public network ensures transparency. Multi-Factor Authentication (MFA) adds an extra layer of security by blocking unauthorized access. By combining these technologies, the system makes voting tamper-proof, keeps voters anonymous, allows real-time result announcements, and protects against frauds. Overall, this solution shows how blockchain can improve the trust, fairness, and accessibility of democratic participation.
The security of blockchain systems relies on the honest majority assumption. However, strategic mining threatens this assumption, because selfish miners can gain more block rewards than honest miners by attacks such as withholding blocks. Due to its significant implication, blockchain mining games have been studied in PoW and PoS under various settings using different methods. Nonetheless, this paper argues that the practical limitation of random beacons has not been exploited in strategic mining in PoS blockchains. Current PoS blockchains use random beacons to randomly select validators for each slot. However, the randomness is usually fixed for multiple slots, due to the latency of distributed random beacon protocols. This indicates that validators actually know some information about the election result in the future, which contrasts with the Markov process models in previous analysis. Using this information, this paper presents a close to optimal mining strategy based on an optimal interval scheduling algorithm for each epoch. For proof-of-stake protocols with no propagation delay, we show that a validator with arbitrary proportion of stake can strictly benefit from strategic mining and get significantly higher block rewards than the previous strategies.
C Ratna Prabha, K Mahesh Babu, Kattinti Dheeraj, N Varsha Priya · 5 authors
"Non-Fungible Tokens" (NFTs) have revolutionized digital ownership by enabling verifiable, unique assets on the blockchain. In this paper, we present an advanced, secure, and scalable "NFT marketplace" built on Ethereum, leveraging Zero-Knowledge Proofs (ZKPs), multi-signature wallets, and AI-driven threat detection to enhance security and decentralization. We implement ERC-721 and ERC-1155 standards, integrate Layer 2 solutions (Polygon zkEVM, Arbitrum) for cost efficiency, and introduce decentralized identity (DID) verification to prevent fraud. Our smart contracts were thoroughly tested using Slither, MythX, and manual audits, while the frontend employs React.js with WalletConnect v2 for cross-wallet compatibility. We also propose a novel royalty enforcement mechanism using ERC2981 with automated payouts via Chainlink Automation. Performance benchmarks demonstrate sub-second transaction finality on Layer 2 and gas cost reductions of up to 90% compared to traditional Ethereum mainnet deployments.
Nurhajar Anugraha, Muhammad Riswanto, Lindawati Lindawati, Asrul Asrul
Penelitian ini bertujuan untuk mengembangkan sistem e-voting berbasis blockchain dengan autentikasi biometrik sidik jari serta penerapan protokol zero-knowledge proofs sebagai pengamanan tambahan terhadap data pemilih dan hasil suara. Permasalahan utama yang dihadapi dalam sistem pemungutan suara elektronik konvensional adalah rendahnya kepercayaan terhadap keamanan data dan potensi manipulasi hasil. Metode penelitian yang digunakan mencakup perancangan sistem dengan arsitektur client-server, implementasi teknologi blockchain untuk pencatatan suara yang terenkripsi, serta integrasi biometrik sidik jari menggunakan BiometricPrompt API pada Android. Selain itu, sistem diverifikasi dengan kode OTP melalui email institusional sebagai bentuk validasi ganda pengguna. Hasil pengujian menunjukkan bahwa sistem dapat berjalan dengan baik dan memberikan keamanan yang tinggi karena setiap data suara tersimpan secara permanen dan tidak dapat diubah di jaringan blockchain. Autentikasi biometrik juga memastikan bahwa setiap pemilih terverifikasi secara unik sehingga tidak terjadi pemungutan suara ganda. Dengan demikian, sistem e-voting ini dinilai layak diterapkan untuk lingkungan akademik dan dapat dikembangkan lebih lanjut untuk pemilihan umum berskala lebih besar.
Jimmy Jimmy, Kenny Rimba, Vincent Vincent, Ronsen Purba · 5 authors
E-voting systems are prone to challenges such as lack of transparency, risks of data manipulation, and dependence on centralized authorities, which can undermine trust in electoral processes. This research develops a blockchain-based e-voting system on the Polygon network, leveraging smart contracts and Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (ZK-SNARK) to enhance security, transparency, and voter anonymity. The study employs an application development approach, implementing a structured methodology with initialization, registration, voting, and tallying phases. Smart contracts automate voter verification, vote casting, and result tabulation, while ZK-SNARK ensures voters can cast ballots anonymously without revealing their identities. The system’s transparency and immutability are tested using PolygonScan, demonstrating effective prevention of manipulations like double voting through cryptographic credentials (nullifier, commitment, and nullifier hash) and Merkle Tree structures. Results indicate that the system provides a secure, verifiable, and decentralized framework for elections. This implementation offers a robust foundation for future e-voting systems, promoting trust and integrity in digital voting processes.
Persistent electoral irregularities—ranging from vote manipulation and ballot stuffing to logistical failures and post-election violence—continue to undermine democratic consolidation across developing democracies. Nigeria, Africa’s largest democracy, epitomizes this crisis, where recurrent allegations of fraud, digital failures, and institutional mistrust have eroded public confidence in electoral outcomes. This paper proposes a secure, transparent, and technically robust blockchain-based electoral framework tailored for developing democracies. Leveraging the core attributes of blockchain—immutability, decentralization, real-time auditability, and cryptographic security—we design a technical architecture for voter registration, ballot casting, vote tallying, and public verification. The system integrates smart contracts, Proof of Authority (PoA) consensus, cryptographic identity verification, and zero-knowledge proofs to ensure integrity, privacy, and resilience. We analyze implementation challenges including the digital divide, cybersecurity threats, and legal gaps, and propose a phased, stakeholder-driven roadmap anchored in Nigeria’s institutional context. Comparative insights from Estonia, Sierra Leone, and Brazil underscore the importance of local ownership, institutional autonomy, and civic literacy. The paper contributes a practical, context-sensitive blueprint for blockchain-based electoral reform, bridging the gap between theoretical innovation and real-world deployment in fragile democratic ecosystems.
Prof. Madhavi Bhosale, Abhishek Kangude, Vedant Khandare, Sunil Kajave
Abstract In recent years, advancements in blockchain technology have paved the way for creating transparent, secure, and decentralized digital ecosystems. This paper presents a blockchain-based electronic voting (e-voting) system designed to overcome the limitations of traditional and centralized electronic voting methods. The proposed system integrates Solidity-based smart contracts, a Python middleware API using Web3.py, and a Flutter frontend to create a secure, verifiable, and user-friendly voting platform. The architecture ensures voter anonymity, immutability of votes, and real-time result verification through blockchain’s decentralized ledger. The system employs MetaMask for voter authentication, enabling a one-person-one-vote mechanism and eliminating centralized control or tampering risks. Experimental simulations using Ganache demonstrate efficient transaction processing, transparent result computation, and tamper-proof data storage. The proposed solution enhances security, transparency, and trust in digital elections and serves as a foundation for scalable, real-world implementations in organizational, academic, and governmental voting scenarios. This research contributes toward developing next-generation decentralized voting infrastructures that reinforce democratic integrity and public confidence in electoral processes. · Keywords : Blockchain Technology; E-Voting System; Smart Contracts; Decentralized Applications (DApps); Solidity; Ethereum; Python Web3.py; Flutter Frontend; MetaMask Authentication; Digital Elections; Voter Privacy; Transparency; Immutability; Secure Voting; Electronic Governance
S. N. Jain, Rupprashik A. Khare, Samyak Lahire, Chaitali Patil
There are more than over 23,000 cryptocurrencies” in existence which represent one of the biggest unregulated markets across the globe. Currently, each cryptocurrency utilises distinct public-private key and public address formats. This diversity complicates the investigator's task of tracing and verifying a suspect's involvement in cryptocurrency-related crimes. Moreover, law enforcement agencies such as the police frequently seize digital devices, generating digital disk images for investigation which is a time consuming process. Thus, the investigation of cryptocurrencies has emerged as a major challenge. for law enforcement agencies across the world. Our proposed solution “CryptoKalp” aims to combat cybercrimes involving cryptocurrencies. The essence of our proposed tool is encapsulated in its name: “CryptoKalp.” The name is a fusion of two significant terms - “crypto,” signifying cryptocurrency, and “kalp,” a Sanskrit word representing investigation [1]. Our proposed tool makes the investigation process quicker by taking digital images, strings, various formats of files and folders as input and utilising a comprehensive database of regular expressions covering various cryptocurrency public-private key and address formats. Currently, our tool successfully identifies Bitcoin public-private keys and addresses from text files, with future plans outlined expanding its capabilities for Ether, Tether, Monero, Dash and Dogecoin. Investigating officers can access the system's user-friendly interface and the database containing login credentials, cryptocurrency formats, and history of searched strings, which enables officers to track a specific criminal associated with a series of crypto transactions. Police can confirm whether a suspect is involved in cryptocurrency transactions and take necessary actions. Our solution will aid law enforcement authorities in combating cybercrime.
Anders Malta Jakobsen, Oliver Holmgaard, Daniele Dell’Aglio, Michele Albano
As Ethereum is one of the most popular blockchains, it is naturally targeted by various attacks, aiming, for example, to disrupt the service or steal tokens. Among these, in deanonymization attacks, an adversary can obtain validator IP addresses and then perform a Denial-of-Service attack on them. To mitigate this attack, the Ethereum foundation is proposing Whisk, a Single Secret Leader Election protocol that uses a zero-knowledge proof called Curdleproofs to prove the validity of a shuffle of validators. One limitation of Curdleproofs is the shuffle size, which must be a power of two, restricting the number of validators that can be included. This paper overcomes this limitation by proposing CAAUrdleproofs, a modified version of Curdleproofs that incorporates Springproofs. Our experiments show that CAAUrdleproofs offers a performance advantage for any shuffle size that is not a power of two and that this advantage increases as the shuffle size decreases below a power of two.
Shwetha K R, Divya G S, Bhavan Pande, Darshan K · 6 authors
Due to the ever-increasing demand to use safe and reliable electronic votes, a blockchain-based secure voting system has been developed to enhance transparency, trustfulness, and voter recognition. This system eliminates such issues as voting fraud, impersonation, and manipulating the results by means of biometric verification and decentralized blockchain ledger. The voters are matched to a facial-recognition database containing previously registered voters before voting. It is authenticated by a K-Nearest Neighbors (KNN) approach as it works well on classifying facial features and is not very laborious. After the vote is successfully authenticated, it is stored and signed on a blockchain network where it cannot be altered by another party. The features of smart contracts ensure the safety of voting, the correct counting of votes, and the awareness of each network node of what is happening. The cryptography of hashing and decentralized make certain that the votes are immutable, due to the decentralized structure of blockchain and consensus mechanisms. The face-matching module ensures that only the qualified individuals are allowed to vote. The system also supports mass elections and guarantees the ease of interaction among the voters. It was designed in such a way that it is scalable and user friendly. Trust, security, and efficiency are enhanced in the system through biometrical authentication, distributed ledger technology, encryption, and classification through machine-learning. It is highly dependable in how to conduct the current digital elections.
Centralized control of vote counting and result declaration is vulnerable to attacks that compromise election integrity, fairness, and transparency. We present a Web3-based system to decentralize the processing of tally sheets generated at polling stations. Our analysis focuses on the electoral systems of Venezuela and Ecuador, both of which rely on a centralized tally sheet processing procedure. We evaluate the vulnerabilities of this approach and propose a solution based on permissioned blockchains and decentralized storage, using Ecuador’s system as a case study. Our solution ensures integrity, fairness, and transparency throughout the digitalization, transmission, processing, and publication of tally sheets and election results. We developed a basic prototype using Hyperledger Fabric and IPFS.
P Arockia Mary, Saranya R, Dharanitha S, Dhanya S · 6 authors
In the contemporary democratic scenario, the secure, transparent, and trustworthy nature of digital elections is of ultimate importance. This objective is achieved via the innovative approach of Hybrid Proof-of-Stake (PoS) and Zero-Knowledge Proof (ZKP) based E-Voting System, which enhances integrity and overcomes challenges faced by the existing models. In contrast to the classical Proof-of-Authority (PoA) model, in which validators are pre-approved, the Hybrid PoS within this system decentralizes the selection of validators by the participation of all network members. It mitigates the risks of centralization and ensures fairness. The voting begins with Voter Registration, wherein Decentralized Identity (DID) establishes that the voter is eligible without revealing any relevant identity information. Through ZKP, voters authenticate their eligibility to vote and, further, acquire a voting token through a smart contract, granting them possible access to the election. Validators are selected dynamically on the basis of stake contributions in that PoS mode to ensure periodic rotation among validators to avoid collusion. In the Vote Casting Phase, ZKP encryption ensures the secrecy of the vote while allowing for its independent verification. Votes are stored immutably on the blockchain, transaction hashes being made available for the independent verification of individual votes. The Vote Validation Phase ensures that PoS-selected validators authenticate the votes and prevent double voting while enforcing the election rules to minimize manipulation risk. Finally, during the Vote Tallying & Result Declaration Phase, the smart contract tallies results and records the information permanently on a blockchain for the purposes of both transparency and protection. This system integrates Hybrid PoS for secure selection of validators and ZKP for privacy-protecting authentication, forming a scalable, fraud-resistant and verifiable e-voting framework.
The conventional voting systems are flawed in terms of integrity and security since they lack the challenge of public transparency and trust. The potential of blockchain technology lies in the ability of the technology to guarantee data integrity, decentralize the procedures via diverse networks, and certify sophisticated security services. The paper delves into the application of blockchain in election processes through the analysis of the performance of blockchain to provide secure, tamper-free and transparent voting systems. The introductory section gives some background of the voting process which requires a firmer mechanism and anti-fraud evidence in the same. Part two of this work describes what the literature on the topic of research has to say about voting solutions that are based on blockchain technology. The paper describes the Proof of Work (PoW) protocol, Proof of Stake (PoS) and Practical Byzantine Fault Tolerance (PBFT) protocols. It examines encrypted data techniques in Zero-Knowledge Proofs (ZKPs) and cryptography AES and RSA. The paper also expounds the compatibility of smart contracts with automated voter verification systems and dealing with ballot collection and release of results. This paper will explain blockchain electorate architecture and its key challenges to implementation which include scalability problem, rules and access. The article mentions future of blockchain application in elections to show how blockchain technology application may make the election process more open and create a more trustful voter base. With this review, it is possible to understand how blockchain can be used to make elections more transparent and make citizens trust the democratic process.
Decentralized Autonomous Organization operates without a central entity, being owned and governed collectively by its members. In this organization, decisions are carried out automatically through smart contracts for routine tasks, while members vote for unforeseen issues. Scalability in decisionmaking through voting on proposals is essential to accommodate a growing number of members without sacrificing security. This paper addresses this challenge by introducing a scalable and secure DAO voting system that ensures security through Groth16 zk-SNARKs and exponential ElGamal encryption algorithm while achieving scalability by verifiably delegating heavy computations to untrusted entities. While offline computation on the exponential ElGamal homomorphic encryption algorithm is enabled to reduce the computational cost of the blockchain, Groth16 is allowed to maintain robust off-chain calculation without revealing any further details. Specifically, the Groth16 proof guarantees that (i) the encrypted votes accurately reflect the voter's voting power, ensuring no unauthorized weight manipulation; (ii) only valid non-negative vote values are encrypted, preventing unintended or malicious vote tampering; and (iii) the homomorphic summation is performed correctly. The implementation shows that the proofs are verified remarkably fast, making the S2DV protocol highly suitable for scalable DAO voting, while preserving the security of the election.
A blockchain-enabled Model integrates blockchain technology with Intrusion Detection Systems to enhance the security of Internet of Things (IoT) networks. It ensures data integrity, decentralization, and tamper-proof logging of intrusion detection. The approach improves trust, transparency, and real-time threat detection in distributed IoT environments. The existing blockchain-based IDS approaches, Blockchain Enabled (BCE-IoT), uniquely integrate blockchain consensus with federated-style local training, lightweight cryptography, and Shapley Additive Explanations (SHAP)-based explainability, ensuring both security and interpretability in IoT environments. The proposed work combines Blockchain technology with explainable artificial intelligence solutions to create a new cybersecurity Model that strengthens intrusion detection within IoT networks. The proposed model enhances transparency in tracking cyberattacks by combining blockchain security storage capabilities with SHAP, an explainable AI. This research utilises machine learning and artificial intelligence to detect threats in real-time, countering Distributed Denial of Service (DDoS), Denial of Service (DoS), scanning, Cross-Site Scripting (XSS), injection, password, and backdoor attacks. BCE-IoT delivers more precise security by combining blockchain’s permanent data features and AI anomaly detectors, thereby reducing security alert mistakes. The performance effectiveness of Blockchain-Enabled IoT surpasses that of the Content Integrity Detection System. It combines Blockchain and Software-Defined Networking to enhance security in network environments, utilising blockchain-based mutual confirmation for software-defined networking to detect and block cyber threats. The evaluation establishes BCE-IoT as an effective IoT network security solution that delivers strong cybersecurity features, is adaptable to modern connected environments, and offers interpretable security solutions. The performance evaluations demonstrate that BCE-IoT provides a robust, flexible, and interpretable cybersecurity solution suitable for modern IoT environments.
Saud Sultan Al Qasimi, Qassim Nasir, Manar Abu Talib
Secure, trustworthy electronic elections require four key properties: verifiable eligibility, strong ballot privacy, revoting for coercion resistance, and nation-scale throughput. Existing blockchain-based prototypes address these goals only in fragments, while verified credential to Zero Knowledge Proof (ZKP) conversion is ad hoc, re-voting schemes leak timing data or exhaust gas limits, and “track-your-vote” features issue receipts that a coercer can demand. ZKP-E-Vote closes these gaps with a fully specified architecture. A compulsory UAE-Pass login feeds a Groth16 circuit that converts government credentials into a non-linkable pseudonym$P$and a zero-knowledge eligibility proof. Ballots embed a monotone counter and a hash-derived nullifier, enabling any voter to overwrite a coerced ballot while revealing nothing regarding their re-vote. After polls close, threshold-decryption verification rooms let citizens confirm their own ballots without exporting a receipt; while a public zk-proof concurrently attests that every tallied ciphertext is the latest for its pseudonym and that the homomorphic total matches the announced result. All proofs are generated off-chain and recursively aggregated; relay nodes batch thousands of ballots into roll-up blocks, fixing onchain state at one 32-byte slot per voter, and bounding verification to a single pairing check per batch. The framework thus unites eligibility privacy, coercion-safe revoting, receipt-free voter assurance, and national-scale feasibility in a single auditable design, offering a concrete roadmap toward a pilot-ready blockchain election system.
The integrity, coupled with the transparency of electoral systems, is vital for the existence of a democratic society if that society is to function well. Often, conventional electronic voting mechanisms are criticized for their security vulnerabilities, with a lack of transparency, together with limited public trust. Blockchain technology has come about to be a possible enabler for trustless and immutable systems. However, such a standard, privacy-preserving, verifiable voting model remains elusive. This work seeks to fill this void with the use of a blockchain e-voting system that uses QR codes to validate voters, cryptographically ensures integrity with the EFFT-SWIFFT hash, and also handles ballots through smart contracts. A feature matrix together with a visual chart was used in a systematic literature review of 28 peer-reviewed papers to analyze and compare authentication methods, transparency techniques, consensus mechanisms, and scalability solutions. Though the analysis reveals that entities greatly underutilize advanced cryptographic primitives such as zero-knowledge proofs and post-quantum hashing, these primitives potentially improve privacy and also verifiability. Present in the proposed model is a multi-layered architecture. Also, the model can offer a secure as well as transparent solution for addressing these gaps. Blockchain-based e-voting can increase trust, reduce fraud, and broaden democratic participation, but it requires real-world validation through pilot projects and usability testing.
Open access
Internet Traffic Analysis and Secure E-voting
Advanced Steganography and Watermarking Techniques
Purpose: This paper formulates a new theoretical framework to address the principal-agent problem in representative democracy through a dynamic voting mechanism. Based on Rousseau’s concept of the general will and contemporary analyses of corporate influence in politics, I build a rigorous mathematical model that enables voters to maintain continuous oversight over their elected representatives. Design/methodology/approach: I developed a rigorous mathematical model integrating an anonymous blockchain-based voting system. This system allows voters or voter groups to continuously monitor their representatives while preserving their privacy through zero-knowledge proofs. The model uses game theory and extends Condorcet’s Jury Theorem to analyze voter behavior under dynamic oversight conditions. Findings: The results show that such a system can encourage a more responsible form of representative democracy while maintaining electoral stability. Detailed implementation architectures show that the model is not only theoretically rigorous but also practically feasible through advanced cryptographic tools. Practical implications: The proposed architecture enables real-time voter engagement without compromising privacy, providing a blueprint for secure, transparent, and scalable voting systems applicable in modern democratic systems. Originality/value: This research combines political theory, cryptographic system design, and social choice theory to propose a new paradigm for democratic governance. The integration of zero-knowledge proofs with dynamic feedback mechanisms offers a scalable solution to fundamental challenges of voter privacy and election integrity, with far-reaching implications for democratic theory and its practical application.
Xiangyun Tang, Minyang Li, Tao Zhang, Yijing Lin · 7 authors
In low-altitude networks, various aerial platforms such as unmanned aerial vehicles and airships cooperate to provide services including real-time monitoring, emergency response, and data collection. These platforms often operate with limited computing resources, restricted energy supply, and unstable wireless connectivity, making centralized data processing inefficient and prone to privacy risks. Federated Learning (FL) provides a promising solution by enabling multiple platforms to collaboratively train a shared model without exchanging raw data. However, the presence of Byzantine clients and a potentially malicious server poses serious threats to the robustness and trustworthiness of FL in such environments. Existing Byzantine-robust FL methods typically assume a semi-honest server and rely on auxiliary information such as clean datasets or known attacker ratios, which limits their applicability in dynamic and non-IID scenarios. In this paper, we propose zkFL, a Byzantine-robust FL framework that embeds zero-knowledge proofs to ensure verifiable aggregation under a malicious server. ZkFL allows clients to verify the correctness of server-side aggregation and dynamically adjusts client weights based on inference-guided detection, without relying on external datasets. Each round includes a zk-SNARK proof to guarantee aggregation integrity while preserving gradient privacy. Experiments demonstrate that zkFL exhibits strong robustness and verifiability in both IID and non-IID settings, outperforming prior methods, even in the presence of a malicious server.