Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cryptographic hardness under projections for time-bounded Kolmogorov complexity |
scientific article |
Statements
Cryptographic hardness under projections for time-bounded Kolmogorov complexity (English)
0 references
20 April 2023
0 references
Kolmogorov complexity
0 references
interactive proofs
0 references
minimum circuit size problem
0 references
worst-case to average-case reductions
0 references
0 references
0 references
