Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Introduction of Cryptographic Protocols

Ling Dong, Kefei Chen

Published Jan 1, 2012• 3 citations
Publisher
DOI
10.1007/978-3-642-24073-7_1

Related papers

Introduction to Cryptographic Protocols

Niels Ferguson, Bruce Schneier, Tadayoshi Kohno

Cryptographic protocols consist of an exchange of messages between participants. Creating secure protocols is challenging. The main problem is that as the designer or implementer has no control over their behavior. This chapter discusses trust, the incentive structure, cryptographic protocols, and messages and steps. Trust is the ultimate basis for all dealings that we have with other people. The incentive structure is another fundamental component of any analysis of a protocol. The function of cryptographic protocols is to minimize the amount of trust required. The function of cryptographic protocols is to minimize the amount of trust required. A typical protocol description consists of a number of messages that are sent between the participants of the protocol and a description of the computations that each participant has to do. Almost all protocol descriptions are done at a very high level.

Wiley eBooks•Oct 6, 2015•1 citation

Background of Cryptographic Protocols

Ling Dong, Kefei Chen

Springer eBooks•Jan 1, 2012•0 citations

Basic Cryptographic Protocols

Albrecht Beutelspacher, Jörg Schwenk, Klaus-Dieter Wolfenstetter

Mathematics study resources•Jan 1, 2026•0 citations

Cryptographic security of quantum key distribution

Christopher Portmann, Renato Renner

This work is intended as an introduction to cryptographic security and a motivation for the widely used Quantum Key Distribution (QKD) security definition. We review the notion of security necessary for a protocol to be usable in a larger cryptographic context, i.e., for it to remain secure when composed with other secure protocols. We then derive the corresponding security criterion for QKD. We provide several examples of QKD composed in sequence and parallel with different cryptographic schemes to illustrate how the error of a composed protocol is the sum of the errors of the individual protocols. We also discuss the operational interpretations of the distance metric used to quantify these errors.

arXiv:1409.3525•Sep 11, 2014•154 citations

Introduction to Quantum Computation and Quantum Cryptographic Protocols

배준우

•Feb 22, 2019•0 citations

Cryptographic Protocols

Hans Delfs, Helmut Knebl

Information security and cryptography•Jan 1, 2015•3 citations
Cryptographic protocols consist of an exchange of messages between participants. Creating secure protocols is challenging. The main problem is that as the designer or implementer has no control over their behavior. This chapter discusses trust, the incentive structure, cryptographic protocols, and messages and steps. Trust is the ultimate basis for all dealings that we have with other people. The incentive structure is another fundamental component of any analysis of a protocol. The function of cryptographic protocols is to minimize the amount of trust required. The function of cryptographic protocols is to minimize the amount of trust required. A typical protocol description consists of a number of messages that are sent between the participants of the protocol and a description of the computations that each participant has to do. Almost all protocol descriptions are done at a very high level.
This work is intended as an introduction to cryptographic security and a motivation for the widely used Quantum Key Distribution (QKD) security definition. We review the notion of security necessary for a protocol to be usable in a larger cryptographic context, i.e., for it to remain secure when composed with other secure protocols. We then derive the corresponding security criterion for QKD. We provide several examples of QKD composed in sequence and parallel with different cryptographic schemes to illustrate how the error of a composed protocol is the sum of the errors of the individual protocols. We also discuss the operational interpretations of the distance metric used to quantify these errors.