Chernoff-type direct product theorems

DOI10.1007/s00145-008-9029-7zbMath1166.94315OpenAlexW2089800914MaRDI QIDQ1027975

Ragesh Jaiswal, Valentine Kabanets, Russell Impagliazzo

Publication date: 30 June 2009

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-008-9029-7

zbMATH Keywords

challenge-response protocolsdirect product theoremparallel repetition with threshold

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Direct product hardness amplification ⋮ Distinguishing Distributions Using Chernoff Information ⋮ Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification ⋮ Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification ⋮ Parallel Repetition Theorems for Interactive Arguments ⋮ Almost Optimal Bounds for Direct Product Threshold Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Yao’s XOR-Lemma
• Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification
• Key agreement from weak bit agreement
• Parallel Repetition of Computationally Sound Protocols Revisited
• Chernoff-Type Direct Product Theorems
• Theory of Cryptography