Abstract. Smart contracts on a blockchain behave exactly as specified by their code. To be sure that a smart contract behaves as expected, the end-user has to either analyze its code or trust a potentially anonymous developer or auditor to do so. This approach proposes a smart contract deployment and management platform that can execute development tools and code quality tools in a trusted way and uses this to reduce the trust required into the smart contract developer or auditor. Additionally, such a platform can provide new capabilities for developers aiding them in the creation of smart contracts.
is crucial to protect BP against present and future adversaries, thus, not relying on computational intractability.However, REV schemes often apply cryptographic protocols based on Mixnets or Homomorphic Encryption, which rely on hardness assumptions to achieve BP [27]. Thus, Unconditional BP (UP) does not assume computational intractability and eliminates the need for Trusted Third Parties (TTP) [36]. Minimizing trust assumptions and removing the reliance on TTPs for specific tasks within the voting process is a fundamental argument for decentralized voting systems, e.g., for voting in a consortium of industry participants. Instead of relying on TTPs, the UP-based REV system can be fully decentralized. Since most prior work on REV does not achieve UP, they rely on a TTP or base their privacy on a secret shared between multiple trusted entities [36].AEternum's voting scheme provides UP and does not rely on a single trusted authority [36]. In order to achieve UP, the deployment of a decentralized PBB is required. Distributed Ledgers (DL) offer a suitable approach to deploy a Decentralized PBB (DPBB) to achieve such a distribution of trust among authorities [29]. DLs are tamper-proof and immutable, replicate data securely, making them ideal for storing ballots that should not be manipulated by anyone [30].This paper proposes AEternum, the first DL-based REV system combining a voting scheme with UP and a public permissioned DL, which serves as a DPBB. AEternum's voting scheme is based on Non-Interactive Zero-Knowledge Proofs (NIZKP) [36]. UP holds under the assumption of the existence of a PBB and an anonymous channel [37]. Furthermore, the trust assumptions do not impact UP, but are fundamental for verifiability and correctness i.e., trusted authorities are required for fairness. For instance, homomorphic threshold encryption is used to disallow trend analysis during an open voting period. Computational intractability assumptions are only relevant during the voting period to prevent the creation of invalid votes [36].The remainder of the paper is organized as follows. While essential definitions are presented in Section II, Section III discusses AEternum's system design followed by the implementation details in Section IV. Section V renders the discussion, Section VI outlines the security analysis and VII the evaluation. Finally, Section IX draws conclusions and outlines future work.Abstract-Remote Electronic Voting (REV) systems allow voters to cast their votes in an uncontrolled, distributed environment. At the same time, the REV system must provide ballot privacy and verifiability of the final tally. Research has proposed REV schemes offering ballot privacy based on computational intractability assumptions, but only a few provide Unconditional Privacy (UP).Therefore, this work proposes AEternum, a REV system with a voting scheme providing UP. AEternum does not require trust in a central authority, nor does it assume computational intractability of an underlying mathematical problem to provide UP. To satisfy UP's...
No abstract
Public blockchains in support of Smart Contracts (SC), like Ethereum enable everyone to represent scarce, valuable resources (like cryptocurrencies) as so-called tokens. Token issuing and management was the first blockchain use case. However, programming languages and runtime systems used in the current blockchains for their SCs lack a secure and straightforward way to implement and handle tokens. The unnecessary complexity in doing so can lead to erroneous implementation of tokens and applications built on top of these, including the loss or theft of tokens as it happened. The most known attack was "TheDAO" attack which led to the "loss" of tokens, valued at that time at approximately 60 M US Dollar. A better and secure token representation directly embedded into a SC runtime and SC programming language could prevent loss of tokens. Thus this paper presents an approach including parts of a programming language using it. The core of the model is to use opaque and substructural data types together with an on-chain soundness checker to generically represent tokens securely as values similar to integers and booleans. Opaque data types enforce that only a designated piece of code can create values of that type. The substructural data types allow values to express scarcity by preventing the duplication and elimination of values. The on-chain soundness checker ensures that the deployed code does not violate guarantees given by the type system, which includes opaque and substructural data types.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.