On the Security of a Lattice-Based Multi-Stage Secret Sharing Scheme

Yang, Zhichao; He, Debiao; Qu, Longjiang; Xu, Jianqiao

doi:10.1109/tdsc.2022.3209011

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article2

Book1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

Lattice-Based Secret Sharing Scheme (Chinese Remainder Theorem)

Dong,

Yao,

Zhou

et al. 2024

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Lattice-Based Secret Sharing Scheme (Chinese Remainder Theorem)

Dong,

Yao,

Zhou

et al. 2024

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

A Lattice-Based Single-Share Secret Sharing Scheme

Kumar,

Padhye

2023

SN COMPUT. SCI.

View full text Add to dashboard Cite

PQSF: post-quantum secure privacy-preserving federated learning

Zhang,

Deng,

et al. 2024

Sci Rep

View full text Add to dashboard Cite

In federated learning, secret sharing is a key technology to maintain the privacy of participants’ local models. Moreover, with the rapid development of quantum computers, existing federated learning privacy protection schemes based on secret sharing will no longer be able to guarantee the data security of participants in the post-quantum era. In addition, existing privacy protection methods have the problem of high communication and computational overhead. Although the multi-stage secret sharing scheme proposed by Pilaram et al. is one of the effective solutions to the above problems, existing studies have proven the privacy leakage risk of this scheme. This paper firstly designs a new lattice-based multi-stage secret sharing scheme Improved-Pilaram to solve the security problem, which allows participants to use public vectors to reconstruct different secret values without changing the secret sharing. Based on Improved-Pilaram , this article proposes a post-quantum secure federated learning scheme PQSF . PQSF uses double masking technology to encrypt model parameters and achieves mask reconstruction through secret sharing. Since Improved-Pilaram is multi-stage, participants do not need to update their local secret shares frequently during training. Analysis and experimental results show that the PQSF proposed in this paper reduces the communication complexity between participants and reduces the computational overhead by about 20% compared with existing solutions.

show abstract

On the Security of a Lattice-Based Multi-Stage Secret Sharing Scheme

Cited by 3 publications

References 1 publication

Lattice-Based Secret Sharing Scheme (Chinese Remainder Theorem)

Lattice-Based Secret Sharing Scheme (Chinese Remainder Theorem)

A Lattice-Based Single-Share Secret Sharing Scheme

PQSF: post-quantum secure privacy-preserving federated learning

Contact Info

Product

Resources

About