具有猜测窃听器的香农密码系统:一般来源
The Shannon Cipher System with a Guessing Wiretapper: General Sources
摘要:
本文利用Merhav & Arikan提出的计算保密性概念,在一般信源的背景下研究了Shannon密码系统。边界上的猜测时刻的极限指数一般来源。的界限被证明是紧的iid,马尔可夫,单线源,从而恢复一些已知的结果。建立了固定码率信源压缩的错误指数和正确解码指数与猜测矩指数之间的密切关系。
英文摘要:
The Shannon cipher system is studied in the context of general sources using a notion of computational secrecy introduced by Merhav & Arikan. Bounds are derived on limiting exponents of guessing moments for general sources. The bounds are shown to be tight for iid, Markov, and unifilar sources, thus recovering some known results. A close relationship between error exponents and correct decoding exponents for fixed rate source compression on the one hand and exponents for guessing moments on the other hand is established.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。