Vis enkel innførsel

dc.contributor.authorGjøsteen, Kristian
dc.contributor.authorGritti, Clementine Jeanne Pierrette
dc.contributor.authorBoyd, Colin Alexander
dc.contributor.authorHaines, Thomas Edmund
dc.date.accessioned2020-04-06T16:42:55Z
dc.date.available2020-04-06T16:42:55Z
dc.date.created2020-01-09T22:54:54Z
dc.date.issued2019
dc.identifier.citationLecture Notes in Computer Science (LNCS). 2019, 11898 250-270.en_US
dc.identifier.issn0302-9743
dc.identifier.urihttps://hdl.handle.net/11250/2650538
dc.description.abstractA 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.en_US
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.titleA Blind Coupon Mechanism Enabling Veto Voting over Unreliable Networksen_US
dc.typePeer revieweden_US
dc.typeJournal articleen_US
dc.description.versionacceptedVersionen_US
dc.source.pagenumber250-270en_US
dc.source.volume11898en_US
dc.source.journalLecture Notes in Computer Science (LNCS)en_US
dc.identifier.doi10.1007/978-3-030-35423-7_13
dc.identifier.cristin1769904
dc.relation.projectNorges forskningsråd: 275516en_US
dc.description.localcodeThis is a post-peer-review, pre-copyedit version of an article. Locked until 19.11.2020 due to copyright restrictions. The final authenticated version is available online at: http://dx.doi.org/10.1007/978-3-030-35423-7_13en_US
cristin.unitcode194,63,15,0
cristin.unitcode194,63,30,0
cristin.unitnameInstitutt for matematiske fag
cristin.unitnameInstitutt for informasjonssikkerhet og kommunikasjonsteknologi
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode1


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel