The computational SLR: a logic for reasoning about computational indistinguishability (Q3060197): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Logics for reasoning about cryptographic constructions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Safe recursion with higher types and BCK-algebra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Foundations of Cryptography / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Notions of computation and monads / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank | |||
Normal rank | |||
Latest revision as of 12:35, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational SLR: a logic for reasoning about computational indistinguishability |
scientific article |
Statements
The computational SLR: a logic for reasoning about computational indistinguishability (English)
0 references
1 December 2010
0 references
0 references
