Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Lập kế hoạch học tập (KHHT) thích hợp và phù hợp với khả năng: tùy theo khả năng của mình các bạn có thể lập KHHT từ 3,5 năm đến 4,5 năm. Tuy nhiên nếu học lực của mình không phải là xuất sắc thì các bạn nên lập KHHT trong 4 năm là vừa (trung bình 1 học kỳ 17 – 18 tín chỉ); các bạn không nên sắp quá nhiều môn thực tập trong một học kỳ vì các bạn phải đầu tư rất nhiều thời gian cho các môn này nếu muốn có kết quả tốt. Bên. | ffl Coercion-Resistant Tallying For STV Voting Coercion-Resistant tallying for STV voting Vanessa Teague Kim Ramchen and Lee Naish Department of Computer Science and Software Engineering The University of Melbourne vteague leeg@csse.unimelb.edu.au kramchen@gmail.com Abstract There are many advantages to voting schemes in which voters rank all candidates in order rather than just choosing their favourite. However these schemes inherently suffer from a coercion problem when there are many candidates because a coercer can demand a certain permutation from a voter and then check whether that permutation appears during tallying. In this paper we solve this problem for the popular STV system by constructing an algorithm for the verifiable tallying of encrypted votes. Our construction improves upon existing work because it extends to multiple-seat STV and reveals less information than other schemes. 1 Introduction In elections of all kinds it is important that voters are free of coercion votes are tallied correctly and this is seen to be the case. Electronic voting could improve the situation some schemes offer universal verifiability meaning that anyone can check that the announced tally is correct. Ideally it should be unnecessary to trust either the implementors of the program or the security of the computer used for voting. However electronic voting systems must take particular care to prevent a voter from being able to prove to a coercer how they voted. This property is known as receipt freeness or coercion resistance . Without it a coercer can either promise to reward a voter if they show they voted in a particular way or threaten to cause harm to them if they do not. Although many electronic voting systems are designed for first-past-the-post voting the best voting schemes are those that allow voters to express more than simply their single favourite candidate. The tally method we target is known as Single Transferrable Vote STV 1. It can be used to fill single or