Exposure-resilient functions and all-or-nothing transforms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1807, Issue , 2000, Pages 453-469

  Canetti, Ran ^a   Dodis, Yevgeniy ^b   Halevi, Shai ^a   Kushilevitz, Eyal ^c   Sahai, Amit ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

COMPUTATIONAL CONSTRUCTION; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC SYSTEMS; DETERMINISTIC FUNCTIONS; PARTIAL KEY EXPOSURE; PRIVATE KEY CRYPTOGRAPHY; PSEUDORANDOM GENERATORS; RANDOM ORACLE MODEL;

CRYPTOGRAPHY;

EID: 84948973494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_33     Document Type: Conference Paper

References (26)

1. M. Bellare, S. Miner. A Forward-Secure Digital Signature Scheme. In Proc. Of Crypto, pp. 431-448, 1999.
2. M. Bellare, P. Rogaway. Optimal Asymetric Encryption. In Proc. of EuroCrypt, pp. 92-111, 1995.
3. G. Blackley. Safeguarding Cryptographic Keys. In Proc. of AFIPS 1979 National Computer Conference, 1979.
4. V. Boyko. On the Security Properties of the OAEP as an All-or-Nothing Transform. In Proc. of Crypto, pp. 503-518, 1999.
5. R. Canetti, O. Goldreich and S. Halevi. The Random-Oracle Model, Revisited. In Proc. of STOC, pp. 209-218, 1998.
6. B. Chor, J. Friedman, O. Goldreich, J. Hastad, S. Rudich, R. Smolensky. The Bit Extraction Problem or t-resilient Functions. In Proc. of FOCS, pp. 396-407, 1985.
7. W. Diffie, P. van Oorschot and M. Wiener. Authentication and authenticated key exchanges. Designs, Codes and Cryptography, 2: 107-125, 1992.
8. A. Dornan. New Viruses Search For Strong Encryption Keys. In PlanetIT Systems Management News, March, 1999, http://www.planetit.com/techcenters/docs/systems_management/news/PIT19990317S0015.
9. O. Goldreich. Foundations of Cryptography (Fragments of a Book). Available at http://www.wisdom.weizmann.ac.il/home/oded/public_html/frag.html
10. O. Goldreich. A Note on Computational Indistinguishability. In IPL, 34: 277-281, 1990.
11. O. Goldreich, S. Goldwasser and S. Micali. How to construct random functions. Journal of the ACM, 33(4): 210-217, 1986.
12. J. Hastad, R. Impagliazzo, L. Levin, M. Luby. A Pseudorandom generator from any one-way function. In Proc. of STOC, 1989.
13. R. Impagliazzo, L. Levin, M. Luby. Pseudorandom Generation from one-way functions. In Proc. of STOC, pp. 12-24, 1989.
14. M. Jakobsson, J. Stern, M. Yung. Scramble All, Encrypt Small. In Proc. of Fast Software Encryption, pp. 95-111, 1999.
15. H. Krawczyk. Secret Sharing Made Short. In Proc. of Crypto, pp. 136-146, 1993.
16. F. MacWilliams, J. Sloane. Theory of Error-Correcting Codes, Amsterdam, 1981.
17. J. Naor, M. Naor. Small-Bias Probability Spaces: Eçient Constructions and Applications. In SIAM J. Computing, 22(4): 838-856, 1993.
18. R. Raz, O. Reingold, S. Vadhan. Error Reduction for Extractors. In Proc. Of FOCS, pp. 191-201, 1999.
19. R. Rivest. All-or-Nothing Encryption and the Package Transform. In Fast Software Encryption, LNCS, 1267: 210-218, 1997.
20. A. Shamir. How to share a secret. In Communic. of the ACM, 22: 612-613, 1979.
21. A. Shamir, N. van Someren. Playing “hide and seek” with stored keys. In Proc. of Financial Cryptography, 1999.
22. S. U. Shin, K. H. Rhee. Hash functions and the MAC using all-or-nothing property. In Proc. of Public Key Cryptography, LNCS, 1560: 263-275, 1999.
23. N. van Someren. How not to authenticate code. Crypto’98 Rump Session, Santa Barbara, 1998.
24. A. Srinivasan, D. Zuckerman. Computing with Very Weak Random Sources. In Proc. of FOCS, pp. 264-275, 1994.
25. D. Stinson. Something About All or Nothing (Transforms). Available from http://cacr.math.uwaterloo.ca/~dstinson/papers/AON.ps, 1999.
26. L. Trevisan. Construction of Extractors Using PseudoRandom Generators. In Proc. of STOC, pp. 141-148, 1999.