Document Open Access Logo

Implementation Study of Two Verifiable Delay Functions

Authors Vidal Attias , Luigi Vigneri, Vassil Dimitrov

PDF
Thumbnail PDF

File

OASIcs.Tokenomics.2020.9.pdf
  • Filesize: 0.54 MB
  • 14 pages

Document Identifiers

Author Details

Vidal Attias
  • IOTA Foundation, Berlin, Germany
Luigi Vigneri
  • IOTA Foundation, Berlin, Germany
Vassil Dimitrov
  • IOTA Foundation, Berlin, Germany

Cite AsGet BibTex

Vidal Attias, Luigi Vigneri, and Vassil Dimitrov. Implementation Study of Two Verifiable Delay Functions. In 2nd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2020). Open Access Series in Informatics (OASIcs), Volume 82, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/OASIcs.Tokenomics.2020.9

Abstract

Proof of Work is a prevalent mechanism to prove investment of time in blockchain projects. However, the use of massive parallelism and specialized hardware gives an unfair advantage to a small portion of nodes and raises environmental and economical concerns. In this paper, we provide an implementation study of two Verifiable Delay Functions, a new cryptographic primitive achieving Proof of Work goals in an unparallelizable way. We provide simulation results and an optimization based on a multiexponentiation algorithm.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Simulation evaluation
Keywords
  • Blockchain
  • Distributed Ledger
  • Verifiable Delay Function
  • Cryptography
  • Simulation
  • RSA

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Joy Algesheimer, Jan Camenisch, and Victor Shoup. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 2442, pages 417-432, 2002. URL: https://eprint.iacr.org/2002/029.pdf.
  2. Adam Back. Hashcash - A Denial of Service Counter-Measure. Technical Report August, Hashcash, 2002. Google Scholar
  3. Juan Benet, David Dalrymple, and Nicola Greco. Proof of Replication. Technical report, Stanford University, 2017. URL: https://doi.org/10.1007/s00221-007-1153-3.
  4. Nir Bitansky, Shafi Goldwasser, Abhishek Jain, Omer Paneth, and Vinod Vaikuntanathan. Time-lock puzzles from randomized encodings. In ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, pages 345-356, 2016. URL: https://doi.org/10.1145/2840728.2840745.
  5. Bitcoin Wiki. Mining hardware comparison - Bitcoin Wiki. URL: https://en.bitcoin.it/wiki/Mining_hardware_comparison.
  6. Simon R. Blackburn, Mike Burmester, StevenD. Galbraith, and Simon Blake-Wilson. Weaknesses in Shared RSA Key Generation Protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 1746, pages 300-306. Springer, Berlin, Heidelberg, December 1999. URL: http://link.springer.com/10.1007/3-540-46665-7_34.
  7. Dan Boneh, Joseph Bonneau, Benedikt Bünz, and Ben Fisch. Verifiable delay functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 10991 LNCS, pages 757-788, 2018. URL: https://eprint.iacr.org/2018/601.pdf.
  8. Dan Boneh and Matthew Franklin. Efficient generation of shared RSA Keys. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1294(4):425-439, July 1997. URL: https://doi.org/10.1007/BFb0052253.
  9. Clifford Cocks. Split knowledge generation of RSA parameters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 1355, pages 89-95, 1997. URL: https://doi.org/10.1007/bfb0024452.
  10. Cybernetica. Cryptographic Algorithms Lifecycle Report 2016. Technical report, Cybernetica, 2016. URL: https://www.ria.ee/sites/default/files/content-editors/publikatsioonid/cryptographic_algorithms_lifecycle_report_2016.pdf.
  11. Ivan Damgård and Gert Læssøe Mikkelsen. Efficient, robust and constant-round distributed RSA key generation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5978 LNCS:183-200, 2010. Google Scholar
  12. Luca De Feo, Simon Masson, Christophe Petit, and Antonio Sanso. Verifiable delay functions from supersingular isogenies and pairings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 11921 LNCS, pages 248-277, 2019. URL: https://defeo.lu/.
  13. Vassil S. Dimitrov, Graham A. Jullien, and William C. Miller. Complexity and fast algorithms for multiexponentiations. IEEE Transactions on Computers, 49(2):141-147, 2000. URL: https://doi.org/10.1109/12.833110.
  14. Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Pietrzak. Proofs of space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 9216, pages 585-605, 2015. URL: https://eprint.iacr.org/2013/796.pdf.
  15. Ben Fisch, Joseph Bonneau, Nicola Greco, and Juan Benet. Scaling Proof-of-Replication for Filecoin Mining. Technical report, Stanford University, 2018. URL: https://web.stanford.edu/~bfisch/porep_short.pdf.
  16. Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, and Benny Pinkas. Fast distributed rsa key generation for semi-honest and malicious adversaries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 10992 LNCS, pages 331-361. Springer Verlag, 2018. Google Scholar
  17. C. K. Koc. High-speed RSA implementation. Technical report, RSA Laboratories, 1994. URL: ftp://ftp.rsasecurity.com/pub/pdfs/tr201.pdf.
  18. Arjen K. Lenstra and Benjamin Wesolowski. Trustworthy public randomness with sloth, unicorn, and trx. International Journal of Applied Cryptography, 3(4):330-343, January 2017. URL: https://doi.org/10.1504/IJACT.2017.089354.
  19. NIST. Recommendation for Key Management - Part 1: General. NIST Special Publication 800-57, Revision 3(July):1-147, January 2012. URL: https://doi.org/10.6028/NIST.SP.800-57pt1r4.
  20. K. Z. Pekmestzi. Complex number multipliers. IEE Proceedings E: Computers and Digital Techniques, 136(1):70-75, 1989. URL: https://doi.org/10.1049/ip-e.1989.0010.
  21. Krzysztof Pietrzak. Simple verifiable delay functions. In Leibniz International Proceedings in Informatics, LIPIcs, volume 124, 2019. URL: https://doi.org/10.4230/LIPIcs.ITCS.2019.60.
  22. Serguei Popov. The Tangle. Technical report, IOTA Foundation, 2018. URL: https://assets.ctfassets.net/r1dr6vzfxhev/2t4uxvsIqk0EUau6g2sw0g/45eae33637ca92f85dd9f4a3a218e1ec/iota1_4_3.pdf.
  23. Michael O. Rabin. Probabilistic algorithm for testing primality. Journal of Number Theory, 12(1):128-138, 1980. URL: https://doi.org/10.1016/0022-314X(80)90084-0.
  24. R. L. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, 21(2):120-126, 1978. URL: https://doi.org/10.1145/359340.359342.
  25. Victor Shoup. NTL - A Library for doing Number Theory, 2019. URL: https://www.shoup.net/ntl/.
  26. Benjamin Wesolowski. Efficient verifiable delay functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 11478 LNCS, pages 379-407, 2019. URL: https://eprint.iacr.org/2018/623.pdf.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact