On cryptography with auxiliary input

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 621-630

  Dodis, Yevgeniy ^a   Kalai, Yael Tauman ^b   Lovett, Shachar ^c  

^a NEW YORK UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Auxiliary information; Code obfuscation; Encryption schemes; Error correcting codes; Learning parity with noise; Randomness extractors

Indexed keywords

AUXILIARY INFORMATION; CODE OBFUSCATION; ENCRYPTION SCHEMES; ERROR-CORRECTING CODES; LEARNING PARITY WITH NOISE; RANDOMNESS EXTRACTORS;

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; EDUCATION; INFORMATION THEORY; NETWORK SECURITY;

CRYPTOGRAPHY;

EID: 70350674336     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536498     Document Type: Conference Paper

References (53)

1. A. Akavia, S. Goldwasser, and V. Vaikuntanathan. Simultaneous Hardcore Bits and Cryptography Against Memory Attacks. In TCC 2009: 474-495.
2. B. Applebaum. Fast Cryptographic Primitives Based on the Hardness of Decoding Random Linear Code. Unpublished Manuscript.
3. B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. P. Vadhan, and K. Yang. On the (Im)possibility of Obfuscating Programs. In CRYPTO 2001: 1-18.
4. B. Barak, R. Shaltiel, and A. Wigderson. Computational analogues of entropy . In Proc. of 7th Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), 2003.
5. M. Bellare and C. Namprempre. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm In Advances in Cryptology - ASIACRYPT, volume 1976 of Lecture Notes in Computer Science, pp. 531-545, 2000.
6. A. Blum, M. L. Furst, M. J. Kearns, and R. J. Lipton.Cryptographic Primitives Based on Hard Learning Problems. In CRYPTO 1993: 278-291.
7. A. Blum, A. Kalai, and H. Wasserman. Noise-tolerantlearning, the parity problem, and the statistical query model. In STOC 2000: 435-440.
8. X. Boyen. Reusable cryptographic fuzzy extractors. In ACM Conference on Computer and Communications Security 2004: 82-91.
9. X. Boyen, Y. Dodis, J. Katz, R. Ostrovsky, A. Smith. Secure Remote Authentication Using Biometric Data. In EUROCRYPT, pp. 147-163, 2005.
10. R. Canetti. Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information. In CRYPTO1997: 455-469.
11. R. Canetti, R. R. Dakdouk. Obfuscating Point Functions with Multibit Output. In EUROCRYPT 2008: 489-508.
12. R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz, and A. Sahai. Exposure-Resilient Functions and All-or-Nothing Transforms. In EUROCRYPT 2000: 453-469.
13. R. Canetti, D. Eiger, S. Goldwasser, and D. Lim. How to Protect Yourself without Perfect Shredding. In ICALP (2) 2008: 511-523.
14. R. Canetti, D. Micciancio, and O. Reingold. Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). In STOC 1998: 131-140.
15. D. Cash, Y. Z. Ding, Y. Dodis, W. Lee, R. J. Lipton, and S. Walfish. Intrusion-Resilient Key Exchange in the Bounded Retrieval Model. In TCC 2007: 479-498.
16. J. Coron, M. Joye, D. Naccache, and P. Paillier. Universal Padding Schemes for RSA. In CRYPTO 2002: 226-241.
17. G. Di Crescenzo, R. Lipton and S. Walfish. Perfectly Secure Password Protocols in the Bounded Retrieval Model. In Theory of Cryptography Conference, pp. 225-244, 2006.
18. Y. Dodis. PhD Thesis, "Exposure-Resilient Cryptography". Massachusetts Institute of Technology, August 2000.
19. Y. Dodis, Y. Kalai, and S. Lovett. On Cryptiography with Auxiliary Input. Preliminary version in STOC 2009. Full Version.
20. Y. Dodis, J. Katz, L. Reyzin, and A. Smith. Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. In CRYPTO 2006: 232-250.
21. Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. In SIAM Journal of Computing, 38(1):97-139, 2008.
22. Y. Dodis, L. Reyzin, A. Smith. Fuzzy Extractors. In Security with Noisy Data (edited by Pim Tuyls, Boris Skoric, and Tom Kevenaar), Springer, 2007.
23. Y. Dodis, A. Smith. Correcting Errors Without Leaking Partial Information In STOC 2005: 654-663.
24. S. Dziembowski. On Forward-Secure Storage. In CRYPTO 2006: 251-270.
25. S. Dziembowski. Intrusion-Resilience Via the Bounded-Storage Model. In TCC 2006: 207-224.
26. S. Dziembowski and K. Pietrzak. Intrusion-Resilient Secret Sharing. In FOCS 2007: 227-237.
27. S. Dziembowski and K. Pietrzak. Leakage-Resilient Cryptography. In FOCS 2008: 293-302.
28. G. Forney. Concatenated Codes. MIT Press, Cambridge, MA, 1966.
29. S. Goldwasser and Y. T. Kalai. On the Impossibility of Obfuscation with Auxiliary Input. In FOCS 2005: 553-562.
30. O. Goldreich and L. A. Levin. A Hard-Core Predicate for all One-Way Functions. In STOC 1989: 25-32.
31. S. Goldwasser and G. N. Rothblum. On Best-Possible Obfuscation. In TCC 2007: 194-213.
32. S. Haber and B. Pinkas. Securely combining public-key cryptosystems. In ACM Conference on Computer and Communications Security 2001:215-224.
33. S. Hada. Zero-Knowledge and Code Obfuscation. In ASIACRYPT 2000: 443-457.
34. D. Hofheinz, J. Malone-Lee and M. Stam. Obfuscation for Cryptographic Purposes. In TCC 2007: 214-232.
35. S. Hohenberger, G. N. Rothblum, A. Shelat, and V. Vaikuntanathan. Securely Obfuscating Re-encryption. In TCC 2007: 233-252.
36. N. J. Hopper, Manuel Blum. Secure Human Identification Protocols. In ASIACRYPT 2001:52-66.
37. C. Hsiao, C. Lu, and L. Reyzin. Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility. In EUROCRYPT 2007: 169-186.
38. Y. Ishai, M. Prabhakaran, A. Sahai, and D. Wagner. Private Circuits II: Keeping Secrets in Tamperable Circuits. In EUROCRYPT 2006: 308-327.
39. Y. Ishai, A. Sahai, and D. Wagner. Private Circuits: Securing Hardware against Probing Attacks. In CRYPTO 2003: 463-481.
40. A. Juels and S. A. Weis. Authenticating Pervasive Devices with Human Protocols. In CRYPTO 2005:293-308.
41. J. Katz and J. S. Shin. Parallel and Concurrent Security of the HB and HB+ Protocols. In EUROCRYPT 2006:73-87.
42. B. Lynn, M. Prabhakaran, and A. Sahai. Positive Results and Techniques for Obfuscation. In EUROCRYPT 2004: 20-39.
43. S. Micali and L. Reyzin. Physically Observable Cryptography (Extended Abstract). In TCC 2004: 278-296.
44. M. Naor. On Cryptographic Assumptions and Challenges. In CRYPTO 2003: 96-109.
45. M. Naor and M Ying. Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In STOC 1990: 427-437.
46. N. Nisan and D. Zuckerman. More deterministic simulation in logspace. In STOC, pp. 235-244, 1993.
47. K. Pietrzak. A Leakage-Resilient Mode of Operation. In EUROCRYPT 2009.
48. R. Raz. Private communication.
49. O. Regev. On lattices, learning with errors, random linear codes, and cryptography. In STOC 2005: 84-93.
50. A. Sahai. Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In FOCS, pp. 543-553, 1999.
51. A.Shamir. Identity-Based Cryptosystems and Signature Schemes. In CRYPTO 1984: 47-53.
52. H. Wee. On obfuscating point functions. In STOC, pp. 523-532.
53. D. Zuckerman. Private communication.