Theory of Cryptography

DOI10.1007/B106171MaRDI QIDQ5711641zbMATH OpenOpenAlexFDO

Authors Silvio Micali, Chris Peikert, David A. Wilson, Madhu Sudan

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)

Recommendations

• Optimal rate code constructions for computationally simple channels
• Transparent error correcting in a computationally bounded world
• Error-correcting codes against chosen-codeword attacks
• What can cryptography do for coding theory? (Abstract)
• scientific article; zbMATH DE number 4047591

Cited in

(17)

• Proofs of Work from worst-case assumptions
• Transparent error correcting in a computationally bounded world
• Adaptive security with quasi-optimal rate
• Optimal computational split-state non-malleable codes
• Error-correcting codes against chosen-codeword attacks
• Public key locally decodable codes with short keys
• Optimal rate code constructions for computationally simple channels
• Improvements of Winograd's result on computation in the presence of noise (Corresp.)
• Resource Bounded Frequency Computations with Three Errors
• Highly Robust Error Correction byConvex Programming
• scientific article; zbMATH DE number 4047591 (Why is no real title available?)
• scientific article; zbMATH DE number 1962791 (Why is no real title available?)
• Authenticated adversarial routing
• What can cryptography do for coding theory? (Abstract)
• Optimum error detection codes for noiseless decision feedback
• On the complexity of compressing obfuscation
• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes

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 Q5711641)