[Theory-Talk] [Talk] 2016/11/25 New constructions for Quantum Money

[洪琮眩]

Topic：New constructions for Quantum Money

Speaker：Mr. Marios Georgiou (Computer Science, City University of New York)

Location：*Auditorium 106 at IIS new Building*

Date： *2016/11/25, "Friday" 10:00~12:00 (Sorry for the mistake)*

*Abstract: *

Quantum money (QM) is a cryptographic primitive in which a trusted party
(bank) is able to use its secret key to create money and everyone who
possesses some money can verify its validity. The verification procedure
may require communication with the bank (in which case the scheme is called
secret key QM) or not (public key QM). Security of a QM scheme requires
that no algorithm that is given access to the verification procedure and n
valid coins can come up with m>n valid coins.

We propose a secret key QM scheme that requires only classical
communication with the Bank and moreover consists of only one round; a
classical query to the bank and a yes/no answer from the bank. The scheme
is based on the notion of Quantum Retrieval Games.  Moreover, we propose a
public key QM scheme that uses one-time memories as a building block and is
secure in the classical random oracle model. This construction is derived
naturally from our secret-key scheme using the fact that one-time memories
are a special case of quantum retrieval games.

Joint work with Iordanis Kerenidis.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.iis.sinica.edu.tw/pipermail/theory-talk-announcement/attachments/20161121/4d96d949/attachment.html>