English
Related papers

Related papers: Secrecy Is Cheap if the Adversary Must Reconstruct

200 papers

We extend covert communication to the quantum regime by showing that covert quantum communication is possible over optical channels with noise arising either from the environment or from the sender's lab. In particular, we show that…

Quantum Physics · Physics 2016-12-21 Juan Miguel Arrazola , Valerio Scarani

A security measure called effective security is defined that includes strong secrecy and stealth communication. Effective secrecy ensures that a message cannot be deciphered and that the presence of meaningful communication is hidden. To…

Information Theory · Computer Science 2014-01-27 Jie Hou , Gerhard Kramer

Social networks, instant messages and file sharing systems are common communication means among friends, families, coworkers, etc. Due to concerns of personal privacy, identify thefts, data misuse, freedom of speech and government…

Cryptography and Security · Computer Science 2019-01-30 Wei Jiang , Adam Bowers , Dan Lin

We propose steganographic systems for the case when covertexts (containers) are generated by a finite-memory source with possibly unknown statistics. The probability distributions of covertexts with and without hidden information are the…

Cryptography and Security · Computer Science 2012-02-28 Boris Ryabko , Daniil Ryabko

We consider a coded cooperative data exchange problem with the goal of generating a secret key. Specifically, we investigate the number of public transmissions required for a set of clients to agree on a secret key with probability one,…

Information Theory · Computer Science 2014-07-02 Thomas A. Courtade , Thomas R. Halford

Hiding messages for countless security purposes has become a highly fascinating subject nowadays. Encryption facilitates the data hiding. With the express development of technology, people tend to figure out a method capable of hiding a…

Cryptography and Security · Computer Science 2025-02-25 Sachith Dassanayaka

In $(t, n)$-threshold secret sharing, a secret $S$ is distributed among $n$ participants such that any subset of size $t$ can recover $S$, while any subset of size $t-1$ or fewer learns nothing about it. For information-theoretic secret…

Information Theory · Computer Science 2025-06-23 Igor L. Aureliano , Alejandro Cohen , Rafael G. L. D'Oliveira

We study the problem of remote state estimation, in the presence of an eavesdropper. An authorized user estimates the state of a linear plant, based on the data received from a sensor, while the data may also be intercepted by the…

Systems and Control · Computer Science 2016-12-16 Anastasios Tsiamis , Konstantinos Gatsis , George J. Pappas

Most practical communication links are bi-directional. In these models, since the source node also receives signals, its encoder has the option of computing its output based on the signals it received in the past. On the other hand, from a…

Information Theory · Computer Science 2009-11-24 Xiang He , Aylin Yener

We ask whether neural networks can learn to use secret keys to protect information from other neural networks. Specifically, we focus on ensuring confidentiality properties in a multiagent system, and we specify those properties in terms of…

Cryptography and Security · Computer Science 2016-10-24 Martín Abadi , David G. Andersen

In a backdoor attack on a machine learning model, an adversary produces a model that performs well on normal inputs but outputs targeted misclassifications on inputs containing a small trigger pattern. Model compression is a widely-used…

Cryptography and Security · Computer Science 2021-05-03 Yulong Tian , Fnu Suya , Fengyuan Xu , David Evans

A new model of multi-party secret key agreement is proposed, in which one terminal called the communicator can transmit public messages to other terminals before all terminals agree on a secret key. A single-letter characterization of the…

Information Theory · Computer Science 2015-12-01 Jingbo Liu , Paul Cuff , Sergio Verdu

We consider the problem of lossy source coding with side information under a privacy constraint that the reconstruction sequence at a decoder should be kept secret to a certain extent from another terminal such as an eavesdropper, a sender,…

Information Theory · Computer Science 2014-06-25 Kittipong Kittichokechai , Tobias J. Oechtering , Mikael Skoglund

We refine and extend Ziv's model and results regarding perfectly secure encryption of individual sequences. According to this model, the encrypter and the legitimate decrypter share in common a secret key, not shared with the unauthorized…

Information Theory · Computer Science 2024-05-10 Neri Merhav

Commutativity of subsystems in cascade connected forms to form larger systems gets worthy to improve noise disturbance properties, stability, robustness and many other properties in system design. In this paper, another benefit of…

Systems and Control · Computer Science 2020-10-05 Mehmet Emir Koksal

We present a new idea to design perfectly secure information exchange protocol, based on so called Deep Randomness, which means randomness relying on hidden probability distribution. Such idea drives us to introduce a new axiom in…

Cryptography and Security · Computer Science 2019-01-08 Thibault de Valroger

We prove the security of theoretical quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities, and the full power allowed by the rules of…

Quantum Physics · Physics 2007-07-16 Eli Biham , Michel Boyer , P. Oscar Boykin , Tal Mor , Vwani Roychowdhury

Privacy is an individual choice to determine which personal details can be collected, used and shared. Individual consent and transparency are the core tenets for earning customers trust and this motivates the organizations to adopt privacy…

Cryptography and Security · Computer Science 2021-09-14 Abhinav Palia , Rajat Tandon , Carl Mathis

Recent work characterizing the optimal performance of secrecy systems has made use of a distortion-like metric for partial secrecy as a replacement for the more traditional metric of equivocation. In this work we use the log-loss function…

Information Theory · Computer Science 2013-03-12 Paul Cuff

We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the…

Information Theory · Computer Science 2022-04-26 Masahito Hayashi , Masaki Owari , Go Kato , Ning Cai