Result: A novel fast and provably secure (t,n)-threshold secret sharing construction for digital images

Title:
A novel fast and provably secure (t,n)-threshold secret sharing construction for digital images
Authors:
KAMEL MOHAMED FARAOUN
Source:
Journal of information security and applications. 19(6):331-340
Publisher Information:
Amsterdam: Elsevier, 2014.
Publication Year:
2014
Physical Description:
print, 3/4 p
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Security, safety, Sécurité (multidisciplinaire, général), Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Gestion des mémoires et des fichiers (y compris la protection et la sécurité des fichiers), Memory and file management (including protection and security), Intelligence artificielle, Artificial intelligence, Reconnaissance des formes. Traitement numérique des images. Géométrie algorithmique, Pattern recognition. Digital image processing. Computational geometry, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Cryptographie, Cryptography, Calcul réparti, Distributed computing, Cálculo repartido, Clé symétrique, Symmetric key, Llave simétrica, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Complexité calcul, Computational complexity, Complejidad computación, Complexité linéaire, Linear complexity, Complejidad lineal, Complexité temps, Time complexity, Complejidad tiempo, Cryptage continu, Stream ciphering, Cifrado continuo, Cryptographie, Cryptography, Criptografía, Hachage, Hashing, Image numérique, Digital image, Imagen numérica, Partage secret, Secret sharing, Reparto secreto, Résultat expérimental, Experimental result, Resultado experimental, Stéganographie, Stéganography, Esteganografía, Sécurité informatique, Computer security, Seguridad informatica, Temps linéaire, Linear time, Tiempo lineal, Traçabilité, Traceability, Rastreabilidad, Preuve de sécurité, Provable security, Seguridad demostrable, Hash functions, Secure ciphering, Verifiable secret sharing
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Computer Science Department, Evolutionary Engineering and Distributed Information Systems Laboratory (EEDIS), Djilalli Liabbes University, Sidi Bel Abbès, Algeria
ISSN:
2214-2126
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=29121231
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Telecommunications and information theory
Accession Number:
edscal.29121231
Database:
PASCAL Archive

Further Information

We propose a novel verifiable (t,n)-threshold secret sharing construction using simple cryptographic building blocks. The proposed construction provides an extremely low computational cost with respect to most of existing schemes, since the sharing algorithm has a linear time complexity with respect to the number of participants and the size of the share, when the reconstruction algorithm complexity is constant with respect to the threshold t. Furthermore, the proposed construction is provably secure, and has been shown to be robust, confidential, ideal and traceable. An instance of the proposed construction is implemented using a combination of the CRT-based sharing scheme and the Salsa20 stream cipher. Experimental results and comparisons with existing approaches shows that the proposed approach provides very competitive performances, hence is very suitable to share large sized secrets such like digital images.