Results 311 to 317 of about 6,885,434 (317)
Some of the next articles are maybe not open access.
Secure and distributed conference-key distribution
Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826), 2005This paper introduces a distributed conference key distribution system that utilizes secure multi-party computation scheme by virtue of Feldman's (t+1, n) VSS to perform the conference key computation, so that a key can be obtained in a distributed fashion in which any t+1 of servers are required to perform the computation.
Yuan-Bo Guo, Ya-Di Wang
openaire +2 more sources
Quantum Key Distribution [PDF]
, 2008 Quantum Key Distribution (QKD) uses Quantum Mechanics to guarantee secure communication. It enables two parties to produce a shared random bit string known only to them, which can be used as a key to encrypt and decrypt messages.
openaire +1 more source
Bounds for Key Distribution Patterns
Journal of Cryptology, 1999Consider a network of \(v\) nodes. It is desired for a server to give each node sufficient information so that any two nodes wishing to communicate with a symmetric cryptosystem can derive a unique and secure common key from the information each has. It will be assumed the keys have \(n\) bits. A key distribution scheme (KDS) is a means to achieve this
openaire +2 more sources
2014
The paper discussed on possible optimization set-ups for quantum key distribution (QKD). The large secret key resulting from QKD is a valuable resource in communication scenarios, e.g. for secret communication, authentication, identification and so forth.
openaire +2 more sources
The paper discussed on possible optimization set-ups for quantum key distribution (QKD). The large secret key resulting from QKD is a valuable resource in communication scenarios, e.g. for secret communication, authentication, identification and so forth.
openaire +2 more sources
On the method of puzzles for key distribution
International Journal of Computer & Information Sciences, 1984Summary: \textit{R. C. Merkle} [Commun. ACM 21, 294-299 (1978)] has shown how keys can be exchanged over a public channel by the use of puzzles. His method gives a work advantage of \(O(N^ 2)/O(N).\) He also posed the problem of finding other methods of using puzzles that give better work advantage. This paper provides a solution to Merkle's problem. A
openaire +2 more sources