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

Lecture notes in computer science

Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk)

Kaoru Kurosawa

Published Jan 1, 2010• 0 citations
Publisher
DOI
10.1007/978-3-642-17619-7_4

Related papers

Quantum Safe Symmetric Cryptography - Invited talk

María Naya‐Plasencia

•Dec 13, 2021•0 citations

ACHIEVING UNCONDITIONAL SECURITY IN EXISTING NETWORKS USING QUANTUM CRYPTOGRAPHY

Stefan Raß, Mohamed Ali Sfaxi, Solange Ghernaouti-Hélie

Based on extensions to the protocols PPP and IPSEC, we present a working proposal for building a network over which messages can be sent unconditionally secure. We will show how quantum cryptography can be implemented in classical protocols and how existing networks can be efficiently extended to suit our needs for unconditional security. We show that graph connectivity is crucial for the security of the transmission. For that matter, we provide secure routing services, so an adversary cannot penetrate any message flow successfully. Furthermore, our protocols are extensible to allow up to t - 1 adversaries (possibly cooperating) while remaining unconditionally secure.

International Conference on Security and Cryptography•Jan 1, 2006•2 citations

Towards Optimal and Efficient Perfectly Secure Message Transmission

Matthias Fitzi, Matthew Franklin, Juan A. Garay +1 more

Springer eBooks•May 16, 2007•76 citations

Secure Communication Through Quantum Channels: A Study of Quantum Cryptography

Seema Ukidve, Ramsagar Yadav, Mukhdeep Singh Manshahia +1 more

Lecture notes in networks and systems•Jan 1, 2023•6 citations

Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary

Kannan Srinathan, Arpita Patra, Ashish Choudhary +1 more

In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, modeled as an arbitrary directed graph. Some of the intermediate nodes between S and R can be under the control of an adversary having unbounded computing power. Desmedt and Wang [4] have given the characterization of USMT in directed networks. However, in their model, the underlying network is abstracted as directed node disjoint paths (also called as wires/channels) between S and R, where the intermediate nodes are oblivious, message passing nodes and perform no other computation. In this work, we first show that the characterization of USMT given by Desmedt et.al [4] does not hold good for arbitrary directed networks, where the intermediate nodes can perform some computation, beside acting as message forwarding nodes. We then give the characterization of USMT in arbitrary directed networks, considering the entire network as a whole. As far our knowledge is concerned, this is the first ever characterization of USMT in arbitrary directed networks.

ACM Asia Conference on Computer and Communications Security (ASIA CCS)•Mar 10, 2009•11 citations

Cryptanalysis of Secure Message Transmission Protocols with Feedback

Qiushi Yang, Yvo Desmedt

Lecture notes in computer science•Jan 1, 2010•14 citations
Based on extensions to the protocols PPP and IPSEC, we present a working proposal for building a network over which messages can be sent unconditionally secure. We will show how quantum cryptography can be implemented in classical protocols and how existing networks can be efficiently extended to suit our needs for unconditional security. We show that graph connectivity is crucial for the security of the transmission. For that matter, we provide secure routing services, so an adversary cannot penetrate any message flow successfully. Furthermore, our protocols are extensible to allow up to t - 1 adversaries (possibly cooperating) while remaining unconditionally secure.
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, modeled as an arbitrary directed graph. Some of the intermediate nodes between S and R can be under the control of an adversary having unbounded computing power. Desmedt and Wang [4] have given the characterization of USMT in directed networks. However, in their model, the underlying network is abstracted as directed node disjoint paths (also called as wires/channels) between S and R, where the intermediate nodes are oblivious, message passing nodes and perform no other computation. In this work, we first show that the characterization of USMT given by Desmedt et.al [4] does not hold good for arbitrary directed networks, where the intermediate nodes can perform some computation, beside acting as message forwarding nodes. We then give the characterization of USMT in arbitrary directed networks, considering the entire network as a whole. As far our knowledge is concerned, this is the first ever characterization of USMT in arbitrary directed networks.