The following pages link to (Q4638056):
Displaying 11 items.
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- Tightly secure signature schemes from the LWE and subset sum assumptions (Q2330120) (← links)
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions (Q2661695) (← links)
- Correction to: ``Locally computable UOWHF with linear shrinkage'' (Q2697675) (← links)
- (Q5090388) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
