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

arXiv:cs/0603107

Towards an information-theoretically safe cryptographic protocol

Pedro Fortuny Ayuso

Published Mar 28, 2006• 0 citations
arXivHTMLPDF

Abstract

We introduce what --if some kind of group action exists-- is a truly (information theoretically) safe cryptographic communication system: a protocol which provides \emph{zero} information to any passive adversary having full access to the channel.
DOI
10.48550/arxiv.cs/0603107

Related papers

An Analysis of a Cryptographic Communication Protocol

Maria Strand

We have considered a cryptographic communication protocol and given a proof for its security.

66•Jan 1, 2010•0 citations

Quantifying information flow in cryptographic systems

Michael Backes A, Boris Köpf

We provide a novel definition of quantitative information flow, called transmissible information, that is suitable for reasoning about informational-theoretically secure (or non-cryptographic) systems, as well as about cryptographic systems with their polynomially bounded adversaries, error probabilities, etc. Transmissible information captures deliberate communication between two processes, and it safely over-approximates the quantity of information that a process unintentionally leaks to another process. We show that transmissible information is preserved under universal composability, which constitutes the prevalent cryptographic notion of a secure implementation. This result enables us to lift quantitative bounds of transmissible information from simple ideal functionalities of cryptographic tasks to actual cryptographic systems. We furthermore prove a connection between transmissible information in the unconditional setting and channel capacity, based on the weak converse of Shannon's coding theorem. This connection enables us to compute an upper bound on the transmissible information for a restricted class of protocols, using existing techniques from quantitative information flow.

Mathematical Structures in Computer Science•Nov 10, 2014•3 citations

Transmit Classical and Quantum Information Secretly

Li Yang, Ling-An Wu

This note presents a practical cryptography protocol for transmitting classical and quantum information secretly and directly.

arXiv:quant-ph/0203089•Mar 18, 2002•4 citations

Path Hopping: An MTD Strategy for Long-Term Quantum-Safe Communication

Reihaneh Safavi–Naini, Alireza Poostindouz, Viliam Lisý

Moving target defense (MTD) strategies have been widely studied for securing computer systems. We consider using MTD strategies to provide long-term cryptographic security for message transmission against an eavesdropping adversary who has access to a quantum computer. In such a setting, today’s widely used cryptographic systems including Diffie-Hellman key agreement protocol and RSA cryptosystem will be insecure and alternative solutions are needed. We will use a physical assumption, existence of multiple communication paths between the sender and the receiver, as the basis of security, and propose a cryptographic system that uses this assumption and an MTD strategy to guarantee efficient long-term information theoretic security even when only a single path is not eavesdropped. Following the approach of Maleki et al., we model the system using a Markov chain, derive its transition probabilities, propose two security measures, and prove results that show how to calculate these measures using transition probabilities. We define two types of attackers that we call risk-taking and risk-averse and compute our proposed measures for the two types of adversaries for a concrete MTD strategy. We will use numerical analysis to study tradeoffs between system parameters, discuss our results, and propose directions for future research.

Security and Communication Networks•May 7, 2018•3 citations

On secure communications without eavesdropper channel state

Phillip A. Regalia

The ubiquity of wireless connectivity between an ever-increasing number of devices has confirmed dire past predictions of widespread eavesdropping (among other security concerns) in wireless networks, further promoting the need for secure communications. Of particular interest are physical layer techniques which exploit error-correction coding intrinsic to digital transceivers and which offer two clear advantages: (i) no need for key distribution; and (ii) secrecy that is not conditioned on a computationally limited adversary. Present techniques, however, assume some knowledge of the channel connecting the transmitter to the eavesdropper; if the eavesdropper is truly passive, this critical parameter is unavailable. We therefore examine secure communication schemes that do not assume knowledge of the eavesdropper's channel, yet remain keyless in their operation. Two schemes are offered, with behavior intermediate between cryptographic and information-theoretic solutions.

IEEE International Symposium on Circuits and Systems proceedings•May 1, 2017•2 citations

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

Kaoru Kurosawa

Lecture notes in computer science•Jan 1, 2010•0 citations
We provide a novel definition of quantitative information flow, called transmissible information, that is suitable for reasoning about informational-theoretically secure (or non-cryptographic) systems, as well as about cryptographic systems with their polynomially bounded adversaries, error probabilities, etc. Transmissible information captures deliberate communication between two processes, and it safely over-approximates the quantity of information that a process unintentionally leaks to another process. We show that transmissible information is preserved under universal composability, which constitutes the prevalent cryptographic notion of a secure implementation. This result enables us to lift quantitative bounds of transmissible information from simple ideal functionalities of cryptographic tasks to actual cryptographic systems. We furthermore prove a connection between transmissible information in the unconditional setting and channel capacity, based on the weak converse of Shannon's coding theorem. This connection enables us to compute an upper bound on the transmissible information for a restricted class of protocols, using existing techniques from quantitative information flow.
Moving target defense (MTD) strategies have been widely studied for securing computer systems. We consider using MTD strategies to provide long-term cryptographic security for message transmission against an eavesdropping adversary who has access to a quantum computer. In such a setting, today’s widely used cryptographic systems including Diffie-Hellman key agreement protocol and RSA cryptosystem will be insecure and alternative solutions are needed. We will use a physical assumption, existence of multiple communication paths between the sender and the receiver, as the basis of security, and propose a cryptographic system that uses this assumption and an MTD strategy to guarantee efficient long-term information theoretic security even when only a single path is not eavesdropped. Following the approach of Maleki et al., we model the system using a Markov chain, derive its transition probabilities, propose two security measures, and prove results that show how to calculate these measures using transition probabilities. We define two types of attackers that we call risk-taking and risk-averse and compute our proposed measures for the two types of adversaries for a concrete MTD strategy. We will use numerical analysis to study tradeoffs between system parameters, discuss our results, and propose directions for future research.
The ubiquity of wireless connectivity between an ever-increasing number of devices has confirmed dire past predictions of widespread eavesdropping (among other security concerns) in wireless networks, further promoting the need for secure communications. Of particular interest are physical layer techniques which exploit error-correction coding intrinsic to digital transceivers and which offer two clear advantages: (i) no need for key distribution; and (ii) secrecy that is not conditioned on a computationally limited adversary. Present techniques, however, assume some knowledge of the channel connecting the transmitter to the eavesdropper; if the eavesdropper is truly passive, this critical parameter is unavailable. We therefore examine secure communication schemes that do not assume knowledge of the eavesdropper's channel, yet remain keyless in their operation. Two schemes are offered, with behavior intermediate between cryptographic and information-theoretic solutions.