Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Mark Zhandry:

TR21-126 | 25th August 2021
Yilei Chen, Qipeng Liu, Mark Zhandry

Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering

Revisions: 1

We show polynomial-time quantum algorithms for the following problems:
(*) Short integer solution (SIS) problem under the infinity norm, where the public matrix is very wide, the modulus is a polynomially large prime, and the bound of infinity norm is set to be half of the modulus minus a ... more >>>

TR21-038 | 15th March 2021
Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry

Post-Quantum Succinct Arguments

Revisions: 1

We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any collapsing hash function (which in turn exist based on the post-quantum hardness of Learning with Errors).

At the heart of our proof is a new ... more >>>

ISSN 1433-8092 | Imprint