M. Ball, A. Rosen, M. Sabin, and P. Vasudevan, Proofs of useful work, 2017.

A. Becker, J. Coron, and A. Joux, Improved Generic Algorithms for Hard Knapsacks, Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.364-385, 2011.
DOI : 10.1007/978-3-642-20465-4_21
URL : https://hal.archives-ouvertes.fr/hal-00666059

M. Bellare and P. Rogaway, Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993.
DOI : 10.1145/168588.168596

J. D. Bruce, Purely P2P crypto-currency with finite mini- blockchain URL: https, 2013.

J. D. Bruce, The mini-blockchain scheme, 2014.

J. Matthijs, A. Coster, B. A. Joux, A. M. Lamacchia, C. Odlyzko et al., Improved low-density subset sum algorithms, Computational Complexity, vol.2, pp.111-128, 1992.

N. Howgrave-graham and A. Joux, New Generic Algorithms for Hard Knapsacks, Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.235-256, 2010.
DOI : 10.1007/978-3-642-13190-5_12
URL : http://www.di.ens.fr/~fouque/ens-rennes/joux-sac.pdf

M. Richard and . Karp, Reducibility among combinatorial problems, Complexity of computer computations, pp.85-103, 1972.

R. M. Karp, Computational Complexity of Combinatorial and Graph-Theoretic Problems, Theoretical Computer Science, pp.97-184, 2011.
DOI : 10.1007/978-3-642-11120-4_3

C. Jeffrey, A. M. Lagarias, and . Odlyzko, Solving low-density subset sum problems, Journal of the ACM (JACM), vol.32, issue.1, pp.229-246, 1985.

H. W. Arjen-klaas-lenstra, L. Lenstra, and . Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982.
DOI : 10.1007/BF01457454

S. Nakamoto, Bitcoin: A peer-to-peer electronic cash system, 2008.

Q. Phong, D. Nguyen, and . Stehlé, An LLL algorithm with quadratic complexity, SIAM J. Comput, vol.39, issue.3, pp.874-903, 2009.

Y. Pan and F. Zhang, Solving low-density multiple subset sum problems with SVP oracle, Journal of Systems Science and Complexity, vol.3788, issue.3, pp.228-242, 2016.
DOI : 10.1287/moor.12.3.415

D. Ron and A. Shamir, Quantitative Analysis of the Full Bitcoin Transaction Graph, International Conference on Financial Cryptography and Data Security, pp.6-24, 2013.
DOI : 10.1007/978-3-642-39884-1_2

C. Peter and S. , Block Korkin-Zolotarev bases and successive minima, International Computer Science Institute, 1992.

R. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010
URL : http://www.csee.wvu.edu/~xinl/library/papers/comp/Tarjan_siam1972.pdf