Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Formal security proofs with minimal fuss: implicit computational complexity at work |
scientific article |
Statements
Formal security proofs with minimal fuss: implicit computational complexity at work (English)
0 references
4 May 2015
0 references
lambda-calculus
0 references
safe recursion
0 references
probabilistic computation
0 references
cryptography
0 references
0 references
