Information Theory and Reliable Communication
Information Theory and Reliable Communication
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
BUPLE: securing passive RFID communication through physical layer enhancements
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
Revisiting a secret sharing approach to network codes
ProvSec'12 Proceedings of the 6th international conference on Provable Security
| Hi-index | 0.00 |
Consider the following situation. K data hits are to be encoded into N K bits and transmitted over a noiseless channel. An intruder can observe a subset of his choice of size 碌 N. The encoder is to be designed to maximize the intruder's uncertainty about the data given his N intercepted channel bits, subject to the condition that the intended receiver can recover the K data bits perfectly from the N channel bits. The optimal tradoffs between the parameters K, N, 碌. and the intruder's uncertainty H (H is the "conditional entropy" of the data given the 碌. intercepted channel bits) were found. In particular, it was shown that for 碌 = N - K, a system exists with H 驴 K - 1. Thus, for example, when N = 2K and 碌 = K, it is possible to encode the K data bits into 2K channel bits, so that by looking at any K channel bits, the intruder obtains essentially no information about the data.