2021
DOI: 10.1007/978-3-030-77886-6_12
|View full text |Cite
|
Sign up to set email alerts
|

Leakage-Resilience of the Shamir Secret-Sharing Scheme Against Physical-Bit Leakages

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(3 citation statements)
references
References 35 publications
0
3
0
Order By: Relevance
“…On the basis of the Chinese Remainder Theorem (CRT), Mignotte (1982) and Asmuth and Bloom (1983) introduced another two secret sharing schemes. Several researchers (Pang and Wang 2005;Steinfeld et al 2007;Maji et al 2021;Hineman and Blaum 2022) have extended the scheme proposed by Shamir (1979) using different innovative concepts. The formal definition of (t, n) -TSS scheme (Stinson and Paterson 2018) is mentioned as follows:…”
Section: Secret Sharing-based Security Solutions For Federated Learningmentioning
confidence: 99%
“…On the basis of the Chinese Remainder Theorem (CRT), Mignotte (1982) and Asmuth and Bloom (1983) introduced another two secret sharing schemes. Several researchers (Pang and Wang 2005;Steinfeld et al 2007;Maji et al 2021;Hineman and Blaum 2022) have extended the scheme proposed by Shamir (1979) using different innovative concepts. The formal definition of (t, n) -TSS scheme (Stinson and Paterson 2018) is mentioned as follows:…”
Section: Secret Sharing-based Security Solutions For Federated Learningmentioning
confidence: 99%
“…Based on this state of the art, the main goal of this paper is to provide theoretical explanations for previous empirical observations on prime-field masking, in order to establish foundations on which prime ciphers could be designed. Interestingly, it turns out that the case of bit (e.g., LSB) leakages has been the topic of (for now mostly theoretical) investigations in the context of leakageresilient secret sharing, and extended towards any deterministic leakage model with a bounded range [7,27,31,8,28,30,29]. Among others, these works show that bit leakages are in some sense the most powerful leakage functions with bounded range, which therefore raises the question whether more positive results could be obtained for other, ideally more realistic, leakage functions.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, cryptographic primitives with leakage resilience are required to meet the security requirements of the actual applications [1]. In the past fews years, the leakage-resilient cryptography has become one of the research hotspots [2], [3], and several cryptographic primitives with leakage resilience were proposed, such as identity-based encryption (IBE) [4]- [6], secret sharing [7], [8], and authenticated key exchange [9].…”
Section: Introductionmentioning
confidence: 99%