An Algebraic Characterization of Security of Cryptographic Protocols

Details An Algebraic Characterization of Security of Cryptographic Protocols An Algebraic Characterization of Security of Cryptographic Protocols

2008-02-22

arxiv.org/abs/0802.3328v1

Computer Science

Cryptography and Security

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An Algebraic Characterization of Security of Cryptographic Protocols does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Algebraic Characterization of Security of Cryptographic Protocols, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algebraic Characterization of Security of Cryptographic Protocols will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-303357