ABSTRACT
Vote privacy is a fundamental right, which needs to be protec服务器托管网ted
not only during an election, or for a limited time afterwards, but
for the foreseeable future. Numerous electronic voting (e-voting)
protocols have been proposed to address this challenge, striving
for everlasting privacy. This property guarantees that even computationally unbounded adversaries cannot break privacy of past
elections.
The broad interest in secure e-voting with everlasting privacy has
spawned a large variety of protocols over the last three decades.
These protocols differ in many aspects, in particular the precise
security properties they aim for, the threat scenarios they consider,
and the privacy-preserving techniques they employ. Unfortunately,
these differences are often opaque, making analysis and comparison
cumbersome.
In order to overcome this non-transparent state of affairs, we systematically analyze all e-voting protocols designed to provide everlasting privacy. First, we illustrate the relations and dependencies
between all these different protocols. Next, we analyze in depth
which protocols do provide secure and efficient approaches to evoting with everlasting privacy under realistic assumptions, and
which ones do not. Eventually, based on our extensive and detailed
treatment, we identify which research problems in this field have
already been solved, and which ones are still open.
Altogether, our work offers a well-founded reference point for conducting research on secure e-voting with everlasting privacy as well
as for future-proofing privacy in real-world electronic elections
服务器托管，北京服务器托管，服务服务器托管网器租用 http://www.fwqtg.net
机房租用，北京机房租用，IDC机房托管， http://www.fwqtg.net
相关推荐: CVPR 2023 | RCF：完全无监督的视频物体分割
TLDR: 视频分割一直是重标注的一个task，这篇CVPR 2023文章研究了完全不需要标注的视频物体分割。仅使用ResNet，RCF模型在DAVIS16/STv2/FBMS59上提升了7/9/5%。文章里还提出了不需要标注的调参方法。代码已公开可…
