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

Cambridge University Press eBooks

Cryptographic protocols for security and identification

Richard E. Blahut

Published Mar 27, 2014• 0 citations
Publisher

Abstract

The methods of cryptography can be successful only if they are properly incorporated into an application. A cryptographic technique can be unbreakable as such, and yet could still be insecure if it is used unwisely. This observation motivates the subject of security protocols. A security protocol consists of a formal method of using a cryptographic technique in a practical application. Without a well-defined security protocol, a perfectly secure cryptographic technique could be compromised by its use.

DOI
10.1017/cbo9781139013673.015

Related papers

General Cryptographic Protocols

Oded Goldreich

The design of secure protocols that implement arbitrarily desired functionalities is a major part of modern cryptography. Taking the opposite perspective, the design of any cryptographic scheme may be viewed as the design of a secure protocol for implementing a suitable functionality. Still, we believe that it makes sense to differentiate between basic cryptographic primitives (which involve little interaction) like encryption and signature schemes, on the one hand, and general cryptographic protocols, on the other hand. In this chapter we consider general results concerning secure multi –party computations, where the two –party case is an important special case. In a nutshell, these results assert that one can construct protocols for securely computing any desirable multi–party functionality (see the following terminology). Indeed, what is striking about these results is their generality, and we believe that the wonder is not diminished by the (various alternative) conditions under which these results hold. Our focus on the general study of secure multi–party computation (rather than on protocols for solving specific problems) is natural in the context of the theoretical treatment of the subject matter. We wish to highlight the importance of this general study to practice. Firstly, this study clarifies fundamental issues regarding security in a multi–party environment. Secondly, it draws the lines between what is possible in principle and what is not. Thirdly, it develops general techniques for designing secure protocols. And last, sometimes it may even yield schemes (or modules) that may be incorporated in practical systems.

Cambridge University Press eBooks•May 10, 2004•69 citations

Quantum Cryptography: A Novel Approach to Secure Communications

Dr. Emily Chen

Quantum cryptography represents a revolutionary paradigm shift in secure communication by leveraging the principles of quantum mechanics to guarantee unbreakable encryption. Unlike classical cryptographic methods dependent on computational hardness, quantum cryptography exploits quantum phenomena such as superposition and entanglement to provide provable security against eavesdropping. This paper explores fundamental quantum cryptographic protocols, their operational principles, and recent advances that enable practical deployment. We further discuss challenges, implementation issues, and the future scope of quantum key distribution (QKD) technologies in securing global communication infrastructures

American Journal Of Cryptography And Network Security•Jun 30, 2024•0 citations

Quantum Cryptography

Shashi Bhushan

In today’s world, security in data communication has become a top-most priority in every organization. In general, cryptography is defined as the methodology to ensure data is secure by employing suitable encryption and decryption techniques. On the transmitter side, the original message is encrypted using a key. Then the encrypted data is decrypted with the duplicate key at the receiver side as per the accepted protocol between the two parties. In conventional cryptographic techniques, eavesdropping is prevented from accessing the contents of encrypted message by employing certain mathematical function and techniques, but this security methodology does not guarantee any key security. In many scenarios, a secure communication link is established by using a key, but a third party with a bad intent may steal the session keys, giving rise to data security, getting compromised. So in this regard, quantum cryptography is a better alternative when it comes to data security integrity. In this research, a detail about quantum cryptography is elaborated on, and also discussed are various concepts like single photon protocol, loss of data in quantum computing, how quantum is affecting computer communication systems. In conventional cryptographic methodology of data transmission and reception, there is always a probability of eavesdropping leading to the compromising of data integrity and security. The solution to this problem can be obtained by integrating the quantum cryptographic technique with data at the sender as well as the receiver, to detect and minimize various errors by employing suitable bit error scheme. This involves the usage of programming language specific to quantum computing like qcl and quipper to achieve efficient encryption and decryption with faster processing capability.

CRC Press eBooks•Jun 14, 2022•2 citations

Security and Composition of Cryptographic Protocols: A Tutorial

Ran Canetti

What does it mean for a cryptographic protocol to be “secure”? Capturing security properties of cryptographic protocols in a meaningful way is a slippery business: On the one hand, we want to guarantee that a security property holds in face of “all feasible attacks” against a protocol. On the other hand, we want our formalism to not be overly restrictive; that is, we want to accept those protocols that do not succumb to “feasible attacks”.

IOS Press eBooks•Jan 1, 2013•42 citations

Making unbreakable code

Justin Mullins

A product is on the way that relies on the quantum properties of photons to keep out eavesdroppers. All of them. The battle between codemakers and codebreakers is centuries old, but at the start of the 21st century, could it finally be drawing to a close? Physicists are putting the finishing touches to a method of encrypting messages that is more secure than anything that has gone before. Unlike the ciphers of the past, this new method has the potential to be absolutely unbreakable, not just practically unbreakable, but theoretically unbreakable. Mathematicians believe they can prove it. Central to the technique are the strange laws of quantum mechanics. Already experimental messages encrypted using quantum mechanics are being sent over tens of kilometers of optical fibers and received securely. Researchers are confident that it will not be long before ultra-secret messages are routinely transmitted in this way. But while quantum cryptography may be perfect in theory, practical considerations introduce security loopholes that an eavesdropper can exploit. The seriousness of these is still unclear, and physicists believe they can plug most of the holes with more efficient equipment. Still, enough cracks remain to maintain a healthy interest among cryptographers.

IEEE Spectrum•May 1, 2002•12 citations

Secure Session Framework: An Identity-based Cryptographic Key Agreement and Signature Protocol

Christian Schridde

Cryptographic protocols are used to encrypt data during their transmission over a network or to store it on a data carrier. This thesis is about the method of identity-based encryption. In this form of encryption, the name or identity of the target subject is used to encrypt the data. This property makes it a perfect tool for modern electronic communication, because all involved identities and endpoint addresses (e.g. IP addresses) have to be unique worldwide and must be known in order to establish a communication. The identity-based key agreement protocol that has been invented in this thesis has several advantages compared to existing schemes. One important property is its complete independence of key generators. This independence allows each participating security domain to set up and maintain its own key generator. They are not forced to agree on a common setup or a common secret anymore. Due to the properties of the protocol, the security domains are still compatible to each other. Users from one security domain can communicate with users from another security domain using encryption. This new property of independence is also carried over to a signature protocol. It allows users from different security domains to sign a certain object. Additionally, the act of signing is independent and the signers do not need to communicate with each other. Apart from the protocol and its security proofs with respect to standard definitions from the literature, the thesis contains an analysis of existing schemes. Attacks on known protocols and assumptions are presented, and it is shown under which circumstances these become insecure. On the one hand, a completely new approach that is based on defined or rather undefined objects in discrete structures is used. On the other hand, the method of lattice based reduction is successfully applied to the new area of secret sharing schemes. Finally, application scenarios for the protocol are presented. These scenarios are chosen such that the advantages of the protocol become apparent. Cryptographic protocols are used to encrypt data during their transmission over a network or to store it on a data carrier. This thesis is about the method of identity-based encryption. In this form of encryption, the name or identity of the target subject is used to encrypt the data. This property makes it a perfect tool for modern electronic communication, because all involved identities and endpoint addresses (e.g. IP addresses) have to be unique worldwide and must be known in order to establish a communication. The identity-based key agreement protocol that has been invented in this thesis has several advantages compared to existing schemes. One important property is its complete independence of key generators. This independence allows each participating security domain to set up and maintain its own key generator. They are not forced to agree on a common setup or a common secret anymore. Due to the properties of the protocol, the security domains are still compatible to each other. Users from one security domain can communicate with users from another security domain using encryption. This new property of independence is also carried over to a signature protocol. It allows users from different security domains to sign a certain object. Additionally, the act of signing is independent and the signers do not need to communicate with each other. Apart from the protocol and its security proofs with respect to standard definitions from the literature, the thesis contains an analysis of existing schemes. Attacks on known protocols and assumptions are presented, and it is shown under which circumstances these become insecure. On the one hand, a completely new approach that is based on defined or rather undefined objects in discrete structures is used. On the other hand, the method of lattice based reduction is successfully applied to the new area of secret sharing schemes. Finally, application scenarios for the protocol are presented. These scenarios are chosen such that the advantages of the protocol become apparent. The first application is telephony, GSM as well as Voice over IP (VoIP). In this case, the telephone number of the callee is used as the encryption key. Implementations on a modern mobile phone as well as within existing Voice over IP software are presented. The second application is IP networks. Here, the IP address of a communication unit is used as the encryption key. However, in this case, there are more problems than in the GSM/VoIP case, e.g., dynamic IP addresses or network address translation (NAT) where an IP address is substituted by another one. These are only two problems out of several for which solutions are presented.

•Aug 10, 2010•0 citations
The methods of cryptography can be successful only if they are properly incorporated into an application. A cryptographic technique can be unbreakable as such, and yet could still be insecure if it is used unwisely. This observation motivates the subject of security protocols. A security protocol consists of a formal method of using a cryptographic technique in a practical application. Without a well-defined security protocol, a perfectly secure cryptographic technique could be compromised by its use.
The design of secure protocols that implement arbitrarily desired functionalities is a major part of modern cryptography. Taking the opposite perspective, the design of any cryptographic scheme may be viewed as the design of a secure protocol for implementing a suitable functionality. Still, we believe that it makes sense to differentiate between basic cryptographic primitives (which involve little interaction) like encryption and signature schemes, on the one hand, and general cryptographic protocols, on the other hand. In this chapter we consider general results concerning secure multi –party computations, where the two –party case is an important special case. In a nutshell, these results assert that one can construct protocols for securely computing any desirable multi–party functionality (see the following terminology). Indeed, what is striking about these results is their generality, and we believe that the wonder is not diminished by the (various alternative) conditions under which these results hold. Our focus on the general study of secure multi–party computation (rather than on protocols for solving specific problems) is natural in the context of the theoretical treatment of the subject matter. We wish to highlight the importance of this general study to practice. Firstly, this study clarifies fundamental issues regarding security in a multi–party environment. Secondly, it draws the lines between what is possible in principle and what is not. Thirdly, it develops general techniques for designing secure protocols. And last, sometimes it may even yield schemes (or modules) that may be incorporated in practical systems.
Quantum cryptography represents a revolutionary paradigm shift in secure communication by leveraging the principles of quantum mechanics to guarantee unbreakable encryption. Unlike classical cryptographic methods dependent on computational hardness, quantum cryptography exploits quantum phenomena such as superposition and entanglement to provide provable security against eavesdropping. This paper explores fundamental quantum cryptographic protocols, their operational principles, and recent advances that enable practical deployment. We further discuss challenges, implementation issues, and the future scope of quantum key distribution (QKD) technologies in securing global communication infrastructures
In today’s world, security in data communication has become a top-most priority in every organization. In general, cryptography is defined as the methodology to ensure data is secure by employing suitable encryption and decryption techniques. On the transmitter side, the original message is encrypted using a key. Then the encrypted data is decrypted with the duplicate key at the receiver side as per the accepted protocol between the two parties. In conventional cryptographic techniques, eavesdropping is prevented from accessing the contents of encrypted message by employing certain mathematical function and techniques, but this security methodology does not guarantee any key security. In many scenarios, a secure communication link is established by using a key, but a third party with a bad intent may steal the session keys, giving rise to data security, getting compromised. So in this regard, quantum cryptography is a better alternative when it comes to data security integrity. In this research, a detail about quantum cryptography is elaborated on, and also discussed are various concepts like single photon protocol, loss of data in quantum computing, how quantum is affecting computer communication systems. In conventional cryptographic methodology of data transmission and reception, there is always a probability of eavesdropping leading to the compromising of data integrity and security. The solution to this problem can be obtained by integrating the quantum cryptographic technique with data at the sender as well as the receiver, to detect and minimize various errors by employing suitable bit error scheme. This involves the usage of programming language specific to quantum computing like qcl and quipper to achieve efficient encryption and decryption with faster processing capability.
A product is on the way that relies on the quantum properties of photons to keep out eavesdroppers. All of them. The battle between codemakers and codebreakers is centuries old, but at the start of the 21st century, could it finally be drawing to a close? Physicists are putting the finishing touches to a method of encrypting messages that is more secure than anything that has gone before. Unlike the ciphers of the past, this new method has the potential to be absolutely unbreakable, not just practically unbreakable, but theoretically unbreakable. Mathematicians believe they can prove it. Central to the technique are the strange laws of quantum mechanics. Already experimental messages encrypted using quantum mechanics are being sent over tens of kilometers of optical fibers and received securely. Researchers are confident that it will not be long before ultra-secret messages are routinely transmitted in this way. But while quantum cryptography may be perfect in theory, practical considerations introduce security loopholes that an eavesdropper can exploit. The seriousness of these is still unclear, and physicists believe they can plug most of the holes with more efficient equipment. Still, enough cracks remain to maintain a healthy interest among cryptographers.
Cryptographic protocols are used to encrypt data during their transmission over a network or to store it on a data carrier. This thesis is about the method of identity-based encryption. In this form of encryption, the name or identity of the target subject is used to encrypt the data. This property makes it a perfect tool for modern electronic communication, because all involved identities and endpoint addresses (e.g. IP addresses) have to be unique worldwide and must be known in order to establish a communication. The identity-based key agreement protocol that has been invented in this thesis has several advantages compared to existing schemes. One important property is its complete independence of key generators. This independence allows each participating security domain to set up and maintain its own key generator. They are not forced to agree on a common setup or a common secret anymore. Due to the properties of the protocol, the security domains are still compatible to each other. Users from one security domain can communicate with users from another security domain using encryption. This new property of independence is also carried over to a signature protocol. It allows users from different security domains to sign a certain object. Additionally, the act of signing is independent and the signers do not need to communicate with each other. Apart from the protocol and its security proofs with respect to standard definitions from the literature, the thesis contains an analysis of existing schemes. Attacks on known protocols and assumptions are presented, and it is shown under which circumstances these become insecure. On the one hand, a completely new approach that is based on defined or rather undefined objects in discrete structures is used. On the other hand, the method of lattice based reduction is successfully applied to the new area of secret sharing schemes. Finally, application scenarios for the protocol are presented. These scenarios are chosen such that the advantages of the protocol become apparent. Cryptographic protocols are used to encrypt data during their transmission over a network or to store it on a data carrier. This thesis is about the method of identity-based encryption. In this form of encryption, the name or identity of the target subject is used to encrypt the data. This property makes it a perfect tool for modern electronic communication, because all involved identities and endpoint addresses (e.g. IP addresses) have to be unique worldwide and must be known in order to establish a communication. The identity-based key agreement protocol that has been invented in this thesis has several advantages compared to existing schemes. One important property is its complete independence of key generators. This independence allows each participating security domain to set up and maintain its own key generator. They are not forced to agree on a common setup or a common secret anymore. Due to the properties of the protocol, the security domains are still compatible to each other. Users from one security domain can communicate with users from another security domain using encryption. This new property of independence is also carried over to a signature protocol. It allows users from different security domains to sign a certain object. Additionally, the act of signing is independent and the signers do not need to communicate with each other. Apart from the protocol and its security proofs with respect to standard definitions from the literature, the thesis contains an analysis of existing schemes. Attacks on known protocols and assumptions are presented, and it is shown under which circumstances these become insecure. On the one hand, a completely new approach that is based on defined or rather undefined objects in discrete structures is used. On the other hand, the method of lattice based reduction is successfully applied to the new area of secret sharing schemes. Finally, application scenarios for the protocol are presented. These scenarios are chosen such that the advantages of the protocol become apparent. The first application is telephony, GSM as well as Voice over IP (VoIP). In this case, the telephone number of the callee is used as the encryption key. Implementations on a modern mobile phone as well as within existing Voice over IP software are presented. The second application is IP networks. Here, the IP address of a communication unit is used as the encryption key. However, in this case, there are more problems than in the GSM/VoIP case, e.g., dynamic IP addresses or network address translation (NAT) where an IP address is substituted by another one. These are only two problems out of several for which solutions are presented.