English
Related papers

Related papers: On the Optimality of Keyless Authentication in a N…

200 papers

Quantum secret sharing (QSS) enables a dealer to securely distribute keys to multiple players. Device-independent (DI) QSS can resist all possible attacks from practical imperfect devices and provide QSS the highest level of security in…

We consider the strong secret key (SK) agreement problem for the satellite communication setting, where a satellite chooses a common binary phase shift keying modulated input for three statistically independent additive white Gaussian noise…

Information Theory · Computer Science 2021-08-31 Onur Günlü , Ueli Maurer , João Ribeiro

Secure communication mechanisms in Wireless Sensor Networks (WSNs) have been widely deployed to ensure confidentiality, authenticity and integrity of the nodes and data. Recently many WSNs applications rely on trusted communication to…

Networking and Internet Architecture · Computer Science 2012-07-27 Yusnani Mohd Yussoff , Habibah Hashim , Mohd Dani Baba

We propose a new cryptosystem by combing the Lissajous map, which is the asymptotic model of deterministic randomness, with the one-way coupled map lattice (OCML) system. The key space, the encryption efficiency, and the security are…

Chaotic Dynamics · Physics 2009-11-11 Jiantao Zhou , Wenjiang Pei , Kai Wang , Jie Huang , Zhenya He

Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance…

Real-time applications require latencies on the order of a millisecond with very high reliabilities, paralleling the requirements for high-performance industrial control. Current wireless technologies like WiFi, Bluetooth, LTE, etc. are…

Information Theory · Computer Science 2018-03-15 Vasuki Narasimha Swamy , Paul Rigge , Gireeja Ranade , Anant Sahai , Borivoje Nikolic

The problem of secure lossy source-channel wiretapping with arbitrarily correlated side informations at both receivers is investigated. This scenario consists of an encoder (referred to as Alice) that wishes to compress a source and send it…

Information Theory · Computer Science 2011-10-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

A basic model for key agreement with a remote (or hidden) source is extended to a multi-user model with joint secrecy and privacy constraints over all entities that do not trust each other after key agreement. Multiple entities using…

Information Theory · Computer Science 2020-10-20 Onur Günlü

The problem of secret-key based authentication under a privacy constraint on the source sequence is considered. The identifier measurements during authentication are assumed to be controllable via a cost-constrained "action" sequence.…

Information Theory · Computer Science 2020-02-27 Onur Günlü , Kittipong Kittichokechai , Rafael F. Schaefer , Giuseppe Caire

Covert communication can prevent the adversary from knowing that a wireless transmission has occurred. In the additive white Gaussian noise channels, a square root law is obtained and the result shows that Alice can reliably and covertly…

Information Theory · Computer Science 2018-03-12 Zhihong Liu , Jiajia Liu , Yong Zeng , Li Yang , Jianfeng Ma

The universal quantum computation model based on quantum walk by Childs has opened the door for a new way of studying the limitations and advantages of quantum computation, as well as for its intermediate-term simulation. In recent years,…

Quantum Physics · Physics 2022-02-08 Noa Feldman , Moshe Goldstein

This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…

Information Theory · Computer Science 2010-04-13 O. Ozan Koyluoglu , C. Emre Koksal , Hesham El Gamal

We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels (DMCs) using variable-length lossy source-channel codes with feedback. The reliability function (optimum error exponent) is shown to be…

Information Theory · Computer Science 2019-04-09 Lan V. Truong , Vincent Y. F. Tan

In the Conditional Disclosure of Secrets (CDS) problem, Alice and Bob hold inputs $x\in \mathcal{X}$ and $y\in \mathcal{Y}$ and share a secret. Let $f:\mathcal{X}\times\mathcal{Y}\to\{0,1\}$ be a function such that the secret is revealed to…

Information Theory · Computer Science 2025-12-19 Zhou Li , Siyan Qin , Xiang Zhang , Jihao Fan , Haiqiang Chen , Giuseppe Caire

Quantum secure direct communication (QSDC) is a approach of communication to transmit secret messages base on quantum mechanics. Different from the quantum key distribution, secret messages can be transmitted directly on quantum channel…

Quantum Physics · Physics 2024-06-18 Zhengwen Cao , Yujie Wang , Geng Chai , Xinlei Chen , Yuan Lu

We consider the problem of coding for the substring channel, in which information strings are observed only through their (multisets of) substrings. Due to existing DNA sequencing techniques and applications in DNA-based storage systems,…

Information Theory · Computer Science 2024-03-27 Yonatan Yehezkeally , Nikita Polyanskii

Measurement-device-independent quantum key distribution protocol, whose security analysis does not rely on any assumption on the detection system, can immune the attacking against detectors. We give a first composable security analysis for…

Quantum Physics · Physics 2018-09-05 Ziyang Chen , Yi-Chen Zhang , Gan Wang , Zhengyu Li , Hong Guo

The model of wiretap channel (WTC) is important as it constitutes the essence of physical layer security (PLS). Wiretap channel with noiseless feedback (WTC-NF) is especially interesting as it shows what can be done when a private feedback…

Information Theory · Computer Science 2018-04-26 Bin Dai

Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes, however, their imprecise statistical characterization can…

Information Theory · Computer Science 2023-05-15 Amitalok J. Budkuley , Pranav Joshi , Manideep Mamindlapally , Anuj Kumar Yadav

A new single-letter achievable rate region is proposed for the two-user discrete memoryless multiple-access channel(MAC) with noiseless feedback. The proposed region includes the Cover-Leung rate region [1], and it is shown that the…

Information Theory · Computer Science 2014-03-31 Ramji Venkataramanan , S. Sandeep Pradhan