A computational indistinguishability logic for the bounded storage model (Q2889822)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A computational indistinguishability logic for the bounded storage model |
scientific article; zbMATH DE number 6043828
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational indistinguishability logic for the bounded storage model |
scientific article; zbMATH DE number 6043828 |
Statements
A Computational Indistinguishability Logic for the Bounded Storage Model (English)
0 references
8 June 2012
0 references
provable cryptography
0 references
formal verification
0 references
computational model
0 references
bounded storage model
0 references
0.7670658230781555
0 references
0.7606285214424133
0 references
0.7589119672775269
0 references
0.7585495114326477
0 references
0.7522179484367371
0 references
