Basing Weak Public-Key Cryptography on Strong One-Way Functions

DOI10.1007/978-3-540-78524-8_4zbMath1162.94339OpenAlexW1484225000MaRDI QIDQ5445498

Yaron J. Goren, Yuval Ishai, Eli Biham

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_4

zbMATH Keywords

quantum computingone-way functionsPublic-key cryptographybounded storage modelMerkle's puzzles

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

On building fine-grained one-way functions from strong average-case hardness ⋮ Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles ⋮ On the impossibility of key agreements from quantum random oracles ⋮ Fine-grained non-interactive key-exchange: constructions and lower bounds ⋮ Anonymous whistleblowing over authenticated channels ⋮ Distributed Merkle's puzzles ⋮ Fine-grained cryptography revisited ⋮ Weak Oblivious Transfer from Strong One-Way Functions ⋮ Fine-Grained Cryptography ⋮ The Complexity of Public-Key Cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One way functions and pseudorandom generators
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Secure communications over insecure channels
• On the randomness complexity of efficient sampling
• On Yao’s XOR-Lemma
• On obfuscating point functions
• Key agreement from weak bit agreement
• Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
• A cryptanalytic time-memory trade-off
• Foundations of Cryptography
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Rigorous Time/Space Trade-offs for Inverting Functions
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography

This page was built for publication: Basing Weak Public-Key Cryptography on Strong One-Way Functions