Post-quantum zero knowledge in constant rounds

@article{Bitansky2019PostquantumZK,
  title={Post-quantum zero knowledge in constant rounds},
  author={Nir Bitansky and Omri Shmueli},
  journal={Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing},
  year={2019}
}
  • Nir Bitansky, Omri Shmueli
  • Published 2019
  • Computer Science, Mathematics, Physics
  • Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
We construct a constant-round zero-knowledge classical argument for NP secure against quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and other standard primitives, known based on the Learning with Errors Assumption for quantum algorithms. As a corollary, we also obtain a constant-round zero-knowledge quantum argument for QMA. At the heart of our protocol is a new no-cloning non-black-box simulation technique. 
Post-Quantum Multi-Party Computation in Constant Rounds
TLDR
The first constant-round post-quantum multi-party computation protocol for general classical functionalities in the plain model is obtained, with security against malicious corruptions, and a new straight-line non-black-box simulator against parallel verifiers that does not clone the adversary's state is built. Expand
A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round
TLDR
A new quantum rewinding technique is introduced that enables a simulator to extract a committed message of a malicious verifier while simulating verifier's internal state in an appropriate sense. Expand
One-Way Functions Imply Secure Computation in a Quantum World
We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious transfer (QOT), which is known to suffice for secure computation of arbitrary quantum functionalities.Expand
The Round Complexity of Quantum Zero-Knowledge
TLDR
This is the first protocol for constant-round statistical zero-knowledge arguments for QMA, and matches the best round complexity known for the corresponding protocols for NP with security against classical adversaries. Expand
Classical zero-knowledge arguments for quantum computations
We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classicalExpand
Indistinguishability Obfuscation of Null Quantum Circuits and Applications
TLDR
It is shown how quantum null-iO enables a series of new cryptographic primitives that, prior to this work, were unknown to exist even making heuristic assumptions. Expand
Circuit Privacy for Quantum Fully Homomorphic Encryption
TLDR
A generic transformation from semi-honest to malicious circuit privacy for quantum fully homomorphic encryption (QFHE) is presented, assuming the quantum hardness of (a circular variant of) the learning with errors (LWE) problem. Expand
Non-interactive classical verification of quantum computation
TLDR
This work shows that the interactive protocol Mahadev constructed can in fact be performed non-interactively and in zero-knowledge, and establishes the security of the protocols under standard assumptions in quantum-secure cryptography. Expand
Candidate Obfuscation of Null Quantum Circuits and Witness Encryption for QMA
TLDR
Heuristically instantiating the classical oracle with quantum-secure indistinguishability obfuscation for classical circuits gives the first candidate construction of null-iO for quantum circuits. Expand
Non-malleable Commitments against Quantum Attacks
TLDR
This work constructs the first non-malleable commitments secure against quantum attacks, and preserves the quantum security of the underlying extractable commitments, and is new even in the classical setting. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 113 REFERENCES
Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks
The concept of zero-knowledge (ZK) has become of fundamental importance in cryptography. However, in a setting where entities are modeled by quantum computers, classical arguments for proving ZK failExpand
Quantum Proofs of Knowledge
TLDR
It is shown that there are zero-knowledge quantum proofs of knowledge for all languages in NP (assuming quantum 1-1 one-way functions) using a new quantum rewinding technique. Expand
Classical Homomorphic Encryption for Quantum Circuits
  • U. Mahadev
  • Computer Science, Mathematics
  • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
TLDR
The scheme allows a classical client to blindly delegate a quantum computation to a quantum server: an honest server is able to run the computation while a malicious server is unable to learn any information about the computation. Expand
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
TLDR
The randomness protocol can be used as the basis for an efficiently verifiable "quantum supremacy" proposal, thus answering an outstanding challenge in the field. Expand
Zero-Knowledge against Quantum Attacks
TLDR
This paper proves that several interactive proof systems are zero-knowledge against general quantum attacks, and establishes for the first time that true zero- knowledge is indeed possible in the presence of quantum information and computation. Expand
Constant-Round Concurrent Zero Knowledge from P-Certificates
We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol relies on the existence of families of collision-resistant hash functions, and a new, but in our eyes, naturalExpand
Classical Cryptographic Protocols in a Quantum World
TLDR
The result shows that the basic two-party feasibility picture from classical cryptography remains unchanged in a quantum world, and shows the existence of classical two- party protocols for the secure evaluation of any polynomial-time function under reasonable computational assumptions. Expand
Two-Message Statistical Sender-Private OT from LWE
TLDR
This work provides the first (presumed) post-quantum secure candidate and thus allows to instantiate the aforementioned applications in a post-Quantum secure manner. Expand
Zero-Knowledge Proof Systems for QMA
TLDR
This work proves that every problem in the complexity class QMA has a quantum interactive proof system that is zero-knowledge with respect to efficient quantum computations. Expand
Computationally Binding Quantum Commitments
TLDR
A new definition of computationally binding commitment schemes in the quantum setting, which is called "collapse-binding", applies to string commitments, composes in parallel, and works well with rewinding-based proofs. Expand
...
1
2
3
4
5
...