Theory of Cryptography
From MaRDI portal
(Redirected from Publication:5711652)
Theory of Cryptography (scientific article; zbMATH DE number 2236192)
Theory of Cryptography (scientific article; zbMATH DE number 2236192)
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
(32)- Chernoff-type direct product theorems
- Amplifying the security of functional encryption, unconditionally
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
- Two-round oblivious transfer from CDH or LPN
- Semi-quantum money
- Secure software leasing from standard assumptions
- Direct product hardness amplification
- Counterexamples to hardness amplification beyond negligible
- General hardness amplification of predicates and puzzles. (Extended abstract)
- Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
- An efficient parallel repetition theorem
- Parallel repetition theorems for interactive arguments
- Almost optimal bounds for direct product threshold theorem
- Improved cryptographic puzzle based on~modular exponentiation
- Parallel and Concurrent Security of the HB and HB + Protocols
- Refereed delegation of computation
- Parallel repetition of computationally sound protocols revisited
- Cryptography using \texttt{CAPTCHA} puzzles
- Distinguishing distributions using Chernoff information
- Hardness Amplification Proofs Require Majority
- Degradation and Amplification of Computational Hardness
- : Increasing the Security and Efficiency of
- Predictable arguments of knowledge
- Magic adversaries versus individual reduction: science wins either way
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
- Quantum advantage from one-way functions
- On witness encryption and laconic zero-knowledge arguments
- On the power of oblivious state preparation
- Good things come to those who wait. Dishonest-majority coin-flipping requires delay functions
- Adversarially robust learning could leverage computational hardness.
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)
