scholarly journals Linkable Message Tagging: Solving the Key Distribution Problem of Signature Schemes

2015 ◽  
pp. 195-212 ◽  
Author(s):  
Felix Günther ◽  
Bertram Poettering
Keyword(s):  
Key Distribution ◽  
Distribution Problem ◽  
Signature Schemes

Security of Communication and Quantum Technology

2011 ◽  
pp. 602-608
Author(s):  
Gregory Paperin
Keyword(s):  
Quantum Mechanics ◽  
Communication System ◽  
Communication Protocols ◽  
Key Distribution ◽  
Distribution Problem ◽  
Quantum Technology ◽  
Selection Of

In this article we aim to analyze some of the advances in security of communication since this discipline evolved and to pinpoint the main problems. We then introduce a modern attempt to solve some of these problems, in particular the key distribution problem, by using the theory of quantum mechanics to construct a communication system that automatically detects eavesdropping. We examine some of the implications of quantum mechanics relevant to this field and then introduce a selection of communication protocols based on them. Finally we examine how secure these protocols are and identify their potential weaknesses.

A quantum cryptographic protocol with detection of compromised server

2005 ◽  
Vol 5 (7) ◽  
pp. 551-560
Author(s):  
D. R. Kuhn
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Cryptographic Protocol ◽  
Quantum Channels ◽  
Secret Key ◽  
Distribution Problem ◽  
Secret Keys

This paper presents a server-based hybrid cryptographic protocol, using quantum and classical resources, to generate a key for authentication and optionally for encryption in a network. A novel feature of the protocol is that it can detect a compromised server. Additional advantages are that it avoids the requirement for timestamps used in classical protocols, guarantees that the trusted server cannot know the authentication key, can provide resistance to multiple photon attacks, and can be used with BB84 or other quantum key distribution protocols. Each resource shares a previously distributed secret key with the trusted server, and resources can communicate with the server using both classical and quantum channels. Resources do not share secret keys with each other, so that the key distribution problem for the network is reduced from O(n^2) to O(n).

Stronger Chikazawa-Yamagishi ID-Based Key Distribution

2009 ◽  
Vol E92-A (5) ◽  
pp. 1379-1382 ◽  
Author(s):  
Ik Rae JEONG ◽  
Jeong Ok KWON ◽  
Dong Hoon LEE
Keyword(s):  
Key Distribution
Sign in / Sign up

Export Citation Format

Share Document