Security Amplification for Interactive Cryptographic Primitives

DOI10.1007/978-3-642-00457-5_9zbMath1213.94098OpenAlexW1516703959MaRDI QIDQ3611763

Ragesh Jaiswal, Russell Impagliazzo, Valentine Kabanets, Yevgeniy Dodis

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)

Related Items (5)

Two is better than one: How to securely combine two assumptions ⋮ Direct product hardness amplification ⋮ Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols ⋮ Subversion-resilient public key encryption with practical watchdogs ⋮ A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch

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