A secure voting scheme based on rational self-interest
نویسندگان
چکیده
منابع مشابه
A Secure Internet Voting Scheme
We describe information security requirements for a secure and functional Internet voting scheme. Then we present the voting scheme with multiple parties; this voting scheme satisfies all these security requirements. In this scheme, the voter gets a signed key from the registrar, where the registrar signs the key as blinded. The voter uses this signed key during the voting period. All other par...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملA homomorphic encryption - based secure electronic voting scheme
In this paper we propose a homomorphic encryption-based secure electronic voting scheme that is based on [5]. It guarantees eligibility, unreusability, privacy, verifiability and also receipt-freeness and uncoercibility. The scheme can be implemented in a practical environment, since it does not use voting booth or untappable channel, only anonymous channels are applied.
متن کاملA Secure and Anonymous Electronic Voting Scheme Based on Key Exchange Protocol
Voter anonymity and voting correctness are important issues for electronic voting mechanisms. Compared electronic voting with traditional 1elections, an electronic voter is able to cast his/her ballot through the Internet in any place and at any time if he/she can access the network. Therefore, convenience and mobility make electronic voting become more and more popular and electronic voting ca...
متن کاملa star identification algorithm based on a voting scheme for star trackers
star identification is one of the most important stages in attitude determination with star trackers. this can be performed using matching algorithms between observed stars and a master star catalogue. the main challenge in this approach is to provide a fast and reliable identification algorithm that is sufficiently robust in different pointing views of the star tracker optical system in the sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2012
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-012-0248-1