Post-quantum zero knowledge in constant rounds
Nir Bitansky, Omri Shmueli
Abstract
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.
Topics & Concepts
Learning with errorsZero-knowledge proofCorollaryConstant (computer programming)QuantumZero (linguistics)Homomorphic encryptionArgument (complex analysis)Quantum algorithmComputer scienceConstruct (python library)MathematicsQuantum mechanicsDiscrete mathematicsEncryptionAlgorithmPhysicsCryptographyPhilosophyProgramming languageLinguisticsOperating systemChemistryBiochemistryCryptography and Data SecurityQuantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs