An Algebraic Characterization of Security of Cryptographic Protocols
| dc.creator | Patra, Manas K | |
| dc.creator | Zhang, Yan | |
| dc.date | 2008-02-22 | |
| dc.date.accessioned | 2026-07-07T09:22:47Z | |
| dc.date.available | 2026-07-07T09:22:47Z | |
| dc.description | Several of the basic cryptographic constructs have associated algebraic structures. Formal models proposed by Dolev and Yao to study the (unconditional) security of public key protocols form a group. The security of some types of protocols can be neatly formulated in this algebraic setting. We investigate classes of two-party protocols. We then consider extension of the formal algebraic framework to private-key protocols. We also discuss concrete realization of the formal models. In this case, we propose a definition in terms of pseudo-free groups. | |
| dc.identifier | https://arxiv.org/abs/0802.3328 | |
| dc.identifier | http://arxiv.org/abs/0802.3328 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155499 | |
| dc.subject | Cryptography and Security | |
| dc.title | An Algebraic Characterization of Security of Cryptographic Protocols | |
| dc.type | text |