搜索结果: 1-8 共查到“密码学 voting scheme”相关记录8条 . 查询时间(0.14 秒)
A voting scheme with post-quantum security based on physical laws
voting scheme no-key protocol post-quantum security
<
2018/5/22
Traditional cryptography is under huge threat along of the evolution of quantum information and computing. In this paper, we propose a new post-quantum voting scheme based on physical laws by using en...
DRE-ip: A Verifiable E-Voting Scheme without Tallying Authorities
Verifiable E-Voting End-to-End Verifiability E2E
<
2016/7/5
Nearly all verifiable e-voting schemes require trusted tallying
authorities to guarantee voter privacy. An exception is the DRE-i
system which removes this requirement by pre-computing all encrypted...
BeleniosRF: A Strongly Receipt-Free Electronic Voting Scheme
cryptographic protocols e-voting receipt-freeness
<
2015/12/29
We propose a new voting scheme, BeleniosRF, that offers both strong receipt-freeness
and end-to-end verifiability. It is strongly receipt-free in the sense that even dishonest voters
cannot prove ho...
Towards a Practical Cryptographic Voting Scheme Based on Malleable Proofs
Malleable Proofs Distributed Key Generation
<
2014/3/13
Mixnets are one of the main approaches to deploy secret and verifiable electronic elections. General-purpose verifiable mixnets however suffer from the drawback that the amount of data to be verified ...
New Receipt-Free E-Voting Scheme and Self-Proving Mix Net as New Paradigm
cryptographic protocols / election schemes self-proving mix net receipt-freeness
<
2012/3/27
The contribution of this paper is twofold. First we present a new simple electronic voting scheme having standard re-encryption mix net back-end, which allows to cast a ballot and verify its correctne...
Electronic voting is a prime application of cryptographic tools.
Many researches are addressing election or confidence voting in this
area. We address a new type of voting scheme “Divisible Voting
...
An e-Voting Scheme with Improved Resistance to Bribe and Coercion
e-voting scheme receipt-freeness uncoercibility
<
2009/3/31
Bribe and coercion are common in conventional voting systems and usually will lead to a biased result that imparts the desired democracy. However, these problems become more difficult to solve when us...
Probabilistic Opacity for a Passive Adversary and its Application to Chaum’s Voting Scheme
Opacity Non-Interference Chaum’s Voting Scheme
<
2009/1/22
A predicate is opaque for a given system, if an adversary will never be able
to establish truth or falsehood of the predicate for any observed computation. This notion
has been essentially introduce...