Name
Abstract | ||
|---|---|---|
In 1949, Shannon proved the perfect secrecy of the Ver- nam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible OTP which is transmitted needs to have a length equal to the message length for this result to be true. In this paper, we prove that the length of the transmitted OTP actually contains useful informa- tion and could be exploited to compress the transmitted- OTP while retaining perfect secrecy. The message bits can be interpreted as True/False statements about the OTP, a private object, leading to the notion of private- object cryptography. |
Year | Venue | Keywords |
|---|---|---|
2008 | International Journal of Network Security | one time pad |
DocType | Volume | Citations |
Journal | abs/cs/050 | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nithin Nagaraj | 1 | 22 | 9.28 |
| Vivek Vaidya | 2 | 10 | 3.15 |
| Prabhakar G. Vaidya | 3 | 5 | 1.16 |