{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:18Z","timestamp":1740122478526,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T00:00:00Z","timestamp":1682726400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T00:00:00Z","timestamp":1682726400000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10623-023-01229-1","type":"journal-article","created":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T08:02:18Z","timestamp":1682755338000},"page":"2723-2735","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A bivariate polynomial-based cryptographic hard problem and its applications"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9992-4961","authenticated-orcid":false,"given":"Bagher","family":"Bagherpour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,29]]},"reference":[{"key":"1229_CR1","doi-asserted-by":"crossref","unstructured":"Abdolmaleki B., Baghery K., Lipmaa H., Siim J., Zajac M.: DL- Extractable UC-Commitment Schemes, Applied Cryptography and Network Security, 17th International Conference, Bogota, Colombia (2019).","DOI":"10.1007\/978-3-030-21568-2_19"},{"key":"1229_CR2","doi-asserted-by":"crossref","unstructured":"Alkim E., Barreto P.S.L.M., Bindel N., Longa P., Ricardini J.E.: The Lattice-Based Digital Signature Scheme qTESLA, Applied Cryptography and Network Security: 18th International Conference, ACNS 2020, Italy, Rome (2020).","DOI":"10.1007\/978-3-030-57808-4_22"},{"key":"1229_CR3","doi-asserted-by":"publisher","first-page":"103295","DOI":"10.1016\/j.jisa.2022.103295","volume":"69","author":"B Bagherpour","year":"2022","unstructured":"Bagherpour B.: An efficient verifiable secret redistribution scheme. J. Inf. Secur. Appl. 69, 103295 (2022). https:\/\/doi.org\/10.1016\/j.jisa.2022.103295.","journal-title":"J. Inf. Secur. Appl."},{"key":"1229_CR4","doi-asserted-by":"crossref","unstructured":"Blazy O., Chevalier C., Pointcheval D., Vergnaud D.: Analysis and Improvement of Lindell\u2019s UC-Secure Commitment Schemes, Proceedings of the 11th International Conference on Applied Cryptography and Network Security, June 2013, pp. 534\u2013551 (2013).","DOI":"10.1007\/978-3-642-38980-1_34"},{"key":"1229_CR5","doi-asserted-by":"crossref","unstructured":"Bresson E., Catalano D., Pointcheval D.: A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications, ASIACRYPT, LNCS 2894, pp. 37\u201354 (2003).","DOI":"10.1007\/978-3-540-40061-5_3"},{"key":"1229_CR6","unstructured":"Byali, M., Patra A., Ravi D., Sarkar P.: Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security, eprint.iacr (2017)."},{"key":"1229_CR7","doi-asserted-by":"crossref","unstructured":"Campanelli M., Fiore D., Querol A.: LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs, Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (2019).","DOI":"10.1145\/3319535.3339820"},{"key":"1229_CR8","doi-asserted-by":"publisher","unstructured":"Coppersmith D.: Finding a small root of a bivariate integer equation; factoring with high bits known. In: Maurer, U. (eds) Advances in Cryptology\u2014EUROCRYPT\u201996. EUROCRYPT. Lecture Notes in Computer Science, Vol 1070. Springer, Berlin (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_16.","DOI":"10.1007\/3-540-68339-9_16"},{"key":"1229_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10, 233\u2013260 (1997). https:\/\/doi.org\/10.1007\/s001459900030.","journal-title":"J. Cryptol."},{"key":"1229_CR10","doi-asserted-by":"crossref","unstructured":"Crescenzo G.D., Katz J., Ostrovsky R., Smith A.: Efficient and Non-interactive Non-malleable Commitment, EUROCRYPT 2001, LNCS 2045, pp. 40\u201359 (2001).","DOI":"10.1007\/3-540-44987-6_4"},{"key":"1229_CR11","doi-asserted-by":"crossref","unstructured":"Damgard I.: Commitment Schemes and Zero-Knowledge Protocols, Lectures on Data Security, LNCS 1561, pp. 63\u201386 (1999).","DOI":"10.1007\/3-540-48969-X_3"},{"key":"1229_CR12","doi-asserted-by":"crossref","unstructured":"Fischlin M., Fischlin R.: Efficient non-malleable commitment schemes, CRYPTO 2000, LNCS 2000, pp. 413\u2013431 (1880).","DOI":"10.1007\/3-540-44598-6_26"},{"key":"1229_CR13","doi-asserted-by":"crossref","unstructured":"Gentry C., Peikert C., Vaikuntanathan V.: Trapdoors for Hard Lattices and New Cryptographic Constructions, Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (2008).","DOI":"10.1145\/1374376.1374407"},{"key":"1229_CR14","doi-asserted-by":"crossref","unstructured":"Goyal V., Lee C.K., Ostrovsky R., Visconti I.: Constructing Non-malleable Commitments: A Black-Box Approach, IEEE 53rd Annual Symposium on Foundations of Computer Science, New Brunswick, NJ, USA (2012).","DOI":"10.1109\/FOCS.2012.47"},{"key":"1229_CR15","doi-asserted-by":"crossref","unstructured":"Hamouda F.B., Blazy O., Chevalier C., Pointcheval D., Vergnaud D.: Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages, International Workshop on Public Key Cryptography, PKC 2013, pp. 272\u2013291 (2013).","DOI":"10.1007\/978-3-642-36362-7_18"},{"key":"1229_CR16","unstructured":"Hardwick F.S., Gioulis A., Akram R.N., Markantonakis K.: E-Voting with Block Chain: An E-Voting Protocol with Decentralisation and Voter Privacy, 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) (2018)."},{"key":"1229_CR17","first-page":"131","volume-title":"Cryptography and Coding 1997. Lecture Notes in Computer Science","author":"N Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham N.: Finding small roots of univariate modular equations revisited. In: Darnell M. (ed.) Cryptography and Coding 1997. Lecture Notes in Computer Science, vol. 1355, pp. 131\u2013142. Springer, Berlin (1997)."},{"key":"1229_CR18","doi-asserted-by":"crossref","unstructured":"Jhanwar M.P., Venkateswarlu A., Safavi-Naini R.: Paillier-Based Publicly Verifiable (Non-interactive) Secret Sharing, Designs codes and Cryptography. 18. March (2014).","DOI":"10.1007\/s10623-014-9952-6"},{"key":"1229_CR19","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W., Lovasz L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454.","journal-title":"Math. Ann."},{"key":"1229_CR20","doi-asserted-by":"crossref","unstructured":"Lindell Y.: Highly-efficient universally-composable commitments based on the DDH assumption. In: Proceedings of the 30th Annual International Conference on Theory and Applications of Cryptographic Techniques: Advances in Cryptology, pp. 446\u2013466 (2011)","DOI":"10.1007\/978-3-642-20465-4_25"},{"key":"1229_CR21","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1007\/s10623-022-01082-8","volume":"90","author":"S Mashahdi","year":"2022","unstructured":"Mashahdi S., Bagherpour B., Zaghian A.: A non-interactive $$(t, n)$$-publicly verifiable multi-secret sharing scheme. Des. Codes Cryptogr. 90, 1761\u20131782 (2022). https:\/\/doi.org\/10.1007\/s10623-022-01082-8.","journal-title":"Des. Codes Cryptogr."},{"key":"1229_CR22","doi-asserted-by":"crossref","unstructured":"Micali S.: Fair public-key cryptosystems. In: Advances in Cryptology-CRYPTO\u201992, Lecture Notes in Computer Science, pp. 113\u2013138. Springer, Berlin (1992).","DOI":"10.1007\/3-540-48071-4_9"},{"key":"1229_CR23","volume-title":"Post-quantum Cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio D., Regev O.: Lattice-based cryptography. In: Bernstein D.J., Buchmann J., Dahmen E. (eds.) Post-quantum Cryptography. Springer, Berlin (2009)."},{"key":"1229_CR24","doi-asserted-by":"crossref","unstructured":"Paillier P.: Public key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT\u201999, p. 223\u2013238 (1990).","DOI":"10.1007\/3-540-48910-X_16"},{"key":"1229_CR25","doi-asserted-by":"crossref","unstructured":"Pedersen T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Advances in Cryptology-CRYPTO\u201991, pp. 129\u2013140 (1992).","DOI":"10.1007\/3-540-46766-1_9"},{"key":"1229_CR26","volume-title":"Lecture Notes Cryptographic Protocols","author":"B Schoenmakers","year":"2022","unstructured":"Schoenmakers B.: Lecture Notes Cryptographic Protocols. Department of Mathematics and Computer Science, Technical University of Eindhoven, Eindhoven (2022)."},{"key":"1229_CR27","volume-title":"Cryptography Theory and Practice","author":"DR Stinson","year":"2019","unstructured":"Stinson D.R., Paterson M.R.: Cryptography Theory and Practice, 4th edn CRC Press, Boca Raton (2019).","edition":"4"},{"key":"1229_CR28","first-page":"79","volume":"12","author":"A Zaghian","year":"2020","unstructured":"Zaghian A., Bagherpour B.: A fast publicly verifiable secret sharing scheme using homogeneous linear recursion. Isecure 12, 79\u201387 (2020).","journal-title":"Isecure"},{"key":"1229_CR29","doi-asserted-by":"publisher","first-page":"1540","DOI":"10.3390\/s21041540","volume":"21","author":"J Zhou","year":"2021","unstructured":"Zhou J., Feng Y., Wang Z., Guo D.: Using secure multi-party computation to protect privacy on a permissioned block-chain. Sensors 21, 1540 (2021).","journal-title":"Sensors"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01229-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01229-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01229-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T20:32:50Z","timestamp":1689885170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01229-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,29]]},"references-count":29,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1229"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01229-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,4,29]]},"assertion":[{"value":"13 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}