Theory of Cryptography
From MaRDI portal
Publication:5711652
DOI10.1007/B106171zbMATH Open1079.94538OpenAlexW4251449056MaRDI QIDQ5711652FDOQ5711652
Authors: Ran Canetti, Shai Halevi, Michael Steiner 
Publication date: 7 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106171
Recommendations
- General hardness amplification of predicates and puzzles. (Extended abstract)
- Almost optimal bounds for direct product threshold theorem
- Parallel repetition theorems for interactive arguments
- Counterexamples to hardness amplification beyond negligible
- Parallel Repetition of Computationally Sound Protocols Revisited
Cited In (28)
- Semi-quantum money
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
- Degradation and Amplification of Computational Hardness
- Parallel repetition of computationally sound protocols revisited
- : Increasing the Security and Efficiency of
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
- Counterexamples to hardness amplification beyond negligible
- General hardness amplification of predicates and puzzles. (Extended abstract)
- Hardness Amplification Proofs Require Majority
- Cryptography using \texttt{CAPTCHA} puzzles
- An efficient parallel repetition theorem
- Parallel repetition theorems for interactive arguments
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Chernoff-type direct product theorems
- Predictable arguments of knowledge
- Magic adversaries versus individual reduction: science wins either way
- Distinguishing distributions using Chernoff information
- Two-round oblivious transfer from CDH or LPN
- Almost optimal bounds for direct product threshold theorem
- Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
- Amplifying the security of functional encryption, unconditionally
- Improved cryptographic puzzle based on~modular exponentiation
- Secure software leasing from standard assumptions
- Quantum advantage from one-way functions
- Direct product hardness amplification
- Refereed delegation of computation
- Parallel and Concurrent Security of the HB and HB + Protocols
This page was built for publication: Theory of Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711652)
