{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T02:27:24Z","timestamp":1778898444780,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["RGPIN-03882"],"award-info":[{"award-number":["RGPIN-03882"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10623-023-01322-5","type":"journal-article","created":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T11:03:23Z","timestamp":1700132603000},"page":"941-956","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Unconditionally secure non-malleable secret sharing and circular external difference families"],"prefix":"10.1007","volume":"92","author":[{"given":"Shannon","family":"Veitch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5635-8122","authenticated-orcid":false,"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,16]]},"reference":[{"key":"1322_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal D., Damg\u00e5rd I., Nielsen J.B., Obremski M., Purwanto E., Ribeiro J., Simkin M.: Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. In: Advances in Cryptology\u2014CRYPTO 2019. Lect. Notes Comput. Sci., vol. 11693, pp. 510\u2013539 (2019).","DOI":"10.1007\/978-3-030-26951-7_18"},{"key":"1322_CR2","unstructured":"Albab K.D., Issa R., Varia M., Graffi K.: Batched differentially private information retrieval. In: 31st USENIX Security Symposium (USENIX Security 22), pp. 3327\u20133344 (2022)."},{"key":"1322_CR3","doi-asserted-by":"crossref","unstructured":"Badrinarayanan S., Srinivasan A.: Revisiting non-malleable secret sharing. In: Advances in Cryptology\u2014EUROCRYPT 2019. Lect. Notes Comput. Sci., vol. 11476, pp. 593\u2013622 (2019).","DOI":"10.1007\/978-3-030-17653-2_20"},{"key":"1322_CR4","doi-asserted-by":"crossref","unstructured":"Bentov I., Kumaresan R.: How to use bitcoin to design fair protocols. In: Advances in Cryptology\u2014CRYPTO 2014. Lect. Notes Comput. Sci., vol. 8617, pp. 421\u2013439 (2014).","DOI":"10.1007\/978-3-662-44381-1_24"},{"key":"1322_CR5","doi-asserted-by":"crossref","unstructured":"Blakley G. R.: Safeguarding cryptographic keys. In: International Workshop on Managing Requirements Knowledge, pp. 313\u2013318 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"1322_CR6","doi-asserted-by":"crossref","unstructured":"Brian G., Faonio A., Venturi D.: Continuously non-malleable secret sharing for general access structures. In: TCC 2019: Theory of Cryptography. Lect. Notes Comput. Sci., vol. 11892, pp. 211\u2013232 (2019).","DOI":"10.1007\/978-3-030-36033-7_8"},{"key":"1322_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.jnt.2020.09.017","volume":"219","author":"SD Cohen","year":"2021","unstructured":"Cohen S.D., Sharma H., Sharma R.: Primitive values of rational functions at primitive elements of a finite field. J. Number Theory 219, 237\u2013246 (2021).","journal-title":"J. Number Theory"},{"key":"1322_CR8","doi-asserted-by":"crossref","unstructured":"Cramer R., Dodis Y., Fehr S., Padr\u00f3 C., Wichs D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Advances in Cryptology\u2014EUROCRYPT 2008. Lect. Notes Comput. Sci., vol. 4965, pp. 471\u2013488 (2008).","DOI":"10.1007\/978-3-540-78967-3_27"},{"key":"1322_CR9","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1007\/s11425-013-4654-5","volume":"56","author":"R Cramer","year":"2013","unstructured":"Cramer R., Fehr S., Padr\u00f3 C.: Algebraic manipulation detection codes. Sci. China Math. 56, 1349\u20131358 (2013).","journal-title":"Sci. China Math."},{"key":"1322_CR10","doi-asserted-by":"crossref","unstructured":"Cramer R., Padr\u00f3 C., Xing C.: Optimal algebraic manipulation detection codes in the constant-error model. In: TCC 2015. Lecture Notes in Computer Science, vol. 9014, pp. 481\u2013501 (2015).","DOI":"10.1007\/978-3-662-46494-6_20"},{"key":"1322_CR11","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I., Groth J.: Non-interactive and reusable non-malleable commitment schemes. In: STOC \u201903: Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, pp. 426\u2013437 (2003).","DOI":"10.1145\/780601.780605"},{"key":"1322_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev D., Dwork C., Naor M.: Non-malleable cryptography. SIAM J. Comput. 30, 391\u2013437 (2000).","journal-title":"SIAM J. Comput."},{"key":"1322_CR13","doi-asserted-by":"crossref","unstructured":"Dwork C., Kenthapadi K., McSherry F., Mironov I., Naor M.: Our data, ourselves: privacy via distributed noise generation. In: Advances in Cryptology\u2014EUROCRYPT 2006. Lect. Notes Comput. Sci., vol. 4004, pp. 486\u2013503 (2006).","DOI":"10.1007\/11761679_29"},{"key":"1322_CR14","unstructured":"Dziembowski S., Pietrzak K., Wichs D.: Non-malleable codes. In: Innovations in Computer Science, pp. 434\u2013452 (2010)."},{"key":"1322_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3178432","volume":"65","author":"S Dziembowski","year":"2018","unstructured":"Dziembowski S., Pietrzak K., Wichs D.: Non-malleable codes. J. ACM 65, 1\u201332 (2018).","journal-title":"J. ACM"},{"key":"1322_CR16","doi-asserted-by":"crossref","unstructured":"Faonio A., Venturi D.: Non-malleable secret sharing in the computational setting: Adaptive tampering, noisy-leakage resilience, and improved rate. In: Advances in Cryptology - CRYPTO 2019. Lect. Notes Comput. Sci., vol. 11693, pp. 448\u2013479 (2019).","DOI":"10.1007\/978-3-030-26951-7_16"},{"key":"1322_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00145-009-9043-4","volume":"24","author":"M Fischlin","year":"2011","unstructured":"Fischlin M., Fischlin R.: Efficient non-malleable commitment schemes. J. Cryptol. 24, 203\u2013244 (2011).","journal-title":"J. Cryptol."},{"key":"1322_CR18","unstructured":"Gordon S.D.: On fairness in secure computation. PhD thesis, University of Maryland, College Park (2010)."},{"key":"1322_CR19","doi-asserted-by":"crossref","unstructured":"Gordon S.D., Ishai Y., Moran T., Ostrovsky R., Sahai A.: On complete primitives for fairness. In: TCC 2010: Theory of Cryptography. Lect. Notes Comput. Sci., vol. 5978, pp. 91\u2013108 (2010).","DOI":"10.1007\/978-3-642-11799-2_7"},{"key":"1322_CR20","doi-asserted-by":"crossref","unstructured":"Goyal V., Kumar A.: Non-malleable secret sharing. In: STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 685\u2013698 (2018).","DOI":"10.1145\/3188745.3188872"},{"key":"1322_CR21","doi-asserted-by":"crossref","unstructured":"Goyal V., Kumar A.: Non-malleable secret sharing for general access structures. In: Advances in Cryptology - CRYPTO 2018 Lect. Notes Comput. Sci., vol. 5157, pp. 501\u2013530 (2018).","DOI":"10.1007\/978-3-319-96884-1_17"},{"key":"1322_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12095-021-00473-3","volume":"13","author":"S Huczynska","year":"2021","unstructured":"Huczynska S., Jefferson C., Nep\u0161insk\u00e1 S.: Strong external difference families in abelian and non-abelian groups. Cryptogr. Commun. 13, 331\u2013341 (2021).","journal-title":"Cryptogr. Commun."},{"key":"1322_CR23","doi-asserted-by":"crossref","unstructured":"Ishai Y., Prabhakaran M., Sahai A.: Founding cryptography on oblivious transfer\u2013efficiently. In: Advances in Cryptology - CRYPTO 2008. Lect. Notes Comput. Sci., vol. 5157, pp. 572\u2013591 (2008).","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"1322_CR24","unstructured":"Ishai Y., Prabhakaran M., Sahai A.: Founding cryptography on oblivious transfer\u2014efficiently. https:\/\/www.cse.iitb.ac.in\/~mp\/pub\/mpc-ot.pdf."},{"key":"1322_CR25","unstructured":"Kenthapadi K.: Models and algorithms for data privacy. PhD thesis, Stanford University (2006)."},{"key":"1322_CR26","doi-asserted-by":"publisher","first-page":"2891","DOI":"10.1016\/j.disc.2016.06.004","volume":"339","author":"MB Paterson","year":"2016","unstructured":"Paterson M.B., Stinson D.R.: Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. Discret. Math. 339, 2891\u20132906 (2016).","journal-title":"Discret. Math."},{"key":"1322_CR27","doi-asserted-by":"crossref","unstructured":"Rosulek M.: Universal composability from essentially any trusted setup. In: Advances in Cryptology\u2014CRYPTO 2012. Lect. Notes Comput. Sci., vol. 7417, pp. 406\u2013423 (2012).","DOI":"10.1007\/978-3-642-32009-5_24"},{"key":"1322_CR28","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979).","journal-title":"Commun. ACM"},{"key":"1322_CR29","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M Tompa","year":"1989","unstructured":"Tompa M., Woll H.: How to share a secret with cheaters. J. Cryptol. 1, 133\u2013138 (1989).","journal-title":"J. Cryptol."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01322-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01322-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01322-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T18:07:45Z","timestamp":1713290865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01322-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,16]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1322"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01322-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,16]]},"assertion":[{"value":"19 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}