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

An adaptive secret image sharing with a new bitwise steganographic property

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 36 publications
(7 citation statements)
references
References 38 publications
0
7
0
Order By: Relevance
“…Compared with Shamir-based SIS, CA-based SIS [12,15,26,27] has more advantages: (1) the computation complexity of CA-based SIS is only O(n), which is more efficient while Shamir-based SIS needs O(n log n); (2) the consecutive properties in CA provide a stronger security guarantee for the secret image. Nevertheless, most CA-based SIS schemes also exist in some problems: (1) only consecutive shadows can reveal the secret image [15,26,27] which limited the availability and (2) the pixel expansion problem still exists. e scheme of Eslami et al [15] is the first CAbased SIS, which improved tamper detection.…”
Section: Sismentioning
confidence: 99%
See 1 more Smart Citation
“…Compared with Shamir-based SIS, CA-based SIS [12,15,26,27] has more advantages: (1) the computation complexity of CA-based SIS is only O(n), which is more efficient while Shamir-based SIS needs O(n log n); (2) the consecutive properties in CA provide a stronger security guarantee for the secret image. Nevertheless, most CA-based SIS schemes also exist in some problems: (1) only consecutive shadows can reveal the secret image [15,26,27] which limited the availability and (2) the pixel expansion problem still exists. e scheme of Eslami et al [15] is the first CAbased SIS, which improved tamper detection.…”
Section: Sismentioning
confidence: 99%
“…It is easy to design SIS with verification ability by using hash codes [16][17][18] or information hiding [15,26,31]. Chang et al [14] used the Chinese remainder theorem (CRT) to generate four authentication bits by using the hash function in order to obtain better authentication ability.…”
Section: Verifiable Sismentioning
confidence: 99%
“…Yang et al [33] further improved Lin and Tsai's method [12]. More enhancements can refer to [3] [37] [39].…”
Section: Introductionmentioning
confidence: 99%
“…Then, their scheme uses watermarking to provide the capability to verify shares, thereby preventing share spoofing attacks. Secret sharing can effectively ensure the security of secret information, but the traditional secret sharing schemes (e.g., [8][9][10][11][12]) cannot adjust the threshold value. However, in reality, the threshold value must be adjusted when the security policy or the adversary model changes.…”
Section: Introductionmentioning
confidence: 99%