2013
DOI: 10.1016/j.ins.2013.03.062
|View full text |Cite
|
Sign up to set email alerts
|

Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
22
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 16 publications
(24 citation statements)
references
References 6 publications
2
22
0
Order By: Relevance
“…We will prove that this new variant of the Asmuth‐Bloom secret sharing scheme is asymptotically ideal if and only if it is based on 1‐compact sequences of co‐primes [10] (this is similar to the result established in [20] on the original Asmuth‐Bloom secret sharing scheme).…”
Section: Asmuth‐bloom Secret Sharing With Public Sharessupporting
confidence: 65%
See 1 more Smart Citation
“…We will prove that this new variant of the Asmuth‐Bloom secret sharing scheme is asymptotically ideal if and only if it is based on 1‐compact sequences of co‐primes [10] (this is similar to the result established in [20] on the original Asmuth‐Bloom secret sharing scheme).…”
Section: Asmuth‐bloom Secret Sharing With Public Sharessupporting
confidence: 65%
“…Now we are ready to introduce the security concepts for the Asmuth-Bloom secret sharing scheme with public shares. We follow a similar line to the one in [8,10,20] and introduce the concepts of asymptotic perfectness, asymptotic information rate, and asymptotic idealness.…”
Section: Security Concepts and Resultsmentioning
confidence: 99%
“…This result was later improved in [4] by showing that the asymptotic idealness of this scheme is achieved for a subclass of compact sequences of co-primes [4]. Compact sequences of co-primes capture very well the idea of sequence of numbers of the "same magnitude", and they are much denser than sequences of consecutive primes [4]. Moreover, [4] studies the security of the Asmuth-Bloom threshold scheme [1] and also proposes some asymptotically perfect and ideal variants of it.…”
Section: Introductionmentioning
confidence: 88%
“…They also proved that the threshold scheme in [3] is asymptotically ideal (and, therefore, asymptotically perfect) provided that it uses sequences of consecutive primes and the secret is uniformly chosen from the secret space. This result was later improved in [4] by showing that the asymptotic idealness of this scheme is achieved for a subclass of compact sequences of co-primes [4]. Compact sequences of co-primes capture very well the idea of sequence of numbers of the "same magnitude", and they are much denser than sequences of consecutive primes [4].…”
Section: Introductionmentioning
confidence: 94%
See 1 more Smart Citation