Theory of Cryptography
From MaRDI portal
Publication:5711641
DOI10.1007/B106171zbMath1079.94565OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ5711641
David A. Wilson, Silvio Micali, Chris Peikert
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
Related Items (8)
Proofs of Work from worst-case assumptions ⋮ Error-Correcting Codes Against Chosen-Codeword Attacks ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Authenticated adversarial routing ⋮ On the complexity of compressing obfuscation ⋮ Adaptive Security with Quasi-Optimal Rate ⋮ Optimal Computational Split-state Non-malleable Codes ⋮ Public Key Locally Decodable Codes with Short Keys
This page was built for publication: Theory of Cryptography
