5 matches found
Succinct Arguments for QMA in the Quantum Random Oracle Model
Succinct arguments are a fundamental cryptographic primitive for verifying computational claims with small communication. In the classical setting, succinct arguments for NP can be constructed from unstructured hardness alone e.g., hash functions by compiling probabilistically checkable proofs PC...
Succinct Arguments for QMA from Collapsing Hash Functions
We prove the existence of succinct arguments for QMA, assuming only the existence of collapsing hash functions. This is the first scheme that relies only on unstructured "Minicrypt'' assumptions, which are not known to imply public-key encryption. Our main technical contribution is a...
Malicious code in @zalastax/nolb-qma (npm)
The package @zalastax/nolb-qma was found to contain malicious code. --- Credit: OpenSSF source...
