{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:11:29Z","timestamp":1743135089162,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562341"},{"type":"electronic","value":"9783031562358"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56235-8_7","type":"book-chapter","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:02:34Z","timestamp":1711634554000},"page":"126-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PURED: A Unified Framework for\u00a0Resource-Hard Functions"],"prefix":"10.1007","author":[{"given":"Alex","family":"Biryukov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marius","family":"Lombard-Platet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/1064340.1064341","volume":"5","author":"M Abadi","year":"2005","unstructured":"Abadi, M., Burrows, M., Manasse, M., Wobber, T.: Moderately hard, memory-bound functions. ACM Trans. Internet Technol. 5(2), 299\u2013327 (2005)","journal-title":"ACM Trans. Internet Technol."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Abliz, M., Znati, T.: A guided tour puzzle for denial of service prevention. In: 2009 Annual Computer Security Applications Conference, pp. 279\u2013288 (2009)","DOI":"10.1109\/ACSAC.2009.33"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Ali, I.M., Caprolu, M., Pietro, R.D.: Foundations, properties, and security applications of puzzles: a survey. ACM Comput. Surv. 53(4), 72:1\u201372:38 (2020)","DOI":"10.1145\/3396374"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-662-53008-5_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"J Alwen","year":"2016","unstructured":"Alwen, J., Blocki, J.: Efficiently computing data-independent memory-hard functions. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 241\u2013271. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_9"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-78375-8_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"J Alwen","year":"2018","unstructured":"Alwen, J., Blocki, J., Pietrzak, K.: Sustained space complexity. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 99\u2013130. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_4"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-56617-7_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J Alwen","year":"2017","unstructured":"Alwen, J., Chen, B., Pietrzak, K., Reyzin, L., Tessaro, S.: Scrypt is maximally memory-hard. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 33\u201362. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_2"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Alwen, J., et al.: On the memory-hardness of data-independent password-hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communications Security, ASIACCS 2018, pp. 51\u201365. Association for Computing Machinery, New York (2018)","DOI":"10.1145\/3196494.3196534"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Alwen, J., Serbinenko, V.: High parallel complexity graphs and memory-hard functions. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2015, pp. 595\u2013603. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2746539.2746622","DOI":"10.1145\/2746539.2746622"},{"key":"7_CR9","unstructured":"Ateniese, G., Chen, L., Francati, D., Papadopoulos, D., Tang, Q.: Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity (revisiting space-based security in the adaptive setting). Cryptology ePrint Archive, Paper 2021\/162 (2021). https:\/\/eprint.iacr.org\/2021\/162,"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Koutsougeras, C., Vitter, J.S. (eds.) Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, Louisiana, USA, 5\u20138 May 1991, pp. 21\u201331. ACM (1991). https:\/\/doi.org\/10.1145\/103418.103428","DOI":"10.1145\/103418.103428"},{"key":"7_CR11","unstructured":"Back, A.: Hashcash - a denial of service counter-measure (2002)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1007\/978-3-662-53890-6_30","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"F Baldimtsi","year":"2016","unstructured":"Baldimtsi, F., Kiayias, A., Zacharias, T., Zhang, B.: Indistinguishable proofs of work or knowledge. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 902\u2013933. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_30"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-45611-8_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"A Biryukov","year":"2014","unstructured":"Biryukov, A., Bouillaguet, C., Khovratovich, D.: Cryptographic schemes based on the ASASA structure:\u00a0black-box,\u00a0white-box, and\u00a0public-key (extended abstract). In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 63\u201384. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_4"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Biryukov, A., Dinu, D., Khovratovich, D.: Argon2: new generation of memory-hard functions for password hashing and other applications. In: 2016 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 292\u2013302 (2016). https:\/\/doi.org\/10.1109\/EuroSP.2016.31","DOI":"10.1109\/EuroSP.2016.31"},{"key":"7_CR15","unstructured":"Biryukov, A., Khovratovich, D.: Egalitarian computing (MTP 1.2). CoRR abs\/1606.03588 (2016). http:\/\/arxiv.org\/abs\/1606.03588"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Biryukov, A., Khovratovich, D.: Equihash: asymmetric proof-of-work based on the generalized birthday problem. Ledger 2, 1\u201330 (2017). https:\/\/doi.org\/10.5195\/ledger.2017.48. https:\/\/ledger.pitt.edu\/ojs\/ledger\/article\/view\/48","DOI":"10.5195\/ledger.2017.48"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-319-70700-6_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"A Biryukov","year":"2017","unstructured":"Biryukov, A., Perrin, L.: Symmetrically and asymmetrically hard cryptography. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 417\u2013445. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_15"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Blocki, J., Ren, L., Zhou, S.: Bandwidth-hard functions: reductions and lower bounds. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, pp. 1820\u20131836. Association for Computing Machinery, New York (2018)","DOI":"10.1145\/3243734.3243773"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-1-4757-0602-4_6","volume-title":"Advances in Cryptology","author":"L Blum","year":"1983","unstructured":"Blum, L., Blum, M., Shub, M.: Comparison of two pseudo-random number generators. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology, pp. 61\u201378. Springer, Boston (1983). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_6"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Bogdanov, A., Isobe, T.: White-box cryptography revisited: space-hard ciphers. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS 2015, pp. 1058\u20131069. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2810103.2813699","DOI":"10.1145\/2810103.2813699"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-662-53887-6_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"A Bogdanov","year":"2016","unstructured":"Bogdanov, A., Isobe, T., Tischhauser, E.: Towards practical whitebox cryptography: optimizing efficiency and space hardness. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 126\u2013158. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_5"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-53887-6_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Boneh","year":"2016","unstructured":"Boneh, D., Corrigan-Gibbs, H., Schechter, S.: Balloon hashing: a memory-hard function providing provable protection against sequential attacks. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 220\u2013248. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_8"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-00468-1_5","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"D Boneh","year":"2009","unstructured":"Boneh, D., Freeman, D., Katz, J., Waters, B.: Signing a linear subspace: signature schemes for network coding. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 68\u201387. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_5"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11818175_5","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Chase","year":"2006","unstructured":"Chase, M., Lysyanskaya, A.: On signatures of knowledge. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 78\u201396. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_5"},{"issue":"2","key":"7_CR26","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s00145-021-09395-y","volume":"35","author":"M Chen","year":"2022","unstructured":"Chen, M., et al.: Multiparty generation of an RSA modulus. J. Cryptol. 35(2), 12 (2022)","journal-title":"J. Cryptol."},{"key":"7_CR27","unstructured":"Coelho, F., Larroche, A., Colin, B.: Itsuku: a memory-hardened proof-of-work scheme. IACR Cryptology ePrint Archive, p. 1168 (2017). http:\/\/eprint.iacr.org\/2017\/1168"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-319-78375-8_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Cohen","year":"2018","unstructured":"Cohen, B., Pietrzak, K.: Simple proofs of sequential work. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 451\u2013467. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_15"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-34578-5_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"L De Feo","year":"2019","unstructured":"De Feo, L., Masson, S., Petit, C., Sanso, A.: Verifiable delay functions from supersingular isogenies and pairings. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 248\u2013277. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_10"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-662-43414-7_13","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"C Delerabl\u00e9e","year":"2014","unstructured":"Delerabl\u00e9e, C., Lepoint, T., Paillier, P., Rivain, M.: White-box security notions for symmetric encryption schemes. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 247\u2013264. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43414-7_13"},{"key":"7_CR31","unstructured":"Dobson, S., Galbraith, S.D.: Trustless groups of unknown order with hyperelliptic curves. IACR Cryptology ePrint Archive, p. 196 (2020). https:\/\/eprint.iacr.org\/2020\/196"},{"key":"7_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_10"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-662-48000-7_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Dziembowski","year":"2015","unstructured":"Dziembowski, S., Faust, S., Kolmogorov, V., Pietrzak, K.: Proofs of space. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 585\u2013605. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_29"},{"key":"7_CR34","unstructured":"Ethereum Community: ethash\u2014ethereum wiki. https:\/\/eth.wiki\/en\/concepts\/ethash\/ethash"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 467\u2013476. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2488608.2488667","DOI":"10.1145\/2488608.2488667"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 2085, pp. 291\u2013304. Association for Computing Machinery, New York (1985)","DOI":"10.1145\/22145.22178"},{"key":"7_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-40663-8_4","volume-title":"Algebraic Informatics","author":"S Kamara","year":"2013","unstructured":"Kamara, S.: Proofs of storage: theory, constructions and applications. In: Muntean, T., Poulakis, D., Rolland, R. (eds.) CAI 2013. LNCS, vol. 8080, pp. 7\u20138. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40663-8_4"},{"issue":"11","key":"7_CR38","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1007\/s10623-018-0461-x","volume":"86","author":"J Liu","year":"2018","unstructured":"Liu, J., Jager, T., Kakvi, S.A., Warinschi, B.: How to build time-lock encryption. Des. Codes Crypt. 86(11), 2549\u20132586 (2018). https:\/\/doi.org\/10.1007\/s10623-018-0461-x","journal-title":"Des. Codes Crypt."},{"key":"7_CR39","doi-asserted-by":"publisher","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.: Publicly verifiable proofs of sequential work. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS 2013, pp. 373\u2013388. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2422436.2422479","DOI":"10.1145\/2422436.2422479"},{"key":"7_CR40","unstructured":"Percival, C.: Stronger key derivation via sequential memory-hard functions (2009)"},{"key":"7_CR41","doi-asserted-by":"publisher","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: Blum, A. (ed.) 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, San Diego, California, USA, 10\u201312 January 2019. LIPIcs, vol. 124, pp. 60:1\u201360:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2019.60","DOI":"10.4230\/LIPIcs.ITCS.2019.60"},{"key":"7_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-46588-1_11","volume-title":"Public Key Cryptography","author":"G Poupard","year":"2000","unstructured":"Poupard, G., Stern, J.: Short proofs of knowledge for factoring. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 147\u2013166. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46588-1_11"},{"key":"7_CR43","unstructured":"Provos, N., Mazi\u00e8res, D.: A future-adaptive password scheme. In: Proceedings of the Annual Conference on USENIX Annual Technical Conference, ATEC 1999, p. 32. USENIX Association (1999)"},{"key":"7_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-319-70500-2_16","volume-title":"Theory of Cryptography","author":"L Ren","year":"2017","unstructured":"Ren, L., Devadas, S.: Bandwidth hard functions for ASIC resistance. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 466\u2013492. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_16"},{"key":"7_CR45","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical report, Massachusetts Institute of Technology, USA (1996)"},{"key":"7_CR46","unstructured":"Rivest, R.L.: Description of the LCS35 time capsule crypto-puzzle (1999). https:\/\/people.csail.mit.edu\/rivest\/lcs35-puzzle-description.txt"},{"key":"7_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"CP Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239\u2013252. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22"},{"key":"7_CR48","doi-asserted-by":"crossref","unstructured":"Thompson, C.D.: Area-time complexity for VLSI. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC 1979, pp. 81\u201388. Association for Computing Machinery, New York (1979)","DOI":"10.1145\/800135.804401"},{"key":"7_CR49","unstructured":"Vitto, G.: Factoring primes to factor moduli: backdooring and distributed generation of semiprimes. IACR Cryptology ePrint Archive, p. 1610 (2021). https:\/\/eprint.iacr.org\/2021\/1610"},{"key":"7_CR50","doi-asserted-by":"crossref","unstructured":"Walfish, M., Vutukuru, M., Balakrishnan, H., Karger, D., Shenker, S.: DDoS defense by offense. In: Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2006, pp. 303\u2013314. Association for Computing Machinery, New York (2006)","DOI":"10.1145\/1159913.1159948"},{"issue":"4","key":"7_CR51","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1007\/s00145-020-09364-x","volume":"33","author":"B Wesolowski","year":"2020","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. J. Cryptol. 33(4), 2113\u20132147 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09364-x","journal-title":"J. Cryptol."},{"issue":"1","key":"7_CR52","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1002\/1097-0142(1950)3:1<32::AID-CNCR2820030106>3.0.CO;2-3","volume":"3","author":"WJ Youden","year":"1950","unstructured":"Youden, W.J.: Index for rating diagnostic tests. Cancer 3(1), 32\u201335 (1950)","journal-title":"Cancer"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56235-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:04:27Z","timestamp":1711634667000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56235-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562341","9783031562358"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56235-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Goa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}