Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Wanmeng Ding"'
Publikováno v:
Symmetry, Vol 10, Iss 10, p 530 (2018)
Most of today’s secret image sharing technologies are based on the polynomial-based secret sharing scheme proposed by shamir. At present, researchers mostly focus on the development of properties such as small shadow size and lossless recovery, ins
Externí odkaz:
https://doaj.org/article/e614e2bff6cd407ea8b7e4b9c07101b7
Publikováno v:
Proceedings of the 4th International Conference on Advanced Information Science and System.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ac20e8bfabf9c0ac50b59a834f406f5
https://doi.org/10.1145/3573834.3574533
https://doi.org/10.1145/3573834.3574533
Publikováno v:
Reliability Engineering & System Safety. 232:109072
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b983e6219e748499680f8bbd9b24a4db
https://doi.org/10.1016/j.ress.2022.109072
https://doi.org/10.1016/j.ress.2022.109072
Publikováno v:
International Journal of Digital Crime and Forensics. 11:97-117
This article proposes a novel behavior steganography model based on secret sharing, the main idea of which is to use secret messages as random elements in the secret sharing process to generate shadow images. Based on the introduced model and analyzi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8af65931e09ba0b60f4106c4a7d3b431
https://doi.org/10.4018/ijdcf.2019100107
https://doi.org/10.4018/ijdcf.2019100107
Publikováno v:
Mechanical Systems and Signal Processing. 169:108796
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1011b12432ddebcc40e8996c454f5b7
https://doi.org/10.1016/j.ymssp.2021.108796
https://doi.org/10.1016/j.ymssp.2021.108796
Publikováno v:
Mechanical Systems and Signal Processing. 169:108733
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21d4ed4a93c2501c5d65f8ab11a8a7b8
https://doi.org/10.1016/j.ymssp.2021.108733
https://doi.org/10.1016/j.ymssp.2021.108733
Publikováno v:
International Journal of Digital Crime and Forensics. 10:120-136
Lossless recovery is important for the transmission and storage of image data. In polynomial-based secret image sharing, despite many previous researchers attempted to achieve lossless recovery, none of the proposed work can simultaneously satisfy an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d022b79b38374d8891b1d92751d7b06d
https://doi.org/10.4018/ijdcf.2018040107
https://doi.org/10.4018/ijdcf.2018040107
Publikováno v:
International Journal of Digital Crime and Forensics. 9:45-56
In this paper, homomorphic visual cryptographic scheme (HVCS) is proposed. The proposed HVCS inherits the good features of traditional VCS, such as, loss-tolerant (e.g., (k, n) threshold) and simply reconstructed method, where simply reconstructed me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c64f926557c5f09238bb4a49c7ceb1d
https://doi.org/10.4018/ijdcf.2017040105
https://doi.org/10.4018/ijdcf.2017040105
Publikováno v:
Security with Intelligent Computing and Big-data Services ISBN: 9783030169459
As a basic method, Shamir’s polynomial-based secret sharing (PSS) is utilized to achieve polynomial-based secret image sharing schemes (PSISSs) with other better performances, such as meaningful shares, two-in-one property and et al. Since the modu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e216764fd2322eade50d609cde7d2600
https://doi.org/10.1007/978-3-030-16946-6_11
https://doi.org/10.1007/978-3-030-16946-6_11
Publikováno v:
Image and Video Technology ISBN: 9783319757858
PSIVT
PSIVT
Secret image sharing (SIS) based on Chinese remainder theorem (CRTSIS) has lower recovery computation complexity than Shamir’s polynomial-based SIS. Most of existing CRTSIS schemes generally have the limitations of auxiliary encryption and lossy re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ac4a4bf64d38e5a73ce629106e27aaf
https://doi.org/10.1007/978-3-319-75786-5_15
https://doi.org/10.1007/978-3-319-75786-5_15