Advances in Cryptology - CRYPTO 2003

DOI10.1007/B11817zbMath1122.94415OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428134

No author found.

Publication date: 28 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11817

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Computer system organization (68M99) Authentication, digital signatures and secret sharing (94A62)

Related Items (15)

Proof of Space from Stacked Expanders ⋮ Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees ⋮ Parallelizable delegation from LWE ⋮ Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks ⋮ Efficient cache attacks on AES, and countermeasures ⋮ Cryptographic puzzles and DoS resilience, revisited ⋮ Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Efficiently Computing Data-Independent Memory-Hard Functions ⋮ Depth-Robust Graphs and Their Cumulative Memory Complexity ⋮ Scrypt Is Maximally Memory-Hard

This page was built for publication: Advances in Cryptology - CRYPTO 2003