Open AccessPriVeto: a fully private two‐round veto protocol
Author(s) -
Bag Samiran,
Azad Muhammad Ajmal,
Hao Feng
Publication year - 2019
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2018.5115
Subject(s) - veto , commit , computer science , protocol (science) , boolean function , theoretical computer science , computation , discrete mathematics , computer security , mathematics , algorithm , law , political science , medicine , alternative medicine , pathology , politics , database
In 2006, Hao and Zieliński presented a two‐round veto protocol named anonymous veto network (AV‐net), which is exceptionally efficient in terms of the number of rounds, computation and bandwidth usage. However, AV‐net has two generic issues: (i) a participant who has submitted a veto can find out whether she is the only one who vetoed; (ii) the last participant who submits her input can pre‐compute the Boolean‐OR result before submission, and may amend her input based on that knowledge. These two issues generally apply to any multi‐round veto protocol where participants commit their input in the last round. In this study, the authors propose a novel solution to address both issues within two rounds, which are the best possible round efficiency for a veto protocol. Their new private veto protocol, called PriVeto, has similar system complexities to AV‐net, but it binds participants to their inputs in the very first round, eliminating the possibility of runtime changes to any of the inputs. At the end of the protocol, participants are strictly limited to learning nothing more than the output of the Boolean‐OR function and their own inputs.