On the public citation graph
Pebbling and Proofs of Work
0 signed · 96 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-48071-4openalex-snapshot
Advances in Cryptology — CRYPTO’ 92
inferredcites →https://doi.org/10.1007/3-540-48071-4_10openalex-snapshot
Pricing via Processing or Combatting Junk Mail
inferredcites →https://doi.org/10.1007/978-3-540-45146-4_25openalex-snapshot
On Memory-Bound Functions for Fighting Spam
inferredcites →https://doi.org/10.1007/b11817openalex-snapshot
Advances in cryptology - CRYPTO 2003 : 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003 : proceedings
inferredcites →https://doi.org/10.1016/0012-365x(88)90189-6openalex-snapshot
Explicit construction of linear sized tolerant networks
inferredcites →https://doi.org/10.1016/0022-0000(80)90056-2openalex-snapshot
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
inferredcites →https://doi.org/10.1016/s0022-0000(74)80046-2openalex-snapshot
An observation on time-storage trade off
inferredcites →https://doi.org/10.1080/15427951.2004.10129083openalex-snapshot
Smaller Explicit Superconcentrators
inferredcites →https://doi.org/10.1109/sfcs.2000.892078openalex-snapshot
Super-linear time-space tradeoff lower bounds for randomized computation
inferredcites →https://doi.org/10.1109/sffcs.1999.814578openalex-snapshot
A non-linear time lower bound for Boolean branching programs
inferredcites →https://doi.org/10.1137/0211022openalex-snapshot
A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
inferredcites →https://doi.org/10.1145/1064340.1064341openalex-snapshot
Moderately hard, memory-bound functions
inferredcites →https://doi.org/10.1145/135419.135437openalex-snapshot
Tolerating linear number of faults in networks of bounded degree
inferredcites →https://doi.org/10.1145/301250.301424openalex-snapshot
Determinism versus non-determinism for linear time RAMs (extended abstract)
inferredcites →https://doi.org/10.1145/322344.322354openalex-snapshot
Asymptotically tight bounds on time-space trade-offs in a pebble game
inferredcites →https://doi.org/10.1145/800061.808731openalex-snapshot
Superconcentrators, generalizers and generalized connectors with limited depth
inferredcites →https://doi.org/10.1145/800113.803643openalex-snapshot
Space bounds for a game on graphs
inferredcites →https://doi.org/10.1145/800116.803752openalex-snapshot
On non-linear lower bounds in computational complexity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-17656-3_12openalex-snapshot
Tight Proofs of Space and Replication
inferred← citeshttps://doi.org/10.1007/978-3-030-26951-7_19openalex-snapshot
Memory-Hard Functions from Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/978-3-030-37228-6_2openalex-snapshot
Towards a Multi-chain Future of Proof-of-Space
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_15openalex-snapshot
Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_25openalex-snapshot
SPARKs: Succinct Parallelizable Arguments of Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_20openalex-snapshot
New Techniques in Replica Encodings with Client Setup
inferred← citeshttps://doi.org/10.1007/978-3-030-90453-1_19openalex-snapshot
The Cost of Adaptivity in Security Games on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_22openalex-snapshot
Parallelizable Delegation from LWE
inferred← citeshttps://doi.org/10.1007/978-3-031-31371-4_3openalex-snapshot
Verifiable Capacity-Bound Functions: A New Primitive from Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-68379-4_1openalex-snapshot
Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-031-68388-6_14openalex-snapshot
On Sequential Functions and Fine-Grained Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-91832-2_7openalex-snapshot
On Graphs of Incremental Proofs of Sequential Work
inferred← citeshttps://doi.org/10.1007/978-3-319-10879-7_31openalex-snapshot
Proofs of Space: When Space Is of the Essence
inferred← citeshttps://doi.org/10.1007/978-3-319-38898-4_22openalex-snapshot
Slow Motion Zero Knowledge Identifying with Colliding Commitments
inferred← citeshttps://doi.org/10.1007/978-3-319-56617-7_1openalex-snapshot
Depth-Robust Graphs and Their Cumulative Memory Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-56617-7_2openalex-snapshot
Scrypt Is Maximally Memory-Hard
inferred← citeshttps://doi.org/10.1007/978-3-319-63715-0_4openalex-snapshot
Non-Malleable Codes for Space-Bounded Tampering
inferred← citeshttps://doi.org/10.1007/978-3-319-70500-2_16openalex-snapshot
Bandwidth Hard Functions for ASIC Resistance
inferred← citeshttps://doi.org/10.1007/978-3-319-70500-2_17openalex-snapshot
Moderately Hard Functions: Definition, Instantiations, and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-19074-2_19openalex-snapshot
Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_9openalex-snapshot
One-Time Computable Self-erasing Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_19openalex-snapshot
Key-Evolution Schemes Resilient to Space-Bounded Leakage
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_3openalex-snapshot
Time-Lock Puzzles in the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_21openalex-snapshot
To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_19openalex-snapshot
PoW-Based Distributed Cryptography with No Trusted Setup
inferred← citeshttps://doi.org/10.1007/978-3-662-48800-3_26openalex-snapshot
Tradeoff Cryptanalysis of Memory-Hard Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_13openalex-snapshot
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_9openalex-snapshot
Efficiently Computing Data-Independent Memory-Hard Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_11openalex-snapshot
Proof of Space from Stacked Expanders
inferred← citeshttps://doi.org/10.1007/978-3-662-53887-6_8openalex-snapshot
Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
inferred← citeshttps://doi.org/10.1007/978-3-662-58387-6_18openalex-snapshot
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling
inferred← citeshttps://doi.org/10.1007/978-81-322-0277-6openalex-snapshot
An Investigation into the Detection and Mitigation of Denial of Service (DoS) Attacks
inferred← citeshttps://doi.org/10.1007/978-81-322-0277-6_6openalex-snapshot
Cryptographic Approaches to Denial-of-Service Resistance
inferred← citeshttps://doi.org/10.1007/s00037-020-00201-yopenalex-snapshot
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
inferred← citeshttps://doi.org/10.1007/s10623-018-0461-xopenalex-snapshot
How to build time-lock encryption
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.12.011openalex-snapshot
Resisting newborn attacks via shared Proof-of-Space
inferred← citeshttps://doi.org/10.1109/access.2024.3521428openalex-snapshot
Blockchain-Based Reputation and Trust Management for Smart Grids, Healthcare, and Transportation: A Review
inferred← citeshttps://doi.org/10.1109/focs.2015.36openalex-snapshot
Hardness of Approximation in PSPACE and Separation Results for Pebble Games
inferred← citeshttps://doi.org/10.1109/gamenets.2009.5137390openalex-snapshot
Systems-compatible incentives
inferred← citeshttps://doi.org/10.1109/icycs.2008.114openalex-snapshot
A Number Theoretic Memory Bounded Function and Its Applications
inferred← citeshttps://doi.org/10.1109/infocom.2018.8486394openalex-snapshot
Randomized View Reconciliation in Permissionless Distributed Systems
inferred← citeshttps://doi.org/10.1109/iotsms48152.2019.8939242openalex-snapshot
Predictive Proof of Metrics – a New Blockchain Consensus Protocol
inferred← citeshttps://doi.org/10.1109/jproc.2024.3386257openalex-snapshot
Drawing the Boundaries Between Blockchain and Blockchain-Like Systems: A Comprehensive Survey on Distributed Ledger Technologies
inferred← citeshttps://doi.org/10.1109/sies.2018.8442076openalex-snapshot
On the Consensus Mechanisms of Blockchain/DLT for Internet of Things
inferred← citeshttps://doi.org/10.1109/tc.2016.2516011openalex-snapshot
Lyra2: Efficient Password Hashing with High Security against Time-Memory Trade-Offs
inferred← citeshttps://doi.org/10.1109/tnet.2020.3004834openalex-snapshot
Randomized View Reconciliation in Permissionless Distributed Systems
inferred← citeshttps://doi.org/10.1109/tsc.2025.3547222openalex-snapshot
BlockEmulator: An Emulator Enabling to Test Blockchain Sharding Protocols
inferred← citeshttps://doi.org/10.1145/2422436.2422479openalex-snapshot
Publicly verifiable proofs of sequential work
inferred← citeshttps://doi.org/10.1145/2508859.2516650openalex-snapshot
A security framework for the analysis and design of software attestation
inferred← citeshttps://doi.org/10.1145/2746539.2746622openalex-snapshot
High Parallel Complexity Graphs and Memory-Hard Functions
inferred← citeshttps://doi.org/10.1145/2817206openalex-snapshot
Revocable Quantum Timed-Release Encryption
inferred← citeshttps://doi.org/10.1145/3396374openalex-snapshot
Foundations, Properties, and Security Applications of Puzzles
inferred← citeshttps://doi.org/10.1145/3487405.3487406openalex-snapshot
Non-Interactive VDF Client Puzzle for DoS Mitigation
inferred← citeshttps://doi.org/10.1145/3549523openalex-snapshot
SPARKs: Succinct Parallelizable Arguments of Knowledge
inferred← citeshttps://doi.org/10.1145/3708821.3736191openalex-snapshot
Infiltrated Selfish Mining: Think Win-Win to Escape Dilemmas
inferred← citeshttps://doi.org/10.11606/d.3.2016.tde-29062016-085500openalex-snapshot
Lyra: uma função de derivação de chaves com custos de memória e processamento configuráveis.
inferred← citeshttps://doi.org/10.11606/t.3.2016.tde-26082016-150620openalex-snapshot
Lyra2: password hashing scheme with improved security against time-memory trade-offs.
inferred← citeshttps://doi.org/10.14722/ndss.2016.23108openalex-snapshot
Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem
inferred← citeshttps://doi.org/10.14722/ndss.2019.23337openalex-snapshot
Constructing an Adversary Solver for Equihash
inferred← citeshttps://doi.org/10.17762/ijcnis.v13i2.4975openalex-snapshot
A New Data Deletion Scheme for a Blockchain-based De-duplication System in the Cloud
inferred← citeshttps://doi.org/10.22331/q-2025-02-18-1636openalex-snapshot
Tight Bounds on the Spooky Pebble Game: Recycling Qubits with Measurements
inferred← citeshttps://doi.org/10.3233/jcs-16868openalex-snapshot
Remote data integrity checking with server-side repair1
inferred← citeshttps://doi.org/10.3390/math8081343openalex-snapshot
ASIC-Resistant Proof of Work Based on Power Analysis of Low-End Microcontrollers
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.13openalex-snapshot
Approximating Cumulative Pebbling Cost Is Unique Games Hard
inferred← citeshttps://doi.org/10.48550/arxiv.1405.7828openalex-snapshot
Superconcentrators of Density 25.3
inferred← citeshttps://doi.org/10.5195/ledger.2017.48openalex-snapshot
Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem
inferred← citeshttps://doi.org/10.70675/990b2e4ez19fcz4589z9730z1849d78815d4openalex-snapshot
Advances in public-key cryptology and computer exploitation
inferred← citeshttps://doi.org/10.70675/eddd8ffazdcb3z4837z8bf7z30902ba105e6openalex-snapshot
Integrity, authentication and confidentiality in public-key cryptography
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.