Show simple item record

dc.contributor.authorVaccaro, J.
dc.contributor.authorSpring, Joseph
dc.contributor.authorChefles, Anthony
dc.date.accessioned2013-09-17T09:15:21Z
dc.date.available2013-09-17T09:15:21Z
dc.date.issued2007-01
dc.identifier.citationVaccaro , J , Spring , J & Chefles , A 2007 , ' Quantum protocols for anonymous voting and surveying ' , Physical Review A , vol. 75 , no. 1 , 012333 . https://doi.org/10.1103/PhysRevA.75.012333
dc.identifier.issn1094-1622
dc.identifier.otherPURE: 848334
dc.identifier.otherPURE UUID: f297376d-9f4f-4da4-a3d5-c4b6ef37874e
dc.identifier.otherArXiv: http://arxiv.org/abs/quant-ph/0504161v2
dc.identifier.otherScopus: 33846587575
dc.identifier.otherORCID: /0000-0002-2251-2838/work/60314467
dc.identifier.urihttp://hdl.handle.net/2299/11590
dc.description.abstractWe describe quantum protocols for voting and surveying. A key feature of our schemes is the use of entangled states to ensure that the votes are anonymous and to allow the votes to be tallied. The entanglement is distributed over separated sites; the physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The security of these protocols with respect to various kinds of attack is discussed. We also discuss classical schemes and show that our quantum voting protocol represents a N-fold reduction in computational complexity, where N is the number of voters.en
dc.format.extent8
dc.language.isoeng
dc.relation.ispartofPhysical Review A
dc.titleQuantum protocols for anonymous voting and surveyingen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionScience & Technology Research Institute
dc.description.statusPeer reviewed
rioxxterms.versionAM
rioxxterms.versionVoR
rioxxterms.versionofrecordhttps://doi.org/10.1103/PhysRevA.75.012333
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record