dc.contributor.author |
Svozil, K |
en |
dc.date.accessioned |
2009-04-16T23:15:51Z |
en |
dc.date.available |
2009-04-16T23:15:51Z |
en |
dc.date.issued |
2009-03 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-353 (2009 ) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3860 |
en |
dc.description.abstract |
Some quantum cryptographic protocols can be implemented with specially prepared
chocolate balls, others protected by value indefiniteness cannot. Similarities and differences
of cryptography with quanta and chocolate are discussed. Motivated by these considerations
it is proposed to certify quantum random number generators and quantum cryptographic
protocols by value indefiniteness. This feature, which derives itself from Belland
Kochen-Specker type arguments, is only present in systems with three or more mutually
exclusive outcomes. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial |
en |
dc.title |
Bertlmann's chocolate balls and quantum type cryptography |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |