{"title":"基于 LWE 问题的可验证可更改阈值秘密图像共享方案","authors":"Massoud Hadian Dehkordi, Samaneh Mashhadi, Seyed Taghi Farahi, Mohammad Hossein Noorallahzadeh","doi":"10.1007/s11277-024-11454-z","DOIUrl":null,"url":null,"abstract":"<p>In common threshold secret image sharing (t, n) schemes, each of n shareholders has a share of secret image S. By having at least t shares, the dealer D will be able to retrieve the secret. In such traditional schemes, it is not possible to change the threshold value. However, the security policy of the secret recovery phase may change, and the number of shareholders present at the phase of secret recovery may need to change. In such cases, a secret sharing scheme with changeable threshold can be applied. In this paper, we introduce the first changeable threshold secret image sharing scheme based on Learning With Error problem. It employs Bloom Filter to provide non-interactive verification of participants’ shares.</p>","PeriodicalId":23827,"journal":{"name":"Wireless Personal Communications","volume":"18 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Verifiable Changeable Threshold Secret Image Sharing Scheme Based on LWE Problem\",\"authors\":\"Massoud Hadian Dehkordi, Samaneh Mashhadi, Seyed Taghi Farahi, Mohammad Hossein Noorallahzadeh\",\"doi\":\"10.1007/s11277-024-11454-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In common threshold secret image sharing (t, n) schemes, each of n shareholders has a share of secret image S. By having at least t shares, the dealer D will be able to retrieve the secret. In such traditional schemes, it is not possible to change the threshold value. However, the security policy of the secret recovery phase may change, and the number of shareholders present at the phase of secret recovery may need to change. In such cases, a secret sharing scheme with changeable threshold can be applied. In this paper, we introduce the first changeable threshold secret image sharing scheme based on Learning With Error problem. It employs Bloom Filter to provide non-interactive verification of participants’ shares.</p>\",\"PeriodicalId\":23827,\"journal\":{\"name\":\"Wireless Personal Communications\",\"volume\":\"18 1\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Wireless Personal Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s11277-024-11454-z\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Wireless Personal Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11277-024-11454-z","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0
摘要
在常见的阈值秘密图像共享（t，n）方案中，n 个股东每人都有一份秘密图像 S。在这种传统方案中，无法改变阈值。但是，秘密恢复阶段的安全策略可能会改变，在秘密恢复阶段的股东人数也可能需要改变。在这种情况下，可以采用阈值可变的秘密共享方案。本文首次提出了基于 "带误差学习"（Learning With Error）问题的可变阈值秘密图像共享方案。它采用 Bloom 过滤器对参与者的共享进行非交互式验证。
Verifiable Changeable Threshold Secret Image Sharing Scheme Based on LWE Problem
In common threshold secret image sharing (t, n) schemes, each of n shareholders has a share of secret image S. By having at least t shares, the dealer D will be able to retrieve the secret. In such traditional schemes, it is not possible to change the threshold value. However, the security policy of the secret recovery phase may change, and the number of shareholders present at the phase of secret recovery may need to change. In such cases, a secret sharing scheme with changeable threshold can be applied. In this paper, we introduce the first changeable threshold secret image sharing scheme based on Learning With Error problem. It employs Bloom Filter to provide non-interactive verification of participants’ shares.
期刊介绍：
The Journal on Mobile Communication and Computing ...
Publishes tutorial, survey, and original research papers addressing mobile communications and computing;
Investigates theoretical, engineering, and experimental aspects of radio communications, voice, data, images, and multimedia;
Explores propagation, system models, speech and image coding, multiple access techniques, protocols, performance evaluation, radio local area networks, and networking and architectures, etc.;
98% of authors who answered a survey reported that they would definitely publish or probably publish in the journal again.
Wireless Personal Communications is an archival, peer reviewed, scientific and technical journal addressing mobile communications and computing. It investigates theoretical, engineering, and experimental aspects of radio communications, voice, data, images, and multimedia. A partial list of topics included in the journal is: propagation, system models, speech and image coding, multiple access techniques, protocols performance evaluation, radio local area networks, and networking and architectures.
In addition to the above mentioned areas, the journal also accepts papers that deal with interdisciplinary aspects of wireless communications along with: big data and analytics, business and economy, society, and the environment.
The journal features five principal types of papers: full technical papers, short papers, technical aspects of policy and standardization, letters offering new research thoughts and experimental ideas, and invited papers on important and emerging topics authored by renowned experts.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
