{"title":"标准模型下可验证秘密共享方案的基于游戏的安全证明","authors":"S. Mashhadi","doi":"10.1080/19393555.2022.2160390","DOIUrl":null,"url":null,"abstract":"ABSTRACT In a verifiable secret sharing (VSS) scheme, each participant can check cheating by the dealer or the other participants. In this work, we construct a VSS scheme with the strongest level of computational security and prove its security in the standard model. This scheme is secure against active attack and does not use bilinear pairing and hash function.","PeriodicalId":103842,"journal":{"name":"Information Security Journal: A Global Perspective","volume":"141 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Game-based security proofs for verifiable secret sharing schemes in the standard model\",\"authors\":\"S. Mashhadi\",\"doi\":\"10.1080/19393555.2022.2160390\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT In a verifiable secret sharing (VSS) scheme, each participant can check cheating by the dealer or the other participants. In this work, we construct a VSS scheme with the strongest level of computational security and prove its security in the standard model. This scheme is secure against active attack and does not use bilinear pairing and hash function.\",\"PeriodicalId\":103842,\"journal\":{\"name\":\"Information Security Journal: A Global Perspective\",\"volume\":\"141 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Security Journal: A Global Perspective\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/19393555.2022.2160390\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Security Journal: A Global Perspective","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/19393555.2022.2160390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Game-based security proofs for verifiable secret sharing schemes in the standard model
ABSTRACT In a verifiable secret sharing (VSS) scheme, each participant can check cheating by the dealer or the other participants. In this work, we construct a VSS scheme with the strongest level of computational security and prove its security in the standard model. This scheme is secure against active attack and does not use bilinear pairing and hash function.