Zero-error information and applications in cryptography

2004 IEEE Information Theory Workshop - Proceedings, ITW

Volumn , Issue , 2004, Pages 1-6

  Wolf, Stefan ^a   Wullschleger, Jürg ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COIN TOSSING; COMPUTATIONAL SECURITY; RANDOM VARIABLES; ZERO ERROR INFORMATION;

CHANNEL CAPACITY; ENTROPY; ERROR ANALYSIS; INFORMATION THEORY; PROBABILITY; RANDOM PROCESSES; SECURITY OF DATA; SET THEORY; THEOREM PROVING;

CRYPTOGRAPHY;

EID: 19544368112     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Charles Bennett, Gilles Brassard, Claude Crepeau, and Ueli Maurer. Generalized privacy amplifi cation. IEEE Transactions on Information Theory, Vol. 41, 1995.
2. Manuel Blum. Coin flpping by telephone: A protocol for solving impossible problems. In Proceedings of the 24th IEEE Computer Conference, pages 133-137, 1982.
3. Claude Cr'epeau. Efficient cryptographic protocols based on noisy channels. In Advances in Cryptology: EUROCRYPT'97, Lecture Notes in Computer Science, Springer-Verlag, 1997.
4. Claude Crepeau, Kirill Morozov, and Stefan Wolf. Oblivious transfer from any noisy channel. To appear in Proceedings of SCN'04, Springer-Verlag, 2004.
5. Ivan Damgård, Joe Kilian, and Louis Salvail. On the (im) possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In Advances in Cryptology: CRYPTO'99, volume 1592 of Lecture Notes in Computer Science, pages 56-73. Springer-Verlag, 1999.
6. Matthias Fitzi, Stefan Wolf, and Jürg Wullschleger. Pseudo-signatures, broadcast, and multi-party computation from correlated randomness. In Advances in Cryptology: CRYPTO'04, Lecture Notes in Computer Science. Springer-Verlag, 2004.
7. Hideki Imai, Jörn Müller-Quade, Anderson Nascimento, and Andreas Winter. Rates for bit commitment and coin tossing from noisy correlation. In Proceedings of the IEEE International Symposium on Information Theory (ISTT'04), 2004.
8. Hideki Imai, Anderson Nascimento, and Andreas Winter. Oblivious transfer from any genuine noise. Unpublished manuscript, 2004.
9. Ari Juels, Markus Jakobsson, Elizabeth Shriver, and Bruce K. Hillyer. How to turn loaded dice into fair coins. IEEE Transactions on Information Theory, Vol. 46, 2000.
10. Joe Kilian. Founding cryptography on oblivious transfer, In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 20-31, 1988.
11. J'anos Körner and Alon Orlitsky. Zero-error information theory. IEEE Transactions on Information Theory, Vol. 44, 1998.
12. Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982.
13. Ueli Maurer. Secret key agreement by public discussion. IEEE Transaction on Information Theory, 39(3):733-742, 1993.
14. Michael O. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981.
15. Ronald L. Rivest. Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer. Unpublished manuscript, 1999.
16. Claude E. Shannon. A mathematical theory of communication. Bell System Tech. Journal, 27:379-423, 623-656, 1948.
17. Claude E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28(4), 1949.
18. Claude E. Shannon. The zero-error capacity of a noisy channel. IEEE Transactions on Information Theory, 1956.
19. Aaron D. Wyner. The wire-tap channel. Bell System Tech. Journal, 54:1355-1387, 1975.