BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
PRODID::-//Obvius//NONSGML ICal//DA
BEGIN:VEVENT
UID:2158690@qmath.ku.dk
DESCRIPTION:Speaker: Daniel Nagaj (Slovak Academy of Sciences)
\nAbstract:
 
\nUnlike classical money\, which is hard to forge for practical reasons (
 e.g. producing paper with a certain property)\, quantum money is attractiv
 e because its security might be based on the no-cloning theorem. The first
  quantum money scheme was introduced by Wiesner circa 1970. Although more 
 sophisticated quantum money schemes were proposed\, Wiesner's scheme remai
 ned appealing because it is both conceptually clean and relatively easy to
  implement.
\n
\nWe show efficient adaptive attacks on Wiesner's quantum m
 oney scheme (and its variant by Bennett et al.)\, when valid money is acce
 pted and passed on\, while invalid money is destroyed. We propose two atta
 cks\, the first is inspired by the Elitzur-Vaidman bomb testing problem\, 
 while the second is based on the idea of protective measurements. It allow
 s us to break Wiesner's scheme with 4 possible states per qubit\, and gene
 ralizations which use more than 4 states per qubit. \n\nhttps://qmath.ku.
 dk/events/quantum-lunch/quantum-lunch-2015/20-15/
SUMMARY:Quantum Lunch: An adaptive attack on Wiesner's quantum money
LOCATION:The Quantum Lunch room\, 04.4.20
ORGANIZER:Mark Rudner
DTSTART:20150513T100000Z
DTSTAMP:20150513T100000Z
DTEND:20150513T110000Z
END:VEVENT
END:VCALENDAR