Key agreement from weak bit agreement

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 664-673

  Holenstein, Thomas ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Cryptography; Hard core Sets; Key Agreement

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; POLYNOMIALS; PROBABILITY;

COMPUTATIONAL TECHNIQUES; HARD-CORE SETS; KEY AGREEMENT;

NETWORK PROTOCOLS;

EID: 34848917325     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060689     Document Type: Conference Paper

References (22)

1. R. Ahlswede and I. Csiszár. Common randomness in information theory and cryptography - Part, I: secret sharing, IEEE Trans.on Inf. Th.,39(4):1121-1132.1993.
2. T. Cover and J. Thomas. Elements of Information Theory, John Wiley & Sons, Inc., first edition, 1991. ISBN 0-471-06259-6.
3. W. Diffie and M. E. Hellman. New directions in cryptography, IEEE Trans. on Inf. Theory, IT-22(6):644-654, 1976.
4. C. Dwork, M. Naor, and O. Reingold. Immunizing encryption schemes from decryption errors. In C. Cachin and J. Camenisch, ed., EUROCRYPT 2004, volume 3027 of LNCS, pages 342-360, 2004.
5. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. JACM, 33(4):792-807, 1986.
6. O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR-lemma. ECCC Report TR95-050, 1995.
7. J. Håstad, R. Impagliazzo, L. A. Levin, arid M. Luby. A pseudorandom generator from any one-way function. Siam J. on Comp., 28(4):1364-1396, 1999.
8. R. Impagliazzo. Hard-core distributions for somewhat hard problems, In 36th FOCS, pages 538-545, 1995.
9. R. Impagliazzo and M. Luby. One-way functions are essential for complexity based cryptography. In 30th FOCS, pages 230-235, 1989.
10. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In 21st STOC, pages 44-61, 1989.
11. A. R. Klivans and R. A. Servedio. Boosting and hard-core sets. In 40th FOCS, pages 624-633, 1999.
12. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. Siam J. on Comp., 17(2):373-386, 1988.
13. U. Maurer. Secret key agreement by public discussion. IEEE Trans. on Inf. Theory, 39(3):733-742, 1993.
14. U. Maurer and S. Wolf. Unconditionally secure key agreement and the intrinsic conditional information. IEEE Trans. on Inf. Theory, 45(2):499-514, 1999.
15. R. J. McEliece. A public key cryptosystern based on algebraic coding theory. DSN Progress Report 42-44:114-116, Jet Propulsion Lab, NASA, 1978.
16. R. Renner and S. Wolf. New bounds in secret-key agreement: The gap between formation and secrecy extraction, In E. Biham, ed., EUROCRYPT 2003, volume 2656 of LNCS, pages 562-577, 2003.
17. R. L. Rivest, A. Shamir, and L. M. Adelman, A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM, 21(2):120-126, 1978.
18. S. Rudich. The use of interaction in public cryptosystems. In J. Feigenbaum, ed., CRYPTO '91, volume 576 of LNCS, pages 242-251, 1991.
19. R. E. Schapire, The strength of weak learnability, Machine Learning, 5(2):197-227, 1990.
20. L. Trevisan. List-decoding using the XOR lemma. In 44th FOCS, pages 126-135, 2003.
21. J. von Neumann. Zur Theorie der Gesellschaftsspiele. Mathematische Annalen, 100:295-320, 1928.
22. I. Wegener. The Complexity of Boolean Functions. John Wiley & Sons Ltd, and B. G. Teubner, Stuttgart, 1987. ISBN 0-471-91555-6, available on ECCC.