An efficient lossless (2, n) secret image sharing based on Blakley's scheme

Sebastien Beugnon 1 William Puech 1 Jean-Pierre Pedeboy 2
1 ICAR - Image & Interaction
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01707307
Contributor : William Puech <>
Submitted on : Monday, March 4, 2019 - 7:29:11 PM
Last modification on : Tuesday, March 5, 2019 - 1:41:20 AM

File

08122282.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Sebastien Beugnon, William Puech, Jean-Pierre Pedeboy. An efficient lossless (2, n) secret image sharing based on Blakley's scheme. MMSP: Multimedia Signal Processing, Oct 2017, Luton, United Kingdom. ⟨10.1109/MMSP.2017.8122282⟩. ⟨lirmm-01707307⟩

Share

Metrics

Record views

284

Files downloads

62