Name
Abstract | ||
|---|---|---|
A Blind Coupon Mechanism (BCM) allows spreading of alerts quietly and quickly over unreliable networks. The BCM primitive ensures that alerts are efficiently broadcast while the nature of these signals are securely hidden. However, current BCM proposals are limited to indicating a single bit of information and also lack natural privacy properties. In this paper, we develop a new BCM solution that allows the transmission of several alerts privately and in one shot. This extension perfectly suits a new kind of applications, that is (absolute) veto voting over unreliable networks, in which multiple decisions are reached using only simple peer-to-peer communications. Our enhanced BCM efficiently supports the spread of votes over unreliable networks while hiding whether these votes contain any or several vetoes. We prove our BCM solution secure and illustrate its use for veto voting protocols in limited communication infrastructures. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-35423-7_13 | PROGRESS IN CRYPTOLOGY - INDOCRYPT 2019 |
Keywords | Field | DocType |
Blind Coupon Mechanism, Veto voting system, Untraceability | Coupon,Broadcasting,Voting,Computer science,Computer network,One shot,Theoretical computer science,Veto | Conference |
Volume | ISSN | Citations |
11898 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Colin Boyd | 1 | 48 | 4.62 |
| Kristian Gjøsteen | 2 | 0 | 0.34 |
| Clémentine Gritti | 3 | 1 | 1.75 |
| Thomas Haines | 4 | 5 | 10.26 |