Filters








24,123 Hits in 7.0 sec

Towards Secure Over-The-Air Computation [article]

Matthias Frey, Igor Bjelaković, Sławomir Stańczak
2022 arXiv   pre-print
The key ingredients in proving the security guarantees are a known result on channel resolvability and a generalization of existing achievability results on coding for compound channels.  ...  It works for a large class of analog OTA computation schemes and we give details on the special case of computing an arithmetic average over an AWGN channel.  ...  to a lower bound on the mean square error of the eavesdropper's function estimate. 3) We prove a theorem on compound channel coding for continuous alphabets.  ... 
arXiv:2001.03174v4 fatcat:laxwj7bqcjhq5drveeyba4gmwy

Semantically Secure Lattice Codes for Compound MIMO Channels

Antonio Campello, Cong Ling, Jean-Claude Belfiore
2019 IEEE Transactions on Information Theory  
Using the flatness factor for MIMO channels, we propose lattice codes universally achieving the secrecy capacity of compound MIMO wiretap channels up to a constant gap that is linear in the number of transmit  ...  The proposed approach improves upon existing works on secrecy coding for MIMO wiretap channels from an error probability perspective, and establishes information theoretical security (in fact semantic  ...  Notions of Security A secrecy code (or, more precisely, an (R, R , T ) secrecy code) for the compound MIMO channel consists of: .  ... 
doi:10.1109/tit.2019.2953929 fatcat:chryjg73yra6rof3myt7wtkjlu

Semantically Secure Lattice Codes for Compound MIMO Channels [article]

Antonio Campello, Cong Ling, Jean-Claude Belfiore
2019 arXiv   pre-print
The proposed approach improves upon existing works on secrecy coding for MIMO wiretap channels from an error probability perspective, and establishes information theoretic security (in fact semantic security  ...  Thanks to the algebraic structures of number fields and division algebras, our code construction for compound MIMO wiretap channels can be reduced to that for Gaussian wiretap channels, up to some additional  ...  ACKNOWLEDGMENT The authors would like to thank Laura Luzzi and Roope Vehkalahti for helpful discussions.  ... 
arXiv:1903.09954v2 fatcat:udkpghw3zfdndfrvn6eibvo3ly

On the continuity of the secrecy capacity of wiretap channels under channel uncertainty

Holger Boche, Rafael F. Schaefer, H. Vincent Poor
2015 2015 IEEE International Conference on Communications (ICC)  
The secrecy capacity of the compound wiretap channel is shown to be robust in the sense that it is a continuous function of the uncertainty set.  ...  In particular, this is done for channel uncertainty modeled via compound channels and arbitrarily varying channels, in which the legitimate users know only that the true channel realization is from a pre-specified  ...  CONTINUITY OF COMPOUND SECRECY CAPACITY Here, we analyze the secrecy capacity C S (W) of the compound wiretap channel and show that it is a continuous function of the uncertainty set W.  ... 
doi:10.1109/icc.2015.7248976 dblp:conf/icc/BocheSP15 fatcat:cluqxsyljrgotjn2v4ymymc6dy

On the Continuity of the Secrecy Capacity of Compound and Arbitrarily Varying Wiretap Channels

Holger Boche, Rafael F. Schaefer, H. Vincent Poor
2015 IEEE Transactions on Information Forensics and Security  
The secrecy capacity of the compound wiretap channel is shown to be robust in the sense that it is a continuous function of the uncertainty set.  ...  In particular, this is done for channel uncertainty modeled via compound channels and arbitrarily varying channels, in which the legitimate users know only that the true channel realization is from a pre-specified  ...  CONTINUITY OF COMPOUND SECRECY CAPACITY In this section, we analyze the secrecy capacity C S (W) of the compound wiretap channel and show that it is a continuous function of the uncertainty set W.  ... 
doi:10.1109/tifs.2015.2465937 fatcat:qnocsmzfpnh67lbpe2v4rfaznm

Broadcasting over fading wiretap channels

Yingbin Liang, Lifeng Lai, H. V. Poor, Shlomo Shamai
2012 2012 IEEE International Symposium on Information Theory Proceedings  
These examples also demonstrate the advantage of the proposed broadcast approach over the compound channel approach.  ...  For each scenario, the secrecy rate that can be achieved via the broadcast approach developed in this paper is derived, and the optimal power allocation over the layers (or the conditions on the optimal  ...  In particular, we focus on continuous power allocation functions, i.e., Σ(·) is a continuous function defined over [0, ∞). max Σ(x) ∞ |G| 2 S(x, Σ(x), Σ ′ (x))dx subject to 0 ≤ Σ(x) ≤ P, Σ ′ (x) ≤ 0, for  ... 
doi:10.1109/isit.2012.6283933 dblp:conf/isit/LiangLPS12 fatcat:o53ulygewbawxahmc3w3qpzgw4

A Broadcast Approach for Fading Wiretap Channels

Yingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai
2014 IEEE Transactions on Information Theory  
These examples also demonstrate the advantage of the proposed broadcast approach over the compound channel approach.  ...  For each scenario, the secrecy rate that can be achieved via the broadcast approach developed in this paper is derived, and the optimal power allocation over the layers (or the conditions on the optimal  ...  Tie Liu of Texas A&M University for his helpful discussions about the broadcast approach based on embedded coding.  ... 
doi:10.1109/tit.2013.2293756 fatcat:nv3d73vrjvehpdmki2l5mh62hm

The Magic of Superposition: A Survey on Simultaneous Transmission Based Wireless Systems [article]

Ufuk Altun, Gunes Karabulut Kurt, Enver Ozdemir
2022 arXiv   pre-print
The survey shows that simultaneous transmission can bring scalability, security, low-latency, low-complexity and energy efficiency for certain distributed wireless scenarios which are inevitable with the  ...  As prominent examples, non-orthogonal multiple access (NOMA), joint source-channel coding, and the computation codes are designed to exploit this scenario.  ...  The authors later propose an algorithm to approximate certain continuous multivariate functions by the nomographic function in [157] .  ... 
arXiv:2102.13144v2 fatcat:nuoy6idhfnagfdesjt666txery

Table of Contents

2021 2021 IEEE International Symposium on Information Theory (ISIT)  
MODULO SUM VIA MULTIPLE ACCESS CHANNEL .................................................... 1397 Masahito Hayashi, Southern University of Science and Technology, China D3-T4-S6.3: SECURE MULTI-FUNCTION  ...  Prabhakaran, Tata Institute of Fundamental Research, India D2-T4-S3.2: COMPOUND SECURE GROUPCAST: KEY ASSIGNMENT FOR ................................................... 694 SELECTED BROADCASTING Hua Sun  ... 
doi:10.1109/isit45174.2021.9518212 fatcat:vkpbkhd3kzaxtcwe53osdnt6ku

Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages [article]

Holger Boche, Gisbert Janßen, Sajad Saeedinaeeni
2020 arXiv   pre-print
To construct these codes we generalize random codes for transmission of public messages, to derive a universal superposition coding for the compound quantum broadcast channel.  ...  These codes are robust to channel uncertainties considered in the compound model.  ...  The starting point for our proof of Lemma 9 is the generic random coding bound from Hayashi and Nagaoka [23] we state below.  ... 
arXiv:1911.07753v2 fatcat:ixsvytscz5felh5ggn524as7ui

Toward virtual biopsy through an all fiber optic ultrasonic miniaturized transducer: a proposal

A. Acquafresca, E. Biagi, L. Masotti, D. Menichelli
2003 IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control  
decoding ........Product codes ............Bar codes ........Space-time codes ....Communication channels ........Channel allocation ........Channel capacity ........Channel estimation ........Channel  ...  coding ....Biological information theory ....Channel coding ........Block codes ............Linear codes ........Combined source-channel coding ........Turbo codes ....Codes ........Binary codes .....  ... 
doi:10.1109/tuffc.2003.1244749 fatcat:l3jre4etsvcqzfyz2jqggji3gy

Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions

Ying Wang, Pierre Moulin
2008 IEEE Transactions on Information Theory  
We derive (positive) capacity and random-coding exponents for perfectly-secure steganographic systems.  ...  secure steganographic codes from public watermarking codes using binning methods and randomized permutations of the code.  ...  Proposition 2: Under Def. 1 for steganographic codes and Def. 5 for the compound attack channel, the following random-coding error exponent is achievable: E Steg r (R) = lim L→∞ E Steg r,L (R), (17) where  ... 
doi:10.1109/tit.2008.921684 fatcat:cfow53o6yfd3pnjt5urrf3pgpa

Capacity results for compound wiretap channels

Igor Bjelakovic, Holger Boche, Jochen Sommerfeld
2011 2011 IEEE Information Theory Workshop  
compound wiretap channels given by Liang et al. and thus establishing a full coding theorem in this case.  ...  Moreover we prove a lower bound and a multi-letter converse to the secrecy capacity of the compound wiretap channel without channel state information.  ...  Our results are easily extended to arbitrary sets (even uncountable) of wiretap channels via standard approximation techniques [9] . II.  ... 
doi:10.1109/itw.2011.6089569 dblp:conf/itw/BjelakovicBS11 fatcat:4ehvzqqcebhlpp6zcidk3v2dgm

Neutron-capture cross sections from indirect measurements

J.E. Escher, J.T. Burke, F.S. Dietrich, J.J. Ressler, N.D. Scielzo, I.J. Thompson
2012 EPJ Web of Conferences  
Cross sections for compound-nuclear reactions reactions play an important role in models of astrophysical environments and simulations of the nuclear fuel cycle.  ...  Current implementations of the method provide useful cross sections for (n,f) reactions, but need to be improved upon for applications to capture reactions.  ...  Casperson for his help with  ... 
doi:10.1051/epjconf/20122101001 fatcat:76he7xzoazf2dc5ge2bojctnaq

Capacity results for compound wiretap channels [article]

Igor Bjelaković, Holger Boche, Jochen Sommerfeld
2011 arXiv   pre-print
compound wiretap channels given by Liang et al. and thus establishing a full coding theorem in this case.  ...  Moreover we prove a lower bound on the secrecy capacity of the compound wiretap channel without channel state information.  ...  Our results are easily extended to arbitrary sets (even uncountable) of wiretap channels via standard approximation techniques [9] . II.  ... 
arXiv:1103.0135v2 fatcat:od5qwtzxnbc2hkc3mfjkq5o64i
« Previous Showing results 1 — 15 out of 24,123 results