Hiding in plain sight: memory-tight proofs via randomness programming (Q2170068)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7577774
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hiding in plain sight: memory-tight proofs via randomness programming |
scientific article; zbMATH DE number 7577774 |
Statements
Hiding in plain sight: memory-tight proofs via randomness programming (English)
0 references
30 August 2022
0 references
provable security
0 references
memory-tightness
0 references
time-memory trade-offs
0 references
0 references
0 references
0 references
0.8408963084220886
0 references
0.8380500078201294
0 references
0.8220894932746887
0 references
0.7972091436386108
0 references
0.791719913482666
0 references
