PURED: a unified framework for resource-hard functions

DOI10.1007/978-3-031-56235-8_7MaRDI QIDQ6623350zbMATH OpenFDO

Authors Alex Biryukov, Marius Lombard-Platet

Publication date 23 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-56235-8_7

zbMATH Keywords

memory hardnesspuzzle cryptographytrapdoor problemsVDFwhite-box cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
• Symmetrically and asymmetrically hard cryptography
• Moderately hard functions: definition, instantiations, and applications
• Static-memory-hard functions, and modeling the cost of space vs. time
• Bandwidth-Hard Functions: Reductions and Lower Bounds

Cites work

• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• Bandwidth hard functions for ASIC resistance
• Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
• Efficient verifiable delay functions
• Efficiently computing data-independent memory-hard functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• How to build time-lock encryption
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 3864496 (Why is no real title available?)
• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• scientific article; zbMATH DE number 1440055 (Why is no real title available?)
• Indistinguishable proofs of work or knowledge
• Multiparty generation of an RSA modulus
• On Signatures of Knowledge
• Proofs of space
• Proofs of storage: theory, constructions and applications
• Publicly verifiable proofs of sequential work
• Scrypt is maximally memory-hard
• Signing a Linear Subspace: Signature Schemes for Network Coding
• Simple proofs of sequential work
• Simple verifiable delay functions
• Sustained space complexity
• Symmetrically and asymmetrically hard cryptography
• The knowledge complexity of interactive proof-systems
• Towards practical whitebox cryptography: optimizing efficiency and space hardness
• Verifiable delay functions
• Verifiable delay functions from supersingular isogenies and pairings
• White-box security notions for symmetric encryption schemes
• Witness encryption and its applications

This page was built for publication: PURED: a unified framework for resource-hard functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623350)