English
Related papers

Related papers: ARQ-Based Secret Key Sharing

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

In this paper, a semiquantum secret sharing (SQSS) protocol based on x-type states is proposed, which can accomplish the goal that only when two classical communicants cooperate together can they extract the shared secret key of a quantum…

Quantum Physics · Physics 2022-12-13 Ying Chen , Tian-Yu Ye

Secret-key generation in a wireless environment exploiting the randomness and reciprocity of the channel gains is considered. A new channel model is proposed which takes into account the effect of reflections (or re-radiations) from receive…

Information Theory · Computer Science 2013-08-07 Hendrik Vogt , Aydin Sezgin

Inspired by emerging applications in vehicular networks, we address the problem of achieving high-reliability and low-latency communication in multi-hop wireless networks. We propose a new family of Automatic-Repeat-Requests (ARQs) based…

Information Theory · Computer Science 2022-08-09 Jaya Goel , J. Harshan

The dynamic establishment of shared information (e.g. secret key) between two entities is particularly important in networks with no pre-determined structure such as wireless sensor networks (and in general wireless mobile ad-hoc networks).…

Cryptography and Security · Computer Science 2008-12-18 V. Liagkou , E. Makri , P. Spirakis , Y. C. Stamatiou

A new approach to quantum cryptography to be called KCQ, keyed communication in quantum noise, is developed on the basis of quantum detection and communication theory for classical information transmission. By the use of a shared secret key…

Quantum Physics · Physics 2007-05-23 Horace P. Yuen

Secret-key generation exploiting the channel reciprocity between two legitimate parties is an interesting alternative solution to cryptographic primitives for key distribution in wireless systems as it does not rely on an access…

Signal Processing · Electrical Eng. & Systems 2020-01-15 François Rottenberg , Philippe De Doncker , François Horlin , Jérôme Louveaux

In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state…

Cryptography and Security · Computer Science 2013-05-17 Mohsen Bahrami , Ali Bereyhi , Sadaf Salehkalaibar , Mohammad Reza Aref

Harnessing a block-sparse prior to recover signals through underdetermined linear measurements has been extensively shown to allow exact recovery in conditions where classical compressed sensing would provably fail. We exploit this result…

Information Theory · Computer Science 2021-10-12 Maxime Ferreira Da Costa , Urbashi Mitra

Information theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to…

Cryptography and Security · Computer Science 2016-11-15 Toni Draganov Stojanovski , Ninoslav Marina

We consider the problem of resource allocation in a wireless cellular network, in which nodes have both open and private information to be transmitted to the base station over block fading uplink channels. We develop a cross-layer solution,…

Information Theory · Computer Science 2012-02-07 Yunus Sarikaya , Ozgur Ercetin , Emre C. Koksal

Hybrid Automatic ReQuest (HARQ) protocol enables reliable communications in wireless systems. Usually, several parallel streams are sent in successive timeslots following a time-sharing approach. Recently, multi-layer HARQ has been proposed…

Information Theory · Computer Science 2020-04-03 Alla Khreis , Francesca Bassi , Philippe Ciblat , Pierre Duhamel

Covert and secret quantum key distribution aims at generating information-theoretically secret bits between distant legitimate parties in a manner that remains provably undetectable by an adversary. We propose a framework in which to…

Information Theory · Computer Science 2019-05-29 Mehrdad Tahmasbi , Matthieu R. Bloch

We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a discrete memoryless wiretap channel with a memoryless state…

Information Theory · Computer Science 2016-11-18 Ashish Khisti , Suhas Diggavi , Gregory Wornell

We construct a new protocol for attribute-based encryption with the use of the modification of the standard secret sharing scheme. In the suggested modification of the secret sharing scheme, only one master key for each user is required…

Cryptography and Security · Computer Science 2020-11-24 M. A. Kudinov , A. A. Chilikov , E. O. Kiktenko , A. K. Fedorov

Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direc- tion, this paper presents a novel approach to share a secret among a hierarchy of users while…

Cryptography and Security · Computer Science 2010-07-15 Ruchira Naskar , Indranil Sengupta

A secret key shared through quantum key distribution between two cooperative players is secure against any eavesdropping attack allowed by the laws of physics. Yet, such a key can be established only when the quantum channel error rate due…

Quantum Physics · Physics 2007-05-23 H. F. Chau

This paper presents a novel opportunistic spectrum sharing scheme that applies ARQ protocol to achieve ultra reliability in the finite blocklength regime. A primary user shares its licensed spectrum to a secondary user, where both…

Information Theory · Computer Science 2018-01-30 Mohammad Shehab , Hirley Alves , Matti Latva-aho

In the paper we propose general framework for Automatic Secret Generation and Sharing (ASGS) that should be independent of underlying secret sharing scheme. ASGS allows to prevent the dealer from knowing the secret or even to eliminate him…

Combinatorics · Mathematics 2007-07-16 Kamil Kulesza , Zbigniew Kotulski

This paper considers secure energy-efficient routing in the presence of multiple passive eavesdroppers. Previous work in this area has considered secure routing assuming probabilistic or exact knowledge of the location and…

Networking and Internet Architecture · Computer Science 2017-03-16 Azadeh Sheikholeslami , Majid Ghaderi , Hossein Pishro-Nik , Dennis Goeckel