Theory of Cryptography

DOI10.1007/B106171zbMath1079.94538OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ5711652

Ran Canetti, Michael Steiner, Shai Halevi

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (24)

Improved Cryptographic Puzzle Based on Modular Exponentiation ⋮ Semi-quantum money ⋮ Refereed delegation of computation ⋮ 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 ⋮ Parallel repetition of computationally sound protocols revisited ⋮ Secure software leasing from standard assumptions ⋮ Direct product hardness amplification ⋮ Cryptography Using Captcha Puzzles ⋮ Predictable Arguments of Knowledge ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Distinguishing Distributions Using Chernoff Information ⋮ Parallel and Concurrent Security of the HB and HB +  Protocols ⋮ Degradation and Amplification of Computational Hardness ⋮ Parallel and concurrent security of the HB and \(HB^{+}\) protocols ⋮ : Increasing the Security and Efficiency of ⋮ Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols ⋮ Chernoff-type direct product theorems ⋮ An Efficient Parallel Repetition Theorem ⋮ Parallel Repetition Theorems for Interactive Arguments ⋮ Almost Optimal Bounds for Direct Product Threshold Theorem ⋮ 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

This page was built for publication: Theory of Cryptography