Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) (Q6067351)
From MaRDI portal
scientific article; zbMATH DE number 7766977
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) |
scientific article; zbMATH DE number 7766977 |
Statements
Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) (English)
0 references
16 November 2023
0 references
Kolmogorov complexity
0 references
adaptive security
0 references
polynomial evaluation
0 references
verifiable computation
0 references
verifiable delay function
0 references
0 references
0 references
0 references
