Name
Abstract | ||
|---|---|---|
This paper proposes a lossless (m, n) secret sharing method based on Thien and Lin's method. First, a secret image is scrambled by the toral automorphism technique to enhance the security and then the scrambled image is shared into n shadow images by the proposed method. The secret image can be reconstructed if subset m of the shadow images are obtained. Experimental results show that the proposed method is feasible for sharing image. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ISDA.2008.103 | ISDA (3) |
Keywords | Field | DocType |
shadow image,toral automorphism technique,secret image,secret sharing method,n shadow image,lossless secret image,subset m,scrambled image,pixel,image reconstruction,visualization,polynomials,security,secret sharing,cryptography,subsets,interpolation | Secure multi-party computation,Secret sharing,Computer science,Image sharing,Artificial intelligence,Discrete mathematics,Shadow,Pattern recognition,Algorithm,Pixel,Shamir's Secret Sharing,Homomorphic secret sharing,Lossless compression | Conference |
Citations | PageRank | References |
1 | 0.41 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hao-Kuan Tso | 1 | 227 | 9.51 |
| Der-Chyuan Lou | 2 | 468 | 37.88 |
| Kai-Ping Wang | 3 | 49 | 4.23 |
| Chiang-Lung Liu | 4 | 23 | 3.45 |