{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:10:26Z","timestamp":1771611026595,"version":"3.50.1"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587368","type":"print"},{"value":"9783031587375","type":"electronic"}],"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-58737-5_11","type":"book-chapter","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T11:01:52Z","timestamp":1714215712000},"page":"286-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Constructing Leakage-Resilient Shamir\u2019s Secret Sharing: Over Composite Order Fields"],"prefix":"10.1007","author":[{"given":"Hemanta K.","family":"Maji","sequence":"first","affiliation":[]},{"given":"Hai H.","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Anat","family":"Paskin-Cherniavsky","sequence":"additional","affiliation":[]},{"given":"Xiuyu","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,28]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Adams, D.Q., et al.: Lower bounds for leakage-resilient secret sharing schemes against probing attacks. In: ISIT 2021 (2021)","DOI":"10.1109\/ISIT45174.2021.9518230"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-030-26951-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Aggarwal","year":"2019","unstructured":"Aggarwal, D., et al.: Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 510\u2013539. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_18"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-030-17653-2_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Badrinarayanan","year":"2019","unstructured":"Badrinarayanan, S., Srinivasan, A.: Revisiting non-malleable secret sharing. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 593\u2013622. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_20"},{"key":"11_CR4","unstructured":"Bafna, M., Sudan, M., Velusamy, S., Xiang,D.: Elementary analysis of isolated zeroes of a polynomial system (2021). arXiv preprint arXiv:2102.00602"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-319-96884-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"F Benhamouda","year":"2018","unstructured":"Benhamouda, F., Degwekar, A., Ishai, Y., Rabin, T.: On the local leakage resilience of linear secret sharing schemes. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 531\u2013561. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_18"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s00145-021-09375-2","volume":"34","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Degwekar, A., Ishai, Y., Rabin, T.: On the local leakage resilience of linear secret sharing schemes. J. Cryptol. 34(2), 10 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09375-2","journal-title":"J. Cryptol."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-662-49890-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"A Bishop","year":"2016","unstructured":"Bishop, A., Pastro, V., Rajaraman, R., Wichs, D.: Essentially optimal robust secret sharing with maximal corruptions. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 58\u201386. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_3"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-26951-7_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Bogdanov","year":"2019","unstructured":"Bogdanov, A., Ishai, Y., Srinivasan, A.: Unconditionally secure computation against low-complexity leakage. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 387\u2013416. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_14"},{"key":"11_CR9","unstructured":"Brand\u00e3o, L.T.A.N., Peralta, R.: NIST first call for multi-party threshold schemes, 25 January 2023. https:\/\/csrc.nist.gov\/publications\/detail\/nistir\/8214c\/draft"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Chandran, N., Kanukurthi, B., Lakshmi, S., Obbattu, B., Sekar, S.: Short leakage resilient and non-malleable secret sharing schemes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0I, vol. 13507, LNCS, pp. 178\u2013207. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_7","DOI":"10.1007\/978-3-031-15802-5_7"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, E., et al.: Extractors and secret sharing against bounded collusion protocols. In: 61st FOCS, pp. 1226\u20131242. IEEE Computer Society Press, November 2020. https:\/\/doi.org\/10.1109\/FOCS46700.2020.00117","DOI":"10.1109\/FOCS46700.2020.00117"},{"issue":"8","key":"11_CR12","doi-asserted-by":"publisher","first-page":"5165","DOI":"10.1109\/TIT.2022.3167615","volume":"68","author":"R Con","year":"2022","unstructured":"Con, R., Tamo, I.: Nonlinear repair of reed-Solomon codes. IEEE Trans. Inf. Theory 68(8), 5165\u20135177 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3167615","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Costes, N., Stam, M.: Redundant code-based masking revisited. IACR TCHES. 2021(1), 426\u2013450 (2021). https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8740, https:\/\/doi.org\/10.46586\/tches.v2021.i1.426-450","DOI":"10.46586\/tches.v2021.i1.426-450"},{"issue":"9","key":"11_CR14","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"Dimakis, A.G., Godfrey, P.B., Wu, Y., Wainwright, M.J., Ramchandran, K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9), 4539\u20134551 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"El\u00a0Rouayheb, S., Ramchandran,K.: Fractional repetition codes for repair in distributed storage systems. In: 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1510\u20131517. IEEE (2010)","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-030-17659-4_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Fehr","year":"2019","unstructured":"Fehr, S., Yuan, C.: Towards optimal robust secret sharing with security against a rushing adversary. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 472\u2013499. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_16"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-030-64381-2_17","volume-title":"Theory of Cryptography","author":"S Fehr","year":"2020","unstructured":"Fehr, S., Yuan, C.: Robust secret sharing with almost optimal share size and security against rushing adversaries. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 470\u2013498. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_17"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Goparaju, S., El\u00a0Rouayheb, S., Calderbank, R., Vincent Poor, H.: Data secrecy in distributed storage systems under exact repair. In: 2013 International Symposium on Network Coding (NetCod), pp. 1\u20136. IEEE (2013)","DOI":"10.1109\/NetCod.2013.6570831"},{"issue":"10","key":"11_CR19","doi-asserted-by":"publisher","first-page":"6318","DOI":"10.1109\/TIT.2017.2690662","volume":"63","author":"S Goparaju","year":"2017","unstructured":"Goparaju, S., Fazeli, A., Vardy, A.: Minimum storage regenerating codes for all parameters. IEEE Trans. Inf. Theory 63(10), 6318\u20136328 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In: Diakonikolas, I., Kempe, D., Henzinger, M. eds. 50th ACM STOC, pp. 685\u2013698. ACM Press, June 2018. https:\/\/doi.org\/10.1145\/3188745.3188872","DOI":"10.1145\/3188745.3188872"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Guruswami, V., Wootters, M.: Repairing reed-Solomon codes. In: Wichs, D., Mansour, Y., (eds.) 48th ACM STOC, pp. 216\u2013226. ACM Press, June 2016. https:\/\/doi.org\/10.1145\/2897518.2897525","DOI":"10.1145\/2897518.2897525"},{"issue":"9","key":"11_CR22","doi-asserted-by":"publisher","first-page":"5684","DOI":"10.1109\/TIT.2017.2702660","volume":"63","author":"V Guruswami","year":"2017","unstructured":"Guruswami, V., Wootters, M.: Repairing reed-Solomon codes. IEEE Trans. Inf. Theory 63(9), 5684\u20135698 (2017). https:\/\/doi.org\/10.1109\/TIT.2017.2702660","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-030-45724-2_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"C Hazay","year":"2020","unstructured":"Hazay, C., Venkitasubramaniam, M., Weiss, M.: The price of active security in cryptographic protocols. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 184\u2013215. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_7"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_27","DOI":"10.1007\/978-3-540-45146-4_27"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Klein, O., Komargodski, I.: New bounds on the local leakage resilience of Shamir\u2019s secret sharing scheme. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology\u2013CRYPTO 2023. CRYPTO 2023. LNCS, vol. 14081, pp. 139\u2013170. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_5","DOI":"10.1007\/978-3-031-38557-5_5"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Kumar, A., Meka, R., Sahai, A.: Leakage-resilient secret sharing against colluding parties. In: Zuckerman, D., (ed.) 60th FOCS, pp. 636\u2013660. IEEE Computer Society Press, November 2019. https:\/\/doi.org\/10.1109\/FOCS.2019.00045","DOI":"10.1109\/FOCS.2019.00045"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-030-77886-6_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"HK Maji","year":"2021","unstructured":"Maji, H.K., Nguyen, H.H., Paskin-Cherniavsky, A., Suad, T., Wang, M.: Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 344\u2013374. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_12"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Maji, H.K., et al.:. Tight estimate of the local leakage resilience of the additive secret-sharing scheme & its consequences. In: Dachman-Soled, D. (ed.) 3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5-7, 2022, Cambridge, MA, USA, vol. 230, LIPIcs, pp. 16:1\u201316:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2022.16","DOI":"10.4230\/LIPIcs.ITC.2022.16"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Maji, H.K., Nguyen, H.H., Paskin-Cherniavsky, A., Wang, M.: Improved bound on the local leakage-resilience of Shamir\u2019s secret sharing. In: IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, June 26\u2013July 1, 2022, pp. 2678\u20132683. IEEE (2022). https:\/\/doi.org\/10.1109\/ISIT50566.2022.9834695","DOI":"10.1109\/ISIT50566.2022.9834695"},{"key":"11_CR30","unstructured":"Maji, H.K., Nguyen, H.H., Paskin-Cherniavsky, A., Ye, X.: Security of Shamir\u2019s secret-sharing against physical bit leakage: Secure evaluation places (2023). https:\/\/www.cs.purdue.edu\/homes\/hmaji\/papers\/MNPY23.pdf"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/978-3-030-84252-9_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"HK Maji","year":"2021","unstructured":"Maji, H.K., Paskin-Cherniavsky, A., Suad, T., Wang, M.: Constructing locally leakage-resilient linear secret-sharing schemes. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 779\u2013808. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_26"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-030-56877-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"P Manurangsi","year":"2020","unstructured":"Manurangsi, P., Srinivasan, A., Vasudevan, P.N.: Nearly optimal robust secret sharing against rushing adversaries. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 156\u2013185. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_6"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-030-45721-1_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"JB Nielsen","year":"2020","unstructured":"Nielsen, J.B., Simkin, M.: Lower bounds for leakage-resilient secret sharing. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 556\u2013577. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_20"},{"key":"11_CR34","unstructured":"NIST. Randomness beacon project. http:\/\/www.nist.gov\/itl\/csd\/ct\/nist_beacon.cfm"},{"issue":"5","key":"11_CR35","doi-asserted-by":"publisher","first-page":"3021","DOI":"10.1109\/TIT.2013.2241819","volume":"59","author":"DS Papailiopoulos","year":"2013","unstructured":"Papailiopoulos, D.S., Dimakis, A.G., Cadambe, V.R.: Repair optimal erasure codes through Hadamard designs. IEEE Trans. Inf. Theory 59(5), 3021\u20133037 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"11_CR36","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"K Vinayak Rashmi","year":"2011","unstructured":"Vinayak Rashmi, K., Shah, N.B., Vijay Kumar, P.: Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans. Inf. Theory 57(8), 5227\u20135239 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"11_CR37","first-page":"612","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-030-26951-7_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Srinivasan","year":"2019","unstructured":"Srinivasan, A., Vasudevan, P.N.: Leakage resilient secret sharing and applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 480\u2013509. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_17"},{"issue":"3","key":"11_CR39","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1109\/TIT.2012.2227110","volume":"59","author":"I Tamo","year":"2012","unstructured":"Tamo, I., Wang, Z., Bruck, J.: Zigzag codes: MDS array codes with optimal rebuilding. IEEE Trans. Inf. Theory 59(3), 1597\u20131616 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"11_CR40","doi-asserted-by":"publisher","first-page":"4466","DOI":"10.1109\/TIT.2016.2553675","volume":"62","author":"Z Wang","year":"2016","unstructured":"Wang, Z., Tamo, I., Bruck, J.: Explicit minimum storage regenerating codes. IEEE Trans. Inf. Theory 62(8), 4466\u20134480 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"11_CR41","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1006\/jnth.1996.0078","volume":"58","author":"TD Wooley","year":"1996","unstructured":"Wooley, T.D.: A note on simultaneous congruences. J. Number Theory. 58(2), 288\u2013297 (1996)","journal-title":"J. Number Theory."},{"issue":"4","key":"11_CR42","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1109\/TIT.2017.2661313","volume":"63","author":"M Ye","year":"2017","unstructured":"Ye, M., Barg, A.: Explicit constructions of high-rate MDS array codes with optimal repair bandwidth. IEEE Trans. Inf. Theory 63(4), 2001\u20132014 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"11_CR43","doi-asserted-by":"publisher","first-page":"6307","DOI":"10.1109\/TIT.2017.2730863","volume":"63","author":"M Ye","year":"2017","unstructured":"Ye, M., Barg, A.: Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization. IEEE Trans. Inf. Theory 63(10), 6307\u20136317 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"11_CR44","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ffa.2011.06.003","volume":"18","author":"X Zhao","year":"2012","unstructured":"Zhao, X.: A note on multiple exponential sums in function fields. Finite Fields Appl. 18(1), 35\u201355 (2012)","journal-title":"Finite Fields Appl."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58737-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T23:03:24Z","timestamp":1715555004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58737-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587368","9783031587375"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58737-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}