![]() |
![]() |
University of Birmingham > Talks@bham > Computer Security Seminars > BeleniosRF: A Non-Interactive Receipt-Free Electronic Voting Scheme
BeleniosRF: A Non-Interactive Receipt-Free Electronic Voting SchemeAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Andreea Radu. We propose a new voting scheme, BeleniosRF, that offers both receipt-freeness and end-to-end verifiability. It is receipt-free in a strong sense, meaning that even dishonest voters cannot prove how they voted. We provide a game-based definition of receipt-freeness for voting protocols with non-interactive ballot casting, that we name strong receipt-freeness (sRF). To our knowledge, sRF is the first game-based definition of receipt-freeness in the literature, and it has the merit of being particularly concise and simple. Built upon the Helios protocol, BeleniosRF inherits from its simplicity, and does not require revoting nor an untappable channel. We implement BeleniosRF, and show its feasibility in a number of platforms, including desktop computers and smartphones. This talk is part of the Computer Security Seminars series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsRSLC PhD/Postdoc Seminars (Chemistry) Combinatorics and Probability seminar Data Science and Computational Statistics SeminarOther talksKolmogorov-Smirnov type testing for structural breaks: A new adjusted-range based self-normalization approach TBA Harness light-matter interaction in low-dimensional materials and nanostructures: from advanced light manipulation to smart photonic devices Title tbc Bases for permutation groups TBA |