Pub Date : 2025-12-20DOI: 10.1007/s10623-025-01742-5
Tomer Ashur, Amit Singh Bhati
{"title":"Generalized indifferentiable sponge and its application to Polygon Miden VM","authors":"Tomer Ashur, Amit Singh Bhati","doi":"10.1007/s10623-025-01742-5","DOIUrl":"https://doi.org/10.1007/s10623-025-01742-5","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"29 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145796150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On construction of linear (Euclidean) hull codes over finite extensions binary fields","authors":"Sanjit Bhowmick, Deepak Kumar Dalai, Sihem Mesnager","doi":"10.1007/s10623-025-01757-y","DOIUrl":"https://doi.org/10.1007/s10623-025-01757-y","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"5 9 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145796147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-20DOI: 10.1007/s10623-025-01774-x
Amin Saeidi, Hadiseh Saydi, Thekiso Seretlo
{"title":"A new method for constructing designs and codes from the conjugacy classes of groups","authors":"Amin Saeidi, Hadiseh Saydi, Thekiso Seretlo","doi":"10.1007/s10623-025-01774-x","DOIUrl":"https://doi.org/10.1007/s10623-025-01774-x","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"56 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145796151","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-20DOI: 10.1007/s10623-025-01748-z
Huilan Chang, Ching-Chih Hsu
{"title":"Lemmas on traceability codes and an upper bound for 4-traceability","authors":"Huilan Chang, Ching-Chih Hsu","doi":"10.1007/s10623-025-01748-z","DOIUrl":"https://doi.org/10.1007/s10623-025-01748-z","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"10 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145796152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-20DOI: 10.1007/s10623-025-01759-w
Tingting Wu, Lanqiang Li, Xiuyu Zhang, Shixin Zhu
{"title":"Binary duadic codes and their related codes with a square-root-like lower bound","authors":"Tingting Wu, Lanqiang Li, Xiuyu Zhang, Shixin Zhu","doi":"10.1007/s10623-025-01759-w","DOIUrl":"https://doi.org/10.1007/s10623-025-01759-w","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"22 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145796148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Starting from links between Coding Theory and Secret Sharing Schemes, we develop an extensible and decentralized version of Shamir Secret Sharing, that allows the addition of new users after the initial share distribution. On top of it we design a totally decentralized ( t , n )-threshold Schnorr signature scheme that needs only t users online during the key generation phase, while the others join later. Under standard assumptions we prove our scheme secure against adaptive malicious adversaries. Furthermore, we show how our security notion can be strengthened when considering a rushing adversary. Using a classical game-based argument, we prove that if there is an adversary capable of forging the scheme with non-negligible probability, then we can build a forger for the centralized Schnorr scheme with non-negligible probability.
{"title":"Extensible decentralized secret sharing and application to Schnorr signatures","authors":"Michele Battagliola, Riccardo Longo, Alessio Meneghetti","doi":"10.1007/s10623-025-01746-1","DOIUrl":"https://doi.org/10.1007/s10623-025-01746-1","url":null,"abstract":"Starting from links between Coding Theory and Secret Sharing Schemes, we develop an extensible and decentralized version of Shamir Secret Sharing, that allows the addition of new users after the initial share distribution. On top of it we design a totally decentralized ( <jats:italic>t</jats:italic> , <jats:italic>n</jats:italic> )-threshold Schnorr signature scheme that needs only <jats:italic>t</jats:italic> users online during the key generation phase, while the others join later. Under standard assumptions we prove our scheme secure against adaptive malicious adversaries. Furthermore, we show how our security notion can be strengthened when considering a rushing adversary. Using a classical game-based argument, we prove that if there is an adversary capable of forging the scheme with non-negligible probability, then we can build a forger for the centralized Schnorr scheme with non-negligible probability.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"17 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145753141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-13DOI: 10.1007/s10623-025-01739-0
Joo Woo, Jonghyun Kim, Ga Hee Hong, Seungwoo Lee, Minkyu Kim, Hochang Lee, Jong Hwan Park
{"title":"NTRU+Sign: compact NTRU-based signatures using bimodal distributions","authors":"Joo Woo, Jonghyun Kim, Ga Hee Hong, Seungwoo Lee, Minkyu Kim, Hochang Lee, Jong Hwan Park","doi":"10.1007/s10623-025-01739-0","DOIUrl":"https://doi.org/10.1007/s10623-025-01739-0","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"56 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145753142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：