搜索结果: 1-5 共查到“军事学 Election”相关记录5条 . 查询时间(0.046 秒)
Constructing secret, verifiable auction schemes from election schemes
Auctions elections privacy
2016/1/27
Auctions and elections are seemingly disjoint research fields. Nevertheless,
we observe that similar cryptographic primitives are used in both
fields. For instance, mixnets, homomorphic encryption, ...
Election Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ
election schemes individual verifiability universal verifiability
2016/1/3
Definitions of election verifiability in the computational model of cryptography are proposed. The definitions formalize notions of voters verifying their own votes, auditors verifying the tally of vo...
We study ballot secrecy and ballot independence for election schemes.
First, we propose a definition of ballot secrecy as an indistinguishability
game in the computational model of cryptography. Our...
Election Verifiability or Ballot Privacy: Do We Need to Choose?
public-key cryptography electronic voting scheme provable everlasting privacy
2013/4/18
We propose a new encryption primitive, \emph{commitment consistent encryption} (CCE), and instances of this primitive that enable building the first universally verifiable voting schemes with a perfec...
A Latency-Free Election Scheme
Latency-Free Election Scheme multiparty computation problem pseudo-random function
2008/12/24
We motivate and describe the problem of finding protocols for multiparty
computations that only use a single broadcast round per computation
(latency-free computations). We show that solutions exist...