English
Related papers

Related papers: Effective Secrecy: Reliability, Confusion and Stea…

200 papers

Recently, three useful secrecy metrics based on the partial secrecy regime were proposed to analyze secure transmissions on wireless systems over quasi-static fading channels, namely: generalized secrecy outage probability, average…

Signal Processing · Electrical Eng. & Systems 2020-04-14 Diana P. M. Osorio , Hirley Alves , Edgar E. B. Olivo

We study the state-dependent wiretap channel with non-causal channel state informations at the encoder in an integrated sensing and communications (ISAC) scenario. In this scenario, the transmitter communicates a message and a state…

Information Theory · Computer Science 2023-07-25 Mehrasa Ahmadipour , Michèle Wigger , Shlomo Shamai

In network coding, we discuss the effect of sequential error injection on information leakage. We show that there is no improvement when the operations in the network are linear operations. However, when the operations in the network…

Information Theory · Computer Science 2018-09-27 Masahito Hayashi , Masaki Owari , Go Kato , Ning Cai

Secure group communications are a mechanism facilitating protected transmission of messages from a sender to multiple receivers, and many emerging applications in both wired and wireless networks need the support of such a mechanism. There…

Cryptography and Security · Computer Science 2020-10-13 Shouhuai Xu

This paper presents further insights into a recently developed round-trip communication scheme called ``Secret-message Transmission by Echoing Encrypted Probes (STEEP)''. A legitimate wireless channel between a multi-antenna user (Alice)…

Information Theory · Computer Science 2025-07-21 Yingbo Hua , Md Saydur Rahman

The secrecy capacity of the type II wiretap channel (WTC II) with a noisy main channel is currently an open problem. Herein its secrecy-capacity is derived and shown to be equal to its semantic-security (SS) capacity. In this setting, the…

Information Theory · Computer Science 2016-08-18 Ziv Goldfeld , Paul Cuff , Haim H. Permuter

In this paper we consider the compressed sensing-based encryption and proposed the conditions in which the perfect secrecy is obtained. We prove when the Restricted Isometery Property (RIP) is hold and the number of measurements is more…

Information Theory · Computer Science 2016-02-02 Mahmoud Ramezani Mayiami , Babak Seyfe , Hamid G. Bafghi

Quantum secure direct communication is one of the important mode of quantum communication, which sends secret information through a quantum channel directly without setting up a prior key. Over the past decade, numerous protocols have been…

Quantum Physics · Physics 2017-06-13 Jianyong Hu , Mingyong Jing , Peng Zhang , Qiangqiang Zhang , Huifang Hou , Liantuan Xiao , Suotang Jia

Suppose there is a group of N people some of whom possess a specific property. For example, their wealth is above or below a threshold, they voted for a particular candidate, they have a certain disease, etc. The group wants to find out how…

Cryptography and Security · Computer Science 2007-05-23 Oleg Kiselyov

We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…

Steganography embeds secret messages in seemingly innocuous carriers for covert communication under surveillance. Current Provably Secure Steganography (PSS) schemes based on language models can guarantee computational indistinguishability…

Cryptography and Security · Computer Science 2026-04-30 Kaiyi Pang , Minhao Bai

The fundamental limits of biometric identification systems under a strong secrecy criterion are investigated. In the previous studies of this scenario, the fundamental trade-off among secrecy, template, privacy- and secrecy-leakages has…

Information Theory · Computer Science 2021-02-03 Vamoua Yachongka , Hideki Yagi

The existing research on physical layer security commonly assumes the number of eavesdropper antennas to be known. Although this assumption allows one to easily compute the achievable secrecy rate, it can hardly be realized in practice. In…

Information Theory · Computer Science 2016-11-17 Biao He , Xiangyun Zhou , Thushara D. Abhayapala

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

An information is a message which is received and understood. Information can be sent one person to another over a long range but the process of sending information must be done in a secure way especially in case of a private message.…

Cryptography and Security · Computer Science 2012-06-20 Yousuf Ibrahim Khan

Secure communication is essential in covert and safety-critical settings where verbal interactions may expose user intent or operational context. Wearable gesture-based communication enables low-effort, nonverbal interaction, but existing…

Cryptography and Security · Computer Science 2026-02-10 Tasnia Ashrafi Heya , Sayed Erfan Arefin

Quantum privacy amplification is a central task in quantum cryptography. Given shared randomness, which is initially correlated with a quantum system held by an eavesdropper, the goal is to extract uniform randomness which is decoupled from…

Quantum Physics · Physics 2022-02-23 Robert Salzmann , Nilanjana Datta

We propose a new framework for determining the wiretap code rates of single-input single-output multi-antenna eavesdropper (SISOME) wiretap channels when the capacity of the eavesdropper's channel is not available at the transmitter. In our…

Information Theory · Computer Science 2016-09-01 Shihao Yan , Nan Yang , Giovanni Geraci , Robert Malaney , Jinhong Yuan

Given two random variables $X$ and $Y$, an operational approach is undertaken to quantify the ``leakage'' of information from $X$ to $Y$. The resulting measure $\mathcal{L}(X \!\! \to \!\! Y)$ is called \emph{maximal leakage}, and is…

Information Theory · Computer Science 2018-07-23 Ibrahim Issa , Aaron B. Wagner , Sudeep Kamath

We establish a simple connection between robust and differentially-private algorithms: private mechanisms which perform well with very high probability are automatically robust in the sense that they retain accuracy even if a constant…

Machine Learning · Statistics 2022-12-02 Kristian Georgiev , Samuel B. Hopkins
‹ Prev 1 8 9 10 Next ›