How to construct a verifiable multi‐secret sharing scheme based on graded encoding schemes. (1st July 2019)

• Record Type: Journal Article
• Authors: Hadian Dehkordi, Massoud; Oraei, Hossein
• Is Part Of: IET information security. Volume 13:Number 4(2019)
• Page Start: 343
• Page End: 351
• Publication Date: 2019-07-01
• Subjects: cryptography; graded encoding schemes -- VMSS scheme -- verifiable multisecret sharing scheme -- graded decision‐Diffie–Hellman problem -- monotone span programs -- general access structure -- computational security; Computer security -- Periodicals; Cryptography -- Periodicals; Computer networks -- Security measures -- Periodicals; Database security -- Periodicals; 005.8
• DOI: 10.1049/iet-ifs.2018.5306
• Languages: English
• ISSNs: 1751-8709

Abstract

Abstract : In a verifiable multi‐secret sharing scheme, a dealer distributes multiple secrets between a group of participants and also additional information is given that allows each participant to check whether his share is valid. In this study, the authors present a novel verifiable multi‐secret sharing (VMSS) scheme with general access structure using monotone span programs, which its security is based on graded encoding schemes. More precisely, they reduce the hardness of graded decision‐Diffie–Hellman problem to the computational security of the authors' scheme in the standard model. To the best of the authors' knowledge, this is the first study to present a VMSS scheme based on graded encoding schemes.