Definitionadvanced
Computational indistinguishability
Also called pseudorandomness against bounded tests.
Two distributions are indistinguishable if every efficient distinguisher has advantage only negligible in telling them apart.
Two distributions are indistinguishable if every efficient distinguisher has advantage only negligible in telling them apart.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag SBVWAV Edit this page History Report an error