Verification methods for the computationally complete symbolic attacker based on indistinguishability (Q4972166)
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: Verification methods for the computationally complete symbolic attacker based on indistinguishability |
scientific article; zbMATH DE number 7135665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Verification methods for the computationally complete symbolic attacker based on indistinguishability |
scientific article; zbMATH DE number 7135665 |
Statements
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability (English)
0 references
22 November 2019
0 references
authentication
0 references
Dolev-Yao model
0 references
computational model
0 references
computational soundness
0 references
first-order logic
0 references
secrecy
0 references
0.7834363579750061
0 references
0.7391930818557739
0 references
0.7382494211196899
0 references
0.7382420301437378
0 references
