Basing weak public-key cryptography on strong one-way functions

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

Volumn 4948 LNCS, Issue , 2008, Pages 55-72

  Biham, Eli ^a   Goren, Yaron J ^b   Ishai, Yuval ^a,c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Rosetta Genomic   (Israel)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bounded storage model; Merkle's puzzles; One way functions; Public key cryptography; Quantum computing

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; FUNCTION EVALUATION; FUNCTIONS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; LAWS AND LEGISLATION; LEARNING ALGORITHMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; QUADRATIC PROGRAMMING; QUANTUM COMPUTERS; SECURITY OF DATA; SLITTING MACHINES; STORAGE (MATERIALS);

(E ,2E) THEORY; BLACK BOXES; BOUNDED STORAGE MODEL; CONNECTIONS (STRUCTURAL); GROVER'S QUANTUM SEARCH ALGORITHMS; HEIDELBERG (CO); KEY AGREEMENT PROTOCOLS; ONE WAY FUNCTIONS; ONE-WAY FUNCTIONS (OWF); PRIVATE-KEY ENCRYPTION; PUBLIC-KEY CRYPTOGRAPHY; QUADRATIC SPEEDUP; QUANTUM COMPUTING; RANDOM ORACLE MODELS; RUNNING TIME; SECRET KEYS; SECURE PROTOCOLS; SPRINGER (CO); STRENGTH (IGC: D5/D6); XOR LEMMA;

COMPUTER NETWORKS;

EID: 40349087309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78524-8_4     Document Type: Conference Paper

References (23)

1. Boneh, D., Naor, M.: Timed Commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 236-254. Springer, Heidelberg (2000)
2. Cachin, C. Maurer, U.: Unconditional Security Against Memory-Bounded Adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292-306. Springer, Heidelberg (1997)
3. Ding, Y., Harnik, D., Shltiel, R., Rosen, A.: Constant-Round Oblivious Transfer in the Bounded Storage Model. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, Springer, Heidelberg (2004)
4. Dubrov, B., Ishai, Y.: On the randomness complexity of efficient sampling. In: Proceedings of STOC 2006, pp. 711-720 (2006)
5. Fiat, A., Naor, M.: Rigorous Time/Space Trade-offs for Inverting Functions. SIAM J. Comput. 29(3), 790-803 (1999)
6. Gertner, Y., Kannan, S., Malkin, T. Reingold, O., Viswanathan, M.: The Relationship between Public Key Encryption and Oblivious Transfer. In: Proc. of the 41st Annual Symposium on Foundations of Computer Science (FOCS) (2000)
7. Goldreich, O.: Foundations of Cryptography Basic Tools. Cambridge University Press, Cambridge (2001)
8. Goldreich, O., Levin, L.: A Hard-Core Predicate for all One-Way Functions. In: STOC 1989, pp. 25-32 (1989)
9. Goldreich, O., Nisan, N., Wigderson, A.: On Yao's XOR lemma. Technical Report TR95-50, Electronic Colloquium, on Computational Complexity (1995)
10. Grover, L: A Fast Quantum Mechanical Algorithm for Database Search. In: Proceedings of the 28th Annual. ACM Symposium on the Theory of Computing, May 1996, p. 212 (1996)
11. Haitner, I., Harnik, D., Reingold, O.: Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 228-239. Springer, Heidelberg (2006)
12. Hellman, M.E.: A Cryptanalytic Time-Memory Trade-Off. IEEE Transactions on Information Theory IT-26(4), 401-406 (1980)
13. Holenstein, T.: Key Agreement from Weak Bit Agreement. In: Proceedings of STOC 2005, pp. 664-673 (2005)
14. Holenstein, T.: Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 443-461. Springer, Heidelberg (2006)
15. Impagliazzo, R., Luby, M.: One-Way Functions are Essential, for Complexity-Based Cryptography. In: 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 230-235. IEEE, Los Alamitos (1989)
16. Impagliazzo, R., Rudich, S.: Limits on the Provable Consequences of One-way Permutations. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 44-61 (1989)
17. Levin, L.A.: One-Way Functions and Pseudorandom Generators. Combinatorica 7(4), 357-363 (1987) Earlier version in STOC 1985
18. Maurer, U.: Conditionally-Perfect Secrecy and a Provably Secure Randomized Cipher. Journal of Cryptology 5(1), 53-66 (1992)
19. Merkle, R.: Secure communications over insecure channels. CACM, 294-299 (April 1978)
20. Reingold, O., Trevisan, L., Vadhan, S.: Notions of Reducibility between Cryptgraphic Primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1-20. Springer, Heidelberg (2004)
21. Rudich, S.: Limits on the Provable Consequences of One-way Functions. Ph.D. thesis
22. Shor, P.W.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantom Computer. SIAM J. Comp. 26(5), 1484-1509 (1997)
23. Wee, H.: On obfuscating point functions. In: STOC 2005, pp. 523-532 (2005)