Open AccessSecuring graph steganography by using Shamir’s secret sharing
Author(s) -
Aprianti Nanda Sari
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/830/3/032022
Subject(s) - secret sharing , steganography , computer science , computer security , graph , theoretical computer science , cover (algebra) , shamir's secret sharing , secure multi party computation , homomorphic secret sharing , steganography tools , cryptography , embedding , artificial intelligence , engineering , mechanical engineering
Nowadays, information exchange becomes popular along with the development of information technology. To protect their confidential information, people usually use steganography because it hides the presence of the secret information in a media file called as cover . In 2008, Desoky et.al. proposed a method namely graphstega or graph steganography that conceals message as data points in a graph. However, this method is vulnerable since the value represented by the graph is not realistic and this will raise suspicion. To overcome the problem, this paper presents a novel approach by exploiting a graph built based on real data as the cover. To securing the position of the secret message, Shamir’s secret sharing scheme is used. The experiment showed that this method has better security than graphstega does.