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

DOI10.1007/978-3-540-78524-8_4MaRDI QIDQ5445498zbMATH OpenOpenAlexFDO

Authors Eli Biham, Yaron J. Goren, Yuval Ishai

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)

Recommendations

• scientific article; zbMATH DE number 4185033
• Key establishment à la Merkle in a quantum world
• Complexity Measures for Public-Key Cryptosystems
• Merkle puzzles in a quantum world
• Absolute results concerning one-way functions and their applications

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1088242 (Why is no real title available?)
• scientific article; zbMATH DE number 1759782 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• A cryptanalytic time-memory trade-off
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
• Foundations of Cryptography
• Key agreement from weak bit agreement
• On Yao's XOR-lemma
• On obfuscating point functions
• On the randomness complexity of efficient sampling
• One way functions and pseudorandom generators
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Rigorous Time/Space Trade-offs for Inverting Functions
• Secure communications over insecure channels
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography

Cited in

(17)

• On building fine-grained one-way functions from strong average-case hardness
• One private-key for all DL-based cryptosystems
• Fine-grained non-interactive key-exchange: constructions and lower bounds
• Fine-grained cryptography revisited
• Anonymous whistleblowing over authenticated channels
• Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
• Theory of Cryptography
• Tighter security proofs for GPV-IBE in the quantum random oracle model
• Fine-Grained Cryptography
• On building fine-grained one-way functions from strong average-case hardness
• Fine-grained non-interactive key-exchange without idealized assumptions
• Fine-grained non-interactive key exchange, revisited
• Key establishment à la Merkle in a quantum world
• The Complexity of Public-Key Cryptography
• On the impossibility of key agreements from quantum random oracles
• Distributed Merkle's puzzles
• Weak oblivious transfer from strong one-way functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445498)