An efficient lossless (2, n) secret image sharing based on Blakley's scheme - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2017

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

Sebastien Beugnon
William Puech
Jean-Pierre Pedeboy

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.
Fichier principal
Vignette du fichier
08122282.pdf (565.07 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

lirmm-01707307 , version 1 (04-03-2019)

Identifiers

Cite

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⟩
199 View
185 Download

Altmetric

Share

Gmail Facebook X LinkedIn More