Research Article
Lattice-Based Secret Sharing Scheme (Chinese Remainder Theorem)
@INPROCEEDINGS{10.1007/978-3-031-56583-0_4, author={Songshou Dong and Yanqing Yao and Yihua Zhou and Yuguang Yang}, title={Lattice-Based Secret Sharing Scheme (Chinese Remainder Theorem)}, proceedings={Digital Forensics and Cyber Crime. 14th EAI International Conference, ICDF2C 2023, New York City, NY, USA, November 30, 2023, Proceedings, Part II}, proceedings_a={ICDF2C PART 2}, year={2024}, month={4}, keywords={Chinese remainder theorem secret sharing lattice post-quantum verifiable}, doi={10.1007/978-3-031-56583-0_4} }- Songshou Dong
Yanqing Yao
Yihua Zhou
Yuguang Yang
Year: 2024
Lattice-Based Secret Sharing Scheme (Chinese Remainder Theorem)
ICDF2C PART 2
Springer
DOI: 10.1007/978-3-031-56583-0_4
Abstract
Secret sharing schemes are used as a tool in many cryptographic protocols including revocable electronic cash, electronic voting, cloud computing and key management in sensor networks. But the existing post-quantum secret sharing schemes are all based on Shamir’s (t, n) threshold scheme, there is currently no post-quantum secret sharing scheme based on the Chinese Remainder Theorem (CRT), so we construct a verifiable lattice-based secret sharing scheme using some number theory methods and interaction methods. Furthermore, we prove our scheme is safe in the post-quantum era. Finally, we compare our scheme with other schemes. And the comparison shows that our scheme is more efficient and occupies less memory.
Copyright © 2023–2025 ICST
