Explicit randomness is not necessary when modeling probabilistic encryption (Q2866728)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6238542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Explicit randomness is not necessary when modeling probabilistic encryption |
scientific article; zbMATH DE number 6238542 |
Statements
13 December 2013
0 references
probabilistic
0 references
encryption
0 references
security models
0 references
protocol verification
0 references
secrecy
0 references
authentication
0 references
Explicit randomness is not necessary when modeling probabilistic encryption (English)
0 references
0.7561058402061462
0 references
0.734488844871521
0 references
0.7317110896110535
0 references
0.7284426689147949
0 references
0.7269026041030884
0 references
