Robust approaches to 3d object secret sharing

Authors:
Esam Elsheh;A. Ben Hamza
Affiliations:
Concordia Institute for Information Systems Engineering, Concordia University, Montréal, QC, Canada;Concordia Institute for Information Systems Engineering, Concordia University, Montréal, QC, Canada
Venue:
ICIAR'10 Proceedings of the 7th international conference on Image Analysis and Recognition - Volume Part I
Year:
2010

Citing 14
Cited 0

Data compression: methods and theory

Data compression: methods and theory
Sharing secret images using shadow codebooks

Information Sciences—Informatics and Computer Science: An International Journal
How to share a secret

Communications of the ACM
Handbook of Applied Cryptography

Handbook of Applied Cryptography
SCAN-Based Compression-Encryption-Hiding for Video on Demand

IEEE MultiMedia
A new multi-secret images sharing scheme using Largrange's interpolation

Journal of Systems and Software
Secret image sharing with smaller shadow images

Pattern Recognition Letters
Efficient visual secret sharing scheme for color images

Pattern Recognition
Colored visual cryptography without color darkening

Theoretical Computer Science
A cheating prevention scheme for binary visual cryptography with homogeneous secret images

Pattern Recognition
VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches

Pattern Recognition
A multiple-level visual secret-sharing scheme without image size expansion

Information Sciences: an International Journal
Partial encryption of compressed images and videos

IEEE Transactions on Signal Processing
Spread spectrum image steganography

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired by the successful application of image secret sharing schemes in multimedia protection, we present in this paper two secret sharing approaches for 3D models using Blakely and Thien & Lin schemes. We show that encoding 3D models using lossless data compression algorithms prior to secret sharing helps reduce share sizes and remove redundancies and patterns that possibly ease cryptanalysis. The proposed approaches provide a higher tolerance against data corruption/loss than existing 3D protection mechanisms, such as encryption. Experimental results are provided to demonstrate the secrecy and safety of the proposed schemes. The feasibility of the proposed algorithms is demonstrated on various 3D models.