Security Amplification for Interactive Cryptographic Primitives

DOI10.1007/978-3-642-00457-5_9MaRDI QIDQ3611763zbMATH OpenOpenAlexFDO

Authors Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets

Publication date 3 March 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-00457-5_9

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Security amplification for the cascade of arbitrarily weak PRPs. Tight bounds via the interactive hardcore lemma
• Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
• General hardness amplification of predicates and puzzles. (Extended abstract)
• Direct product hardness amplification
• Counterexamples to hardness amplification beyond negligible

Cited in

(20)

• Query-complexity amplification for random oracles
• Bit-security preserving hardness amplification
• Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
• Free-start distinguishing: combining two types of indistinguishability amplification
• Counterexamples to hardness amplification beyond negligible
• General hardness amplification of predicates and puzzles. (Extended abstract)
• A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
• Subversion-resilient public key encryption with practical watchdogs
• Security amplification for the cascade of arbitrarily weak PRPs. Tight bounds via the interactive hardcore lemma
• MicroCrypt assumptions with quantum input sampling and pseudodeterminism: constructions and separations
• A direct PRF construction from Kolmogorov complexity
• Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
• Amplifying the security of functional encryption, unconditionally
• Efficient string-commitment from weak bit-commitment
• Direct product hardness amplification
• Amplification of Chosen-Ciphertext Security
• Pseudorandom strings from pseudorandom quantum states
• Lossy functions do not amplify well
• Two is better than one: How to securely combine two assumptions
• scientific article; zbMATH DE number 1302861 (Why is no real title available?)

This page was built for publication: Security Amplification for Interactive Cryptographic Primitives

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