2016 11th Asia Joint Conference on Information Security (AsiaJCIS) 2016
DOI: 10.1109/asiajcis.2016.11
|View full text |Cite
|
Sign up to set email alerts
|

({1,3},n) Hierarchical Secret Sharing Scheme Based on XOR Operations for a Small Number of Indispensable Participants

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…The scheme features polynomials within a finite field and restores keys between polynomials via Lagrangian interpolation. Other secret sharing techniques feature different polynomials, or the use of various mathematical principles such as Exclusive-OR (XOR) [ 12 , 13 , 14 ], Chinese remainder theorem (CRT) [ 15 , 16 ], or hash functions [ 17 , 18 ].…”
Section: Related Workmentioning
confidence: 99%
“…The scheme features polynomials within a finite field and restores keys between polynomials via Lagrangian interpolation. Other secret sharing techniques feature different polynomials, or the use of various mathematical principles such as Exclusive-OR (XOR) [ 12 , 13 , 14 ], Chinese remainder theorem (CRT) [ 15 , 16 ], or hash functions [ 17 , 18 ].…”
Section: Related Workmentioning
confidence: 99%
“…We consider the fastest implementation over GF(257), where the closest prime field to 2 8 . Each of the multiplication and division operations refers to the lookup table in the same manner as our scheme.…”
Section: Tassa's Schemementioning
confidence: 99%
“…In 2016, they [6], [7] proposed a ({1, k}, n) hierarchical secret sharing scheme over finite fields of characteristic 2 and the more general method of a hierarchical secret sharing scheme over finite fields of characteristic 2, respectively. In that year, they [8] also proposed an XOR-based ({1, 3}, n) hierarchical secret sharing scheme specially made for 3 participants including 1 or 2 indispensable participants to recover the secret through Fujii et al's scheme [9] using only XOR operations.…”
Section: Introductionmentioning
confidence: 99%