Efficient network authentication protocols: Lower bounds and optimal implementations (Q5137012): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: New directions in cryptography / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4099559 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Using encryption for authentication in large networks of computers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The geometrical meaning of time / rank | |||
Normal rank | |||
Latest revision as of 02:20, 24 July 2024
scientific article; zbMATH DE number 7279510
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient network authentication protocols: Lower bounds and optimal implementations |
scientific article; zbMATH DE number 7279510 |
Statements
Efficient network authentication protocols: Lower bounds and optimal implementations (English)
0 references
30 November 2020
0 references
authentication
0 references
key distribution
0 references
protocol metrics
0 references
lower bound
0 references
optimal protocal
0 references
