Abstract
The use of noise as a powerful ally of cryptographers for bit commitment and oblivious transfer in computer networks was analyzed. The optimal use of discrete memoryless channels by commiting to a set of strings was also analyzed. Noise less communication could be possible by using a certain number number of invocations of aa coin tossing protocol. The result shows an interesting separation between coin tossing and cryptographic primitives.
| Original language | English |
|---|---|
| Pages (from-to) | 45 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2004 |
| Externally published | Yes |
| Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: 27 Jun 2004 → 2 Jul 2004 |