Crypto on QIP Conference Website

Communication, Crypto and IT (Chair: Martin Larocca)

Mon, 01 Jan 0001 00:00:00 +0000

Communication, Crypto and IT (Chair: Martin Larocca)

Mon, 01 Jan 0001 00:00:00 +0000

Invited Talk: ''Adventures in Quantum Wonderland: Understanding Cryptographic Hardness in a Quantum World''

Mon, 01 Jan 0001 00:00:00 +0000

Bio

Dakshita Khurana is …

Abstract

A flurry of exciting, recent work has shown that the mathematical hardness required to realize cryptosystems such as bit commitments and secure computation in a quantum world can be significantly weaker than the hardness required for classical cryptography. This talk will discuss recent progress and some remaining challenges in understanding the assumptions that enable cryptography in a quantum world.

Invited Talk: ''Adventures in Quantum Wonderland: Understanding Cryptographic Hardness in a Quantum World''

Mon, 01 Jan 0001 00:00:00 +0000

Bio

Dakshita Khurana is …

Abstract

Invited Talk: ''Quantum cryptography without one-way functions''

Mon, 01 Jan 0001 00:00:00 +0000

Bio

Tomoyuki Morimae is …

Abstract

The existence of one-way functions is the minimum assumption in classical cryptography. On the other hand, in quantum cryptography where quantum computing and quantum communications are possible, recent studies have demonstrated that the existence of one-way functions is not necessarily the minimum assumption. Several new fundamental primitives have been introduced, such as pseudorandom unitaries, pseudorandom states, one-way state generators, EFI pairs, and one-way puzzles. They seem to be weaker than one-way functions, but still imply many useful applications, such as secret-key encryption, message authentication codes, digital signatures, private-key quantum money, commitments, and multiparty computations, etc. In this talk, I explain the basics of this “quantum cryptography without one-way functions” and give many open problems that I want to know the answers to.