Paper Info
Title
The Power of Anonymous Veto in Public Discussion
Abstract
The Dining Cryptographers problem studies how to securely compute the boolean-OR function while preserving the privacy of each input bit. Since its first introduction by Chaum in 1988, it has attracted a number of solutions over the past twenty years. In this paper, we propose an exceptionally efficient solution: Anonymous Veto Network (or AV-net). Our protocol is provably secure under the Decision Diffie-Hellman (DDH) and random oracle assumptions, and is better than past work in the following ways. It provides the strongest protection of each input's privacy against collusion attacks; it requires only two rounds of broadcast, fewer than any other solution; the computational load and bandwidth usage are the least among the available techniques; and the efficiency of our protocol is achieved without relying on any private channels or trusted third parties. Overall, the efficiency of our protocol seems as good as one may hope for.
Year
DOI
Venue
2009
10.1007/978-3-642-01004-0_3
Transactions on Computational Science
Keywords
Field
DocType
bandwidth usage,available technique,boolean-or function,efficient solution,collusion attack,anonymous veto network,public discussion,dining cryptographers problem study,input bit,past work,decision diffie-hellman,dining cryptographers problem,secure multiparty computation,provable security,random oracle,secure computation,trusted third party
Dining cryptographers problem,Broadcasting,Secure multi-party computation,Computer security,Computer science,Random oracle,Communication channel,Bandwidth (signal processing),Veto,Collusion,Distributed computing
Journal
Volume
ISSN
Citations 
4
0302-9743
7
PageRank 
References 
Authors
0.49
16
2
Name
Order
Citations
PageRank
Hao Feng140932.15
Piotr Zieliński21266.79