{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T07:30:32Z","timestamp":1744875032991,"version":"3.28.2"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T00:00:00Z","timestamp":1724112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T00:00:00Z","timestamp":1724112000000},"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":["J Cryptol"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00145-024-09515-4","type":"journal-article","created":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T06:32:36Z","timestamp":1724308356000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Randomness Recoverable Secret Sharing Schemes"],"prefix":"10.1007","volume":"37","author":[{"given":"Mohammad","family":"Hajiabadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahram","family":"Khazaei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Behzad","family":"Vahdani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,20]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"N. Alamati, S. Patranabis, Cryptographic primitives with hinting property. In S. Agrawal, D. Lin, editors, Advances in Cryptology - ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5-9, 2022, Proceedings, Part I, volume 13791 of Lecture Notes in Computer Science (Springer, 2022), pp. 33\u201362.","key":"9515_CR1","DOI":"10.1007\/978-3-031-22963-3_2"},{"issue":"3","key":"9515_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00145-013-9149-6","volume":"27","author":"B Applebaum","year":"2014","unstructured":"B. Applebaum, Key-dependent message security: Generic amplification and completeness. J. Cryptol. 27(3):429\u2013451 (2014)","journal-title":"J. Cryptol."},{"issue":"4","key":"9515_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1145\/3417756","volume":"12","author":"B Applebaum","year":"2020","unstructured":"B. Applebaum, B. Arkis, On the power of amortization in secret sharing: $$d$$-uniform secret sharing and CDS with constant information rate. ACM Trans. Comput. Theory 12(4):241\u20132421 (2020)","journal-title":"ACM Trans. Comput. Theory"},{"doi-asserted-by":"crossref","unstructured":"B. Applebaum, A. Beimel, Y. Ishai, E. Kushilevitz, T. Liu, V. Vaikuntanathan, Succinct computational secret sharing, in Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023 (Association for Computing Machinery, 2023), pp. 1553-1566","key":"9515_CR4","DOI":"10.1145\/3564246.3585127"},{"doi-asserted-by":"crossref","unstructured":"A. Beimel, Secret-sharing schemes: A survey, in Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings, pp. 11\u201346, 2011.","key":"9515_CR5","DOI":"10.1007\/978-3-642-20901-7_2"},{"doi-asserted-by":"crossref","unstructured":"A. Beimel, Y. Ishai, On the power of nonlinear secret-sharing. In Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001 (2001), pp. 188\u2013202","key":"9515_CR6","DOI":"10.1109\/CCC.2001.933886"},{"unstructured":"M. Bellare, P. Rogaway, Optimal asymmetric encryption. In A.\u00a0De Santis, editor, Advances in Cryptology - EUROCRYPT \u201994, Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994, Proceedings, volume 950 of Lecture Notes in Computer Science (Springer, 1994), pp. 92\u2013111","key":"9515_CR7"},{"doi-asserted-by":"crossref","unstructured":"J. C. Benaloh, J. Leichter, Generalized secret sharing and monotone functions, in Advances in Cryptology - CRYPTO \u201988, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings (1988), pp. 27\u201335","key":"9515_CR8","DOI":"10.1007\/0-387-34799-2_3"},{"doi-asserted-by":"crossref","unstructured":"G.\u00a0R. Blakley, Safeguarding cryptographic keys, in Proceedings of the 1979 AFIPS National Computer Conference (1979) vol. 48, pp. 313\u2013317","key":"9515_CR9","DOI":"10.1109\/MARK.1979.8817296"},{"doi-asserted-by":"crossref","unstructured":"D. Boneh, Simplified OAEP for the RSA and rabin functions. In J. Kilian, editor, Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings, volume 2139 of Lecture Notes in Computer Science (Springer, 2001), pp. 275\u2013291","key":"9515_CR10","DOI":"10.1007\/3-540-44647-8_17"},{"issue":"3","key":"9515_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"RM Capocelli","year":"1993","unstructured":"R.\u00a0M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the size of shares for secret sharing schemes. J. Cryptol. 6(3):157\u2013167 (1993)","journal-title":"J. Cryptol."},{"issue":"4","key":"9515_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L Csirmaz","year":"1997","unstructured":"L. Csirmaz. The size of a share must be large. J. Cryptol. 10(4):223\u2013231 (1997)","journal-title":"J. Cryptol."},{"issue":"1","key":"9515_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1515\/jmc-2019-0045","volume":"15","author":"L Csirmaz","year":"2020","unstructured":"L. Csirmaz, Secret sharing and duality. J. Math. Cryptol. 15(1):157\u2013173 (2020)","journal-title":"J. Math. Cryptol."},{"key":"9515_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687","volume-title":"Network Information Theory","author":"A El Gamal","year":"2011","unstructured":"A. El Gamal, Y.-H. Kim, in Network Information Theory. Cambridge University Press (2011)"},{"doi-asserted-by":"crossref","unstructured":"S. Garg, M. Hajiabadi, G. Malavolta, R. Ostrovsky, How to build a trapdoor function from an encryption scheme. In M. Tibouchi and H. Wang, editors, Advances in Cryptology - ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6-10, 2021, Proceedings, Part III, volume 13092 of Lecture Notes in Computer Science (Springer, 2021), pp. 220\u2013249","key":"9515_CR15","DOI":"10.1007\/978-3-030-92078-4_8"},{"doi-asserted-by":"crossref","unstructured":"S. Hohenberger, V. Koppula, B. Waters, Chosen ciphertext security from injective trapdoor functions. In D. Micciancio and T. Ristenpart, editors, Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part I, volume 12170 of Lecture Notes in Computer Science (Springer, 2020), pp. 836\u2013866","key":"9515_CR16","DOI":"10.1007\/978-3-030-56784-2_28"},{"doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L.\u00a0A. Levin, M. Luby, Pseudo-random generation from one-way functions (extended abstracts). In D.\u00a0S. Johnson, editor, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, USA (ACM, 1989), pp. 12\u201324.","key":"9515_CR17","DOI":"10.1145\/73007.73009"},{"doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, M. Luby, One-way functions are essential for complexity based cryptography, in 30th Annual Symposium on Foundations of Computer Science (1989), pp. 230\u2013235","key":"9515_CR18","DOI":"10.1109\/SFCS.1989.63483"},{"issue":"1","key":"9515_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"M Ito","year":"1993","unstructured":"M. Ito, A. Saio, T. Nishizeki, Multiple assignment scheme for sharing secret. J. Cryptol. 6(1):15\u201320 (1993)","journal-title":"J. Cryptol."},{"issue":"9","key":"9515_CR20","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/ecjc.4430720906","volume":"72","author":"M Ito","year":"1989","unstructured":"M. Ito, A. Saito, T. Nishizeki, Secret sharing scheme realizing general access structure. Electron. Commun. Jpn. 72(9):56\u201364 (1989)","journal-title":"Electron. Commun. Jpn."},{"key":"9515_CR21","first-page":"448","volume":"2020","author":"A Jafari","year":"2020","unstructured":"A. Jafari, S. Khazaei, Partial secret sharing schemes. IACR Cryptol. ePrint Arch. 2020:448 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"unstructured":"T. Kaced, in Secret Sharing and Algorithmic Information Theory. (Partage de secret et the\u2019orie algorithmique de l\u2019information). PhD thesis, Montpellier 2 University, France (2012)","key":"9515_CR22"},{"issue":"6","key":"9515_CR23","doi-asserted-by":"publisher","first-page":"4379","DOI":"10.1109\/TIT.2018.2823328","volume":"64","author":"T Kaced","year":"2018","unstructured":"T. Kaced, Information inequalities are not closed under polymatroid duality. IEEE Trans. Inf. Theory 64(6):4379\u20134381 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"M. Karchmer, A. Wigderson, On span programs, in Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18\u201321, 1993 (1993), pp. 102\u2013111","key":"9515_CR24"},{"issue":"1","key":"9515_CR25","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"ED Karnin","year":"1983","unstructured":"E.\u00a0D. Karnin, J.\u00a0W. Greene, M.\u00a0E. Hellman, On secret sharing systems. IEEE Trans. Inf. Theory 29(1):35\u201341 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"S. Khazaei, T. Moran, D. Wikstr\u00f6m, A mix-net from any CCA2 secure cryptosystem. In X. Wang and K. Sako, editors, Advances in Cryptology - ASIACRYPT 2012 - 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6, 2012. Proceedings, volume 7658 of Lecture Notes in Computer Science (Springer, 2012), pp. 607\u2013625","key":"9515_CR26","DOI":"10.1007\/978-3-642-34961-4_37"},{"issue":"2","key":"9515_CR27","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s00145-022-09420-8","volume":"35","author":"F Kitagawa","year":"2022","unstructured":"F. Kitagawa, T. Matsuda, K. Tanaka. CCA security and trapdoor functions via key-dependent-message security. J. Cryptol. 35(2):9 (2022)","journal-title":"J. Cryptol."},{"issue":"2","key":"9515_CR28","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/s00145-015-9226-0","volume":"30","author":"I Komargodski","year":"2017","unstructured":"I. Komargodski, M. Naor, E. Yogev, Secret-sharing for NP. J. Cryptol. 30(2):444\u2013469 (2017)","journal-title":"J. Cryptol."},{"doi-asserted-by":"crossref","unstructured":"V. Koppula, B. Waters, Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption. In A. Boldyreva, D. Micciancio, editors, Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part II, volume 11693 of Lecture Notes in Computer Science (Springer, 2019), pp. 671\u2013700","key":"9515_CR29","DOI":"10.1007\/978-3-030-26951-7_23"},{"issue":"4","key":"9515_CR30","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.ins.2009.10.015","volume":"180","author":"C Ki Li","year":"2010","unstructured":"C.\u00a0Ki Li, D.\u00a0S. Wong, Signcryption from randomness recoverable public key encryption. Inf. Sci. 180(4):549\u2013559 (2010)","journal-title":"Inf. Sci."},{"doi-asserted-by":"crossref","unstructured":"A. Lombardi, W. Quach, R.\u00a0D. Rothblum, D. Wichs, D.\u00a0J. Wu, New constructions of reusable designated-verifier nizks. In A. Boldyreva and D. Micciancio, editors, Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part III, volume 11694 of Lecture Notes in Computer Science (Springer, 2019), pp. 670\u2013700","key":"9515_CR31","DOI":"10.1007\/978-3-030-26954-8_22"},{"doi-asserted-by":"crossref","unstructured":"S. Micali, Simple and fast optimistic protocols for fair electronic exchange. In E. Borowsky, S. Rajsbaum, editors, Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, Massachusetts, USA, July 13-16, 2003 (ACM, 2003), pp. 12\u201319","key":"9515_CR32","DOI":"10.1145\/872035.872038"},{"issue":"1","key":"9515_CR33","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"J.\u00a0W. Moon, L. Moser, On cliques in graphs. Israel J. Math. 3(1):23\u201328 (1965)","journal-title":"Israel J. Math."},{"doi-asserted-by":"crossref","unstructured":"D.\u00a0H. Phan, D. Pointcheval, Chosen-ciphertext security without redundancy. In C.-S. Laih, editor, Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings, volume 2894 of Lecture Notes in Computer Science (Springer, 2003), pp. 1\u201318","key":"9515_CR34","DOI":"10.1007\/978-3-540-40061-5_1"},{"unstructured":"P. Rogaway, M. Bellare, Robust computational secret sharing and a unified account of classical secret-sharing goals, in Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, October 28-31, 2007 (2007), pp. 172\u2013184","key":"9515_CR35"},{"issue":"11","key":"9515_CR36","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret. Commun. ACM 22(11):612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"4","key":"9515_CR37","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00145-002-0133-9","volume":"15","author":"V Shoup","year":"2002","unstructured":"V. Shoup, OAEP reconsidered. J. Cryptol. 15(4):223\u2013249 (2002)","journal-title":"J. Cryptol."},{"doi-asserted-by":"crossref","unstructured":"V. Vaikuntanathan, A. Narayanan, K.\u00a0Srinathan, C.\u00a0Pandu Rangan, K. Kim, On the power of computational secret sharing. In T. Johansson and S. Maitra, editors, Progress in Cryptology - INDOCRYPT 2003, 4th International Conference on Cryptology in India, New Delhi, India, December 8-10, 2003, Proceedings, volume 2904 of Lecture Notes in Computer Science (Springer, 2003), pp. 162\u2013176","key":"9515_CR38","DOI":"10.1007\/978-3-540-24582-7_12"},{"doi-asserted-by":"crossref","unstructured":"A.\u00a0C.-C. Yao, Theory and applications of trapdoor functions (extended abstract), in 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982 (IEEE Computer Society, 1982), pp. 80\u201391","key":"9515_CR39","DOI":"10.1109\/SFCS.1982.45"},{"unstructured":"A. C.-C. Yao, Unpublished manuscript, presented at oberwolfach and dimacs workshops (1989)","key":"9515_CR40"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09515-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-024-09515-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09515-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T02:04:50Z","timestamp":1732673090000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-024-09515-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,20]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["9515"],"URL":"https:\/\/doi.org\/10.1007\/s00145-024-09515-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2024,8,20]]},"assertion":[{"value":"3 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"34"}}