Proofs of Space

Lecture Notes in Computer Science 1205

(1999) · Industrial Robot the international journal of robotics research and application · doi:10.1108/ir.1999.04926fae.001 · Cited by 39,228 · see citing works

Random oracles are practical

Bellare, M., & Rogaway, P. (1993) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/168588.168596 · Cited by 4,695 · see citing works

The Sybil Attack

Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · see citing works

Provable data possession at untrusted stores

Ateniese, G., Burns, R. C., Curtmola, R., Herring, J., Kissner, L., Peterson, Z. N. J., & Song, D. X. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315318 · Cited by 2,797 · see citing works

Pors

Juels, A., & Kaliski, B. S. (2007) · Proceedings of the ACM Conference on Computer and Communications Security · doi:10.1145/1315245.1315317 · Cited by 1,899 · see citing works

CAPTCHA: Using Hard AI Problems for Security

von Ahn, L., Blum, M., Hopper, N., & Langford, J. C. (2003) · Lecture notes in computer science · doi:10.1007/3-540-39200-9_18 · Cited by 1,450 · see citing works

Pricing via processing or combatting junk mail

Dwork, C., & Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_10 · Cited by 1,282 · see citing works

Hashcash - A Denial of Service Counter-Measure

Back, A. (2002) · Cited by 740 · see citing works

The random oracle methodology, revisited (preliminary version)

Canetti, R., Goldreich, O., & Halevi, S. (1998) · doi:10.1145/276698.276741 · Cited by 714 · see citing works

A cryptanalytic time-memory trade-off

Hellman, M. E. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056220 · Cited by 703 · see citing works

PayWord and MicroMint: Two simple micropayment schemes

Rivest, R. L., & Adi Shamir, Z. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62494-5_6 · Cited by 622 · see citing works

Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks.

Juels, A., & Brainard, J. (1999) · Network and Distributed System Security Symposium · Cited by 489 · see citing works

Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology

Maurer, U. M., Renner, R., & Holenstein, C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24638-1_2 · Cited by 474 · see citing works

Proofs of retrievability

Bowers, K. D., Juels, A., & Oprea, A. (2009) · doi:10.1145/1655008.1655015 · Cited by 452 · see citing works

Computationally sound proofs

Micali, S. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795284959 · Cited by 424 · see citing works

On the (In)security of the Fiat-Shamir paradigm

Goldwasser, S., & Kalai, Y. T. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238185 · Cited by 312 · see citing works

Proofs of Work and Bread Pudding Protocols

Jakobsson, M., & Juels, A. (1999) · Communications and Multimedia Security · Cited by 289 · see citing works

Proofs of Work and Bread Pudding Protocols(Extended Abstract)

Jakobsson, M., & Juels, A. (1999) · Springer eBooks · doi:10.1007/978-0-387-35568-9_18 · Cited by 288 · see citing works

Models of Computation: Exploring the Power of Computing

Savage, J. E. (1998) · Cited by 286 · see citing works

Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?

Simon, D. R. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054137 · Cited by 282 · see citing works

On Time Versus Space

Hopcroft, J., Paul, W., & Valiant, L. (1977) · Journal of the ACM · doi:10.1145/322003.322015 · Cited by 253 · see citing works

Universal Arguments and their Applications

Barak, B., & Goldreich, O. (2003) · Proceedings - IEEE Conference on Computational Complexity/Proceedings · doi:10.1109/ccc.2002.1004355 · Cited by 244 · see citing works

On Memory-Bound Functions for Fighting Spam

Dwork, C., Goldberg, A. V., & Naor, M. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_25 · Cited by 236 · see citing works

New client puzzle outsourcing techniques for DoS resistance

Waters, B. R., Juels, A., Halderman, J. A., & Felten, E. W. (2004) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1030083.1030117 · Cited by 185 · see citing works

Micropayments Revisited

Micali, S., & Rivest, R. L. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45760-7_11 · Cited by 148 · see citing works

LKHW: a directed diffusion-based secure multicast scheme for wireless sensor networks

Pietro, R. D., Mancini, L. V., Law, Y. W., Etalle, S., & Havinga, P. (2003) · International Conference on Parallel Processing Workshops (ICPPW) · doi:10.1109/icppw.2003.1240395 · Cited by 146 · see citing works

Formalizing Human Ignorance

Rogaway, P. (2006) · Lecture notes in computer science · doi:10.1007/11958239_14 · Cited by 129 · see citing works

Space bounds for a game on graphs

Paul, W. J., Tarjan, R. E., & Celoni, J. R. (1976) · Theory of Computing Systems · doi:10.1007/bf01683275 · Cited by 126 · see citing works

Secure Code Update for Embedded Devices via Proofs of Secure Erasure

Perito, D., & Tsudik, G. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15497-3_39 · Cited by 117 · see citing works

Cryptographic Primitives Enforcing Communication and Storage Complexity

Golle, P., Jarecki, S., & Mironov, I. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36504-4_9 · Cited by 105 · see citing works

Proofs of Space: When Space Is of the Essence

Ateniese, G., Bonacina, I., Faonio, A., et al. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10879-7_31 · Cited by 103 · see citing works

Asymptotically tight bounds on time-space trade-offs in a pebble game

Lengauer, T., & Tarjan, R. E. (1982) · Journal of the ACM · doi:10.1145/322344.322354 · Cited by 100 · see citing works

Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments

Haitner, I., Hoch, J. J., Reingold, O., & Segev, G. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.7 · Cited by 96 · see citing works

Pebbling and Proofs of Work

Dwork, C., Naor, M., & Wee, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_3 · Cited by 95 · see citing works

Moderately Hard, Memory-Bound Functions.

Abadi, M., Burrows, M. T., & Wobber, T. (2003) · Cited by 94 · see citing works

Can you beat treewidth?

Marx, D. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.27 · Cited by 90 · see citing works

High Parallel Complexity Graphs and Memory-Hard Functions

Alwen, J., & Serbinenko, V. (2015) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2746539.2746622 · Cited by 84 · see citing works

On sparse graphs with dense long paths

Erdös, P., Graham, R., & Szemerédi, E. (1975) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(75)90037-1 · Cited by 83 · see citing works

Auditable metering with lightweight security

Franklin, M. K., & Malkhi, D. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63594-7_75 · Cited by 81 · see citing works

One-Time Computable Self-erasing Functions

Dziembowski, S., Kazana, T., & Wichs, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19571-6_9 · Cited by 53 · see citing works

Spacemint: A Cryptocurrency Based on Proofs of Space.Preprint

Park, S., Pietrzak, K., Kwon, A., Alwen, J., Fuchsbauer, G., & Gaži, P. (2015) · IACR Cryptology ePrint Archive · Cited by 45 · see citing works

Mitigating Dictionary Attacks on Password-Protected Local Storage

Canetti, R., Halevi, S., & Steiner, M. (2006) · Lecture notes in computer science · doi:10.1007/11818175_10 · Cited by 41 · see citing works

Computing with a full memory

Buhrman, H., Cleve, R., Koucký, M., et al. (2014) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2591796.2591874 · Cited by 38 · see citing works

Key-Evolution Schemes Resilient to Space-Bounded Leakage

Dziembowski, S., Kazana, T., & Wichs, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_19 · Cited by 34 · see citing works

Alien vs. Quine

Graizer, V., & Naccache, D. (2007) · IEEE Security & Privacy · doi:10.1109/msp.2007.28 · Cited by 24 · see citing works

Efficient Proofs of Secure Erasure

Karvelas, N. P., & Kiayias, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10879-7_30 · Cited by 21 · see citing works

Proofs of Space.Preprint

Dziembowski, S., Faust, S., Kolmogorov, V., et al. (2013) · IACR Cryptology ePrint Archive · Cited by 11 · see citing works

A Review on the Use of Blockchain for the Internet of Things

Fernandez-Carames, T. M., & Fraga-Lamas, P. (2018) · IEEE Access · doi:10.1109/access.2018.2842685 · Cited by 1,078 · see citing works

Blockchain for Internet of Energy management: Review, solutions, and challenges

Miglani, A., Kumar, N., Chamola, V., & Zeadally, S. (2020) · Computer Communications · doi:10.1016/j.comcom.2020.01.014 · Cited by 346 · see citing works

A Review on the Application of Blockchain to the Next Generation of Cybersecure Industry 4.0 Smart Factories

Fernandez-Carames, T. M., & Fraga-Lamas, P. (2019) · IEEE Access · doi:10.1109/access.2019.2908780 · Cited by 321 · see citing works

A Review of Blockchain Architecture and Consensus Protocols: Use Cases, Challenges, and Solutions

Ismail, L., & Materwala, H. (2019) · Symmetry · doi:10.3390/sym11101198 · Cited by 278 · see citing works

MIStore: a Blockchain-Based Medical Insurance Storage System

Zhou, L., Wang, L., & Sun, Y. (2018) · Journal of Medical Systems · doi:10.1007/s10916-018-0996-4 · Cited by 217 · see citing works

Trading Real-World Assets on Blockchain: An Application of Trust-Free Transaction Systems in the Market for Lemons

Notheisen, B., Cholewa, J. B., & Shanmugam, A. P. (2017) · Business & Information Systems Engineering · doi:10.1007/s12599-017-0499-8 · Cited by 215 · see citing works

Challenges of Proof-of-Useful-Work (PoUW)Preprint

Hoffmann, F. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2209.03865 · Cited by 1 · see citing works

Challenges of Proof-of-Useful-Work (PoUW)

Hoffmann, F. Z. (2022) · doi:10.1109/igetblockchain56591.2022.10087185 · Cited by 8 · see citing works

Hashcash Tree, a Data Structure to Mitigate Denial-of-Service Attacks

Alviano, M. (2023) · Algorithms · doi:10.3390/a16100462 · Cited by 2 · see citing works

On Pseudo-Random Oracles

Rjaško, M. (2012) · Tatra Mountains Mathematical Publications · doi:10.2478/v10127-012-0045-5

Security Definitions for Hash Functions: Combining UCE and Indifferentiability

Jost, D., & Maurer, U. M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-98113-0_5 · Cited by 2 · see citing works