Confidential communication scheme based on uncertainty of underwater noisy channels

Ming XU; Fang CHEN

doi:10.11959/j.issn.1000-436x.2019055

您当前的位置：

首页 >

文章列表页 >

Confidential communication scheme based on uncertainty of underwater noisy channels

Topics:Marine Information Perception,Transmission and Fusion | 更新时间：2024-06-05

- Confidential communication scheme based on uncertainty of underwater noisy channels
- Journal on Communications Vol. 40, Issue 4, Pages: 33-42(2019)
- 作者机构：
  
  1. 上海海事大学信息工程学院，上海 201306
  2. 同济大学电子与信息工程学院，上海 201804
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61202370);The China Postdoctoral Science Foundation Projects(2014M561512)
- DOI：10.11959/j.issn.1000-436x.2019055
  CLC： TP309
- Online First：2019-04，
  
  Published：25 April 2019
- 稿件说明：
移动端阅览
Ming XU, Fang CHEN. Confidential communication scheme based on uncertainty of underwater noisy channels[J]. Journal on Communications, 2019, 40(4): 33-42.
DOI：

Ming XU, Fang CHEN. Confidential communication scheme based on uncertainty of underwater noisy channels[J]. Journal on Communications, 2019, 40(4): 33-42. DOI： 10.11959/j.issn.1000-436x.2019055.

摘要

针对水下噪声不确定性对信息传输产生的影响和噪声信道中通信面临的安全问题，提出一种基于水下噪声信道不确定性的保密通信方案。该方案由基于哥德尔编码的交互式密钥提取协议和基于r-循环Toeplitz矩阵的保密增强协议组成。在密钥提取的过程中，通过引入哥德尔编码，减少了密钥序列的比较次数；在计算保密增强后的密钥长度时，考虑了水下噪声的不确定性，具有更强的实际意义。实验结果表明，在满足协议安全性的条件下，传输的总比特数为119 940 bit，保密增强后生成的密钥串总长度的下界为117 331 bit，敌手关于密钥串信息量的上界为2 609 bit，所需时间为11.99 s，并且所提出的(nt+s)×(nt+s)阶r-循环Toeplitz矩阵比传统的同阶Toeplitz矩阵减少了(nt+s)-1 bit存储空间。

Abstract

Aiming at the influence of the uncertainty of underwater noise on information transmission and the security problem of the communication over noisy channels

a confidential communication scheme based on the uncertainty of underwater noisy channels was proposed.The proposed scheme was composed of an interactive key extraction protocol based on Godel’s code and a privacy amplification protocol based on r-circulant Toeplitz matrix.During the process of key extraction

the key sequence comparing number was reduced through the Godel’s code.When calculating the key length after privacy amplification

the uncertainty of underwater noise was considered to make the proposed scheme more practical.Experimental results show that under the condition of satisfying protocol security

it takes 11.99 s to transmit 119 940 bit string where the lower bound of the generated secret key length is 117 331 bit after privacy amplification and the upper bound of the adversary’s information about the secret key is 2 609 bit.Moreover

the proposed scheme (nt+s)×(nt+s)-order r-circulant Toeplitz matrix decreases(nt+s)-1 bit memory space compared to the traditional Toeplitz matrix with the same order.

关键词

Keywords

references

HAN G , JIANG J , SUN N , et al . Secure communication for underwater acoustic sensor networks [J ] . IEEE Communications Magazine , 2015 , 53 ( 8 ): 54 - 60 .

LAL C , PETROCCIA R , PELEKANAKIS K , et al . Toward the development of secure underwater acoustic networks [J ] . IEEE Journal of Oceanic Engineering , 2017 , 42 ( 4 ): 1075 - 1087 .

CHEN K , MA M , CHENG E , et al . A survey on MAC protocols for underwater wireless sensor networks [J ] . IEEE Communications Surveys ＆ Tutorials , 2014 , 16 ( 3 ): 1433 - 1447 .

笪良龙 . 海洋水声环境效应建模与应用 [M ] . 北京 : 科学出版社 , 2012 .

DA L L . Modeling and application of oceanic acoustic environmental effect [M ] . Beijing : Science PressPress , 2012 .

GÖDEL K . On formally undecidable propositions of principia mathematica and related systems [M ] . Courier Corporation , 1992 .

BENNETT C H , BRASSARD G , ROBERT J M . Privacy amplification by public discussion [J ] . Siam Journal on Computing , 1988 , 17 ( 2 ): 210 - 229 .

HAYASHI M , TAN Y F . Equivocations,exponents,and second-order coding rates under various Rényi information measures [J ] . IEEE Transactions on Information Theory , 2017 , 63 ( 2 ): 975 - 1005 .

JIANG Z , ZHOU J . A note on spectral norms of even-order r-circulant matrices [J ] . Applied Mathematics and Computation , 2015 , 250 : 368 - 371 .

KRESSNER D , LUCE R . Fast computation of the matrix exponential for a Toeplitz matrix [J ] . SIAM Journal on Matrix Analysis and Applications , 2018 , 39 ( 1 ): 23 - 47 .

BENNETT C H , BRASSARD G , CREPEAU C , et al . Generalized privacy amplification [J ] . IEEE Transactions on Information Theory , 1995 , 41 ( 6 ): 1915 - 1923 .

ANCEAUME E , BUSNEL Y . A distributed information divergence estimation over data streams [J ] . IEEE Transactions on Parallel and Distributed Systems , 2014 , 25 ( 2 ): 478 - 487 .

HAYASHI M . Security analysis of ε-alm ost dual universal 2 hash functions:smoothing of min entropy vs.smoothing of Rényi entropy of order 2 [J ] . IEEE Transactions on Information Theory , 2016 , 62 ( 6 ): 3451 - 3476 .

WEGMAN M N , CARTER J L . New hash functions and their use in authentication and set equality [J ] . Journal of Computer and System Sciences , 1981 , 22 ( 3 ): 265 - 279 .

MAURER U , WOLF S . Secret-key agreement over unauthenticated public channels-part Ⅲ:privacy amplification [J ] . IEEE Transactions on Information Theory , 2003 , 49 ( 4 ): 832 - 838 .

BERTA M , FAWZI O , SCHOLZ V . Quantum-proof randomness extractors via operator space theory [J ] . IEEE Transactions on Information Theory , 2017 , 63 ( 4 ): 2480 - 2503 .

MILLER C A , SHI Y . Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices [J ] . Journal of the ACM , 2016 , 63 ( 4 ):33.

TAN Y F , HAYASHI M . Analysis of remaining uncertainties and exponents under various conditional Rényi entropies [J ] . IEEE Transactions on Information Theory , 2018 , 64 ( 5 ): 3734 - 3755 .

ISHII M , DETREY J , GAUDRY P , et al . Fast modular arithmetic on the Kalray MPPA-256 processor for an energy-efficient implementation of ECM [J ] . IEEE Transactions on Computers , 2017 , 66 ( 12 ): 2019 - 2030 .

KRAFT J , WASHINGTON L . An introduction to number theory with cryptography [M ] . Chapman and Hall/CRC Press , 2018 .

HAYASHI M , TSURUMARU T . More efficient privacy amplification with less random seeds via dual universal hash function [J ] . IEEE Transactions on Information Theory , 2016 , 62 ( 4 ): 2213 - 2232 .

BARDENET R , DOUCET A , HOLMES C . On Markov chain Monte Carlo methods for tall data [J ] . The Journal of Machine Learning Research , 2017 , 18 ( 1 ): 1515 - 1557 .

王栋 , 吴吉春 . 信息熵理论在水系统中的研究与应用 [M ] . 北京 : 中国水利水电出版社 , 2012 .

WANG D , WU J C . Research and application of Information entropy theory in water system [M ] . Beijing : China Water and Power PressPress , 2012 .

AMAR A , AVRASHI G , STOJANOVIC M . Low complexity residual doppler shift estimation for underwater acoustic multicarrier communication [J ] . IEEE Transactions on Signal Processing , 2017 , 65 ( 8 ): 2063 - 2076 .

Views

1408

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Low-complexity single carrier time domain equalization algorithm

Research on self-training neural machine translation based on monolingual priority sampling

Multi-sensor data fusion method for water quality evaluation based on interval evidence theory

Related Author

HE Shiwen

GUAN Peiwen

PENG Chengzuo

DENG Xunzhe

AN Zhenyu

ZHANG Xiaoyan

PANG Lei

DU Xiaofeng

Related Institution

School of Software, Xinjiang University

School of Computer Science and Engineering, Central South University

Purple Mountain Laboratories

School of Computer Science (National Pilot Software Engineering School), Beijing University of Posts and Telecommunications

College of Computer, Nanjing University of Posts and Telecommunications

AI问答

⁰