Name
Abstract | ||
|---|---|---|
The correctness of an authentication protocol is based on, among others, the relation between nonces and data that is established in the course of execution of the protocol. In this paper, we formulate an inference system that derives the secrecy of nonces and the relation that binds nonces and data. It is easy to show the correctness of a protocol by directly deriving the binding relation using the inference rules. Depending on situations, it is also possible to extend the inference system by simply adding new inference rules. We give some example protocols whose correctness can only be shown using some conditions on nonces that are formulated as additional inference rules. |
Year | Venue | Keywords |
|---|---|---|
2002 | ISSS | authentication protocol,additional inference rule,inference system,example protocol,binding relation,new inference rule,inference rule,binds nonce |
Field | DocType | Volume |
Cryptographic protocol,Computer science,Secrecy,Correctness,Theoretical computer science,Authentication protocol,Rule of inference,Inference system,Cryptographic nonce | Conference | 2609 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-00708-3 | 1 |
PageRank | References | Authors |
0.37 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masami Hagiya | 1 | 649 | 102.85 |
| Ryo Takemura | 2 | 85 | 9.52 |
| Koichi Takahashi | 3 | 38 | 6.30 |
| Takamichi Saito | 4 | 56 | 18.52 |