arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0705.2243quant-ph
收藏

因特网上随机比特的安全共享

Secure sharing of random bits over the Internet

Geraldo A. Barbosa

摘要:

虽然一次性密码本加密文件可以通过互联网渠道发送,但需要更新共享密钥,这使得这种方法不实用。本文提出了一种在任意Internet信道上实现随机密钥快速共享的方案。从长度为K_0的共享密钥序列开始,用户最终得到安全的新序列K >> K_0。使用这些序列进行后验消息加密,合法用户具有绝对的安全控制,而不需要第三方。此外,安全级别不依赖于素数中的因数分解的未经证明的困难。在该方案中,一个快速的光随机源产生随机比特和噪声的密钥更新。传输的信号是记录的信号,携带要交换的随机二进制信号和攻击者无法消除的物理噪声。这些信号允许在不降低安全性的情况下通过互联网网络进行放大。所提出的系统也是安全的,对后验已知的明文攻击的密钥。信息理论分析和安全操作的界限定量确定。

英文摘要:

Although one-time pad encrypted files can be sent through Internet channels, the need for renewing shared secret keys have made this method unpractical. This work presents a scheme to turn practical the fast sharing of random keys over arbitrary Internet channels. Starting with a shared secret key sequence of length K_0 the users end up with a secure new sequence K >> K_0. Using these sequences for posteriori message encryption the legitimate users have absolute security control without the need for third parties. Additionally, the security level does not depend on the unproven difficulty of factoring numbers in primes. In the proposed scheme a fast optical random source generates random bits and noise for key renewals. The transmitted signals are recorded signals that carries both the random binary signals to be exchanged and physical noise that cannot be eliminated by the attacker. These signals allow amplification over the Internet network without degrading security. The proposed system is also secure against a-posteriori known-plaintext attack on the key. Information-theoretic analysis is presented and bounds for secure operation are quantitatively determined.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑