from    
to    
search  

 


Symmetry restoration and quantum Mpemba effects in chaotic andlocalization sy...
Quantum Gases 2024
Stories of Fermions in an Optical Box
Contractive Unitary and Classical Shadow Tomography
报告题目:
All problems in statistical zero-knowledge have a classical protocol secure against both classical and quantum verifiers
 报告人:
Shengyu Zhang
California Institute of Technology
报告时间:
2007-03-27 14:00
报告地点:
FIT-4-603
主办单位:
清华大学理论计算机科学研究中心
  简介:

l         报告

One of the main impacts of quantum computation thus far has been its

potential implications for cryptography. Understanding which

cryptosystems are secure against quantum computers is one of the

fundamental questions in the field. A central concept in cryptography is

that of a zero-knowledge protocol. Recently Watrous [STOC'06] showed

that two specific well-known classical interactive protocols continue to

be zero-knowledge against quantum verifiers with quantum auxiliary

input. We greatly extends this result by showing that any problem $L$ in

Statistical Zero-Knowledge (SZK) has a fully classical protocol that is

SZK against both classical and quantum (possibly cheating) verifiers.

This answers an open question in [Watrous, STOC'06], and generalizes a

classical result by Goldreich, Sahai and Vadhan who showed that HVSZK =

SZK. As their result, ours does not depend on any computational assumption.

 

My talk will assume "zero knowledge" on quantum computing; the problem

will soon reduce to a purely classical task.

 

Joint work with Sean Hallgren, Alexandra Kolla and Pranab Sen.

今日相关信息
公开讲座:欧洲商标法的新近发展和前沿问题
收益管理研究的新进展
“馆藏书刊检索与获取”——“了解图书馆”...
CHARTING EXPERIMENTS FOR CITIES OF TH...
 
同类别相关信息
开题与立项前的文献调研概述
国内外学位论文的检索与获取
外文电子图书数据库检索与利用
Web of Science 引文数据库的检索与利用
IEEE/IET Digital Library (IEL)和A...
学术活动