Name
Abstract | ||
|---|---|---|
Visual Secret Sharing (VSS) is a type of cryptographic method used to secure digital media such as images by splitting it into n shares. Then, with k or more shares, the secret media can be reconstructed. Without the required number of shares, they are totally useless individually. The purpose of secret sharing methods is to reinforce the cryptographic approach from different points of failure as a single information-container. Instead of Lagrange's interpolation employed by classical methods, an approach based on linear equations and coding theory resolves the classic problems of VSS methods like pixel expansion and information losses at recovery time. In this paper, we propose an efficient (2, n) secret image sharing scheme without loss of information and size increase of shares, with n ≤ 7 based on linear equations encoded into eight bits to encode separately pixels and permutations to maintain high entropy in shares. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/MMSP.2017.8122282 | 2017 IEEE 19th International Workshop on Multimedia Signal Processing (MMSP) |
Keywords | Field | DocType |
Blakley's scheme,Visual Secret Sharing,cryptographic method,digital media,secret media,secret sharing methods,cryptographic approach,single information-container,linear equations,coding theory,VSS methods,pixel expansion,information losses,secret image sharing scheme,recovery time | Secret sharing,Pattern recognition,Cryptography,Computer science,Permutation,Interpolation,Algorithm,Image sharing,Coding theory,Artificial intelligence,Entropy (information theory),Lossless compression | Conference |
ISSN | ISBN | Citations |
2163-3517 | 978-1-5090-3650-9 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastien Beugnon | 1 | 3 | 1.74 |
| William Puech | 2 | 535 | 76.74 |
| J. P. Pedeboy | 3 | 19 | 3.91 |