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

Cheating identifiable secret sharing scheme using symmetric bivariate polynomial

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 57 publications
(36 citation statements)
references
References 11 publications
0
36
0
Order By: Relevance
“…The SCP-ABE method has a proposed function update which generates incremental sets of policy updated cipher text. Two cheating identification algorithms have been proposed in [10]. In the first algorithm m users who participate in secret reconstruction can identify cheaters.…”
Section: Generic Solutions To Privacy and Security Using Secret Sharimentioning
confidence: 99%
See 2 more Smart Citations
“…The SCP-ABE method has a proposed function update which generates incremental sets of policy updated cipher text. Two cheating identification algorithms have been proposed in [10]. In the first algorithm m users who participate in secret reconstruction can identify cheaters.…”
Section: Generic Solutions To Privacy and Security Using Secret Sharimentioning
confidence: 99%
“…Multi secret sharing scheme Security and privacy [8], [11] Blocked linear secret sharing scheme Security and privacy [9] Threshold secret sharing Security and privacy [5], [6] Secret sharing scheme Security and privacy [7], [10] Proposed Work Focus References…”
Section: Proposed Work Focus Referencesmentioning
confidence: 99%
See 1 more Smart Citation
“…Shamir [3] designed the first (k, n) threshold polynomial-based secret sharing method to achieve high quality of recovered secret images. Other research [4][5][6][7][8], based on Shamir's work, developed some improved polynomial-based SIS schemes in order to get superior results.…”
Section: Introductionmentioning
confidence: 99%
“…In VC research field, random grids (RG)-based VC [17][18][19] is more feasible since RG-based VC has no pixel expansion and basic matrix design. VC can be applied to key management, password transmission [20], identity authentication [21,22], access control, digital watermarking [23][24][25][26], and distributive applications [27][28][29].…”
Section: Introductionmentioning
confidence: 99%