Jump to ContentJump to Main Navigation
Everyday CryptographyFundamental Principles and Applications$
Users without a subscription are not able to see the full content.

Keith Martin

Print publication date: 2017

Print ISBN-13: 9780198788003

Published to Oxford Scholarship Online: July 2017

DOI: 10.1093/oso/9780198788003.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 05 December 2021

Cryptographic Protocols

Cryptographic Protocols

(p.325) 9 Cryptographic Protocols
Everyday Cryptography

Keith M. Martin

Oxford University Press

This chapter is concerned with cryptographic protocols. We begin with an explanation of what components a cryptographic protocol consists of. We then illustrate the complexity of designing a secure cryptographic protocol by considering an artificially simple scenario, for which we propose and analyse seven candidate protocols. For each of these protocols, we comment on whether, or under which conditions, they meet the required specification. We go on to look at the important class of authentication and key establishment protocols. We identify typical goals and examine some important protocols in this class, including the Diffie–Hellman protocol.

Keywords:   Cryptographic protocol, Authentication and key establishment, Diffie–Hellman protocol, Station-to-station protocol, Entity authentication, Perfect forward secrecy

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .