On using probabilistic Turing machines to model participants in cryptographic protocols (Q391316)
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: On using probabilistic Turing machines to model participants in cryptographic protocols |
scientific article; zbMATH DE number 6244155
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On using probabilistic Turing machines to model participants in cryptographic protocols |
scientific article; zbMATH DE number 6244155 |
Statements
On using probabilistic Turing machines to model participants in cryptographic protocols (English)
0 references
10 January 2014
0 references
provable security
0 references
probabilistic Turing machine
0 references
\(\mathbb Z\)-algebra
0 references
cryptographic protocol
0 references
0 references
0 references
