Open AccessAn efficient lattice‐based threshold signature scheme using multi‐stage secret sharing
Author(s) -
Pilaram Hossein,
Eghlidos Taraneh,
Toluee Rahim
Publication year - 2021
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/ise2.12007
Subject(s) - secret sharing , computer science , secure multi party computation , cryptography , verifiable secret sharing , usable , public key cryptography , electronic voting , homomorphic secret sharing , scheme (mathematics) , cryptosystem , anonymity , theoretical computer science , computer security , encryption , voting , mathematics , mathematical analysis , set (abstract data type) , politics , world wide web , political science , law , programming language
Abstract Secret sharing is a cryptographic technique used in many different applications such as cloud computing, multi‐party computation and electronic voting. Security concerns in these applications are data privacy, availability, integrity and verifiability, where secret sharing provides proper solutions. The authors address some important features like verifiability and being multi‐stage to make it usable in various field of application. Here, the authors propose an anonymous threshold signature scheme based on the trapdoor function introduced by Micciancio and Peikert by sharing the private key using a lattice‐based threshold multi‐stage secret sharing (TMSSS) scheme. Then, the authors improve the previously proposed TMSSS scheme, in such a way that less public values are required to publish on the bulletin board which makes the scheme more efficient while preserving the security of the scheme based on the lattice hard problems. The proposed scheme inherits the desired features such as anonymity and verifiability from the improved TMSSS scheme. Furthermore, both schemes use simple matrix operations, which additionally increase the efficiency.