Fetching the paper…
Reading the bibliography…
In known constructions of classical zero-knowledge protocols for NP, either of zero-knowledge or soundness holds only against computationally bounded adversaries.
The complexity of perfect zero-knowledge (extended abstract)
Lance Fortnow · 1987
Earlier work this paper cites.
The knowledge complexity of interactive proof systems
Shafi Goldwasser, Silvio Micali, and Charles Rackoff · 1989
Earlier work this paper cites.
Definitions and properties of zero-knowledge proof systems
Oded Goldreich and Yair Oren · 1994
Earlier work this paper cites.
Is quantum bit commitment really possible?
Hoi-Kwong Lo and H. F. Chau · 1997
Earlier work this paper cites.
Unconditionally secure quantum bit commitment is impossible
Dominic Mayers · 1997
Earlier work this paper cites.
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
Oded Goldreich, Amit Sahai, and Salil P. Vadhan · 1998
Earlier work this paper cites.
Limits on the power of quantum statistical zero-knowledge
John Watrous · 2002
Earlier work this paper cites.
Non-interactive quantum perfect and statistical zero-knowledge
Hirotada Kobayashi · 2003
Earlier work this paper cites.
Computational collapse of quantum state with application to oblivious transfer
Claude Crépeau, Paul Dumais, Dominic Mayers, and Louis Salvail · 2004
Earlier work this paper cites.
Zero-knowledge proofs and string commitments withstanding quantum attacks
Ivan Damgård, Serge Fehr, and Louis Salvail · 2004
Earlier work this paper cites.
A tight high-order entropic quantum uncertainty relation with applications
Ivan Damgård, Serge Fehr, Renato Renner, Louis Salvail, and Christian Schaffner · 2007
Earlier work this paper cites.
Interactive and noninteractive zero knowledge are equivalent in the help model
André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, and Salil P. Vadhan · 2008
Earlier work this paper cites.
Zero-knowledge against quantum attacks
John Watrous · 2009
Earlier work this paper cites.
Random oracles in a quantum world
Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, and Mark Zhandry · 2011
Cited alongside, same era.
Everlasting multi-party computation
Dominique Unruh · 2013
Cited alongside, same era.
Revocable quantum timed-release encryption
Dominique Unruh · 2015
Cited alongside, same era.
Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
Jun Yan, Jian Weng, Dongdai Lin, and Yujuan Quan · 2015
Cited alongside, same era.
Zero-knowledge proof systems for QMA
Anne Broadbent, Zhengfeng Ji, Fang Song, and John Watrous · 2016
Cited alongside, same era.
Oracle separations for quantum statistical zero-knowledge
Sanketh Menda and John Watrous · 2018
Cited alongside, same era.
Post-quantum zero knowledge in constant rounds
Nir Bitansky and Omri Shmueli · 2020
Later among the works it cites.
Zvika Brakerski and Henry Yuen · 2020
Later among the works it cites.
Non-interactive zero-knowledge arguments for QMA, with preprocessing
Andrea Coladangelo, Thomas Vidick, and Tina Zhang · 2020
Later among the works it cites.
How to base security on the perfect/statistical binding property of quantum bit commitment?
Junbin Fang, Dominique Unruh, Jian Weng, Jun Yan, and Dehua Zhou · 2020
Later among the works it cites.
Quantum computationally predicate-binding commitment with application in quantum zero-knowledge argument for NP
Jun Yan · 2020
Later among the works it cites.
Classical binding for quantum commitments
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum security proofs using semi-classical oracles
Andris Ambainis, Mike Hamburg, and Dominique Unruh · 2019
Cited alongside, same era.
Perfect zero knowledge for quantum multiprover interactive proofs
Alex Bredariol Grilo, William Slofstra, and Henry Yuen · 2019
Cited alongside, same era.
A note on key agreement and non-interactive commitments
Alex Lombardi and Luke Schaeffer · 2019
Cited alongside, same era.
How to record quantum queries, and applications to quantum indifferentiability
Mark Zhandry · 2019
Cited alongside, same era.
Non-interactive classical verification of quantum computation
Gorjan Alagic, Andrew M. Childs, Alex B. Grilo, and Shih-Han Hung · 2020
Cited alongside, same era.
QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
Anne Broadbent and Alex B. Grilo · 2020
Cited alongside, same era.
Nir Bitansky and Zvika Brakerski · 2021
Closest in time.
On the round complexity of secure quantum computation
James Bartusek, Andrea Coladangelo, Dakshita Khurana, and Fermi Ma · 2021
Closest in time.
Candidate obfuscation of null quantum circuits and witness encryption for QMA
James Bartusek and Giulio Malavolta · 2021
Closest in time.
The round complexity of quantum zero-knowledge
Orestis Chardouvelis and Giulio Malavolta · 2021
Closest in time.
Quantum encryption with certified deletion, revisited: Public key, attribute-based, and classical communication
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, and Takashi Yamakawa · 2021
Closest in time.
Classically verifiable (dual-mode) NIZK for QMA with preprocessing
Tomoyuki Morimae and Takashi Yamakawa · 2021
Closest in time.
Multi-theorem designated-verifier NIZK for QMA
Omri Shmueli · 2021
Closest in time.