New method for information hiding in open social networks

Author(s):  
Jędrzej Bieniasz ◽  
Krzysztof Szczypiorski
2016 ◽  
Vol 62 (4) ◽  
pp. 347-352 ◽  
Author(s):  
Krzysztof Szczypiorski

Abstract In this paper a new method for information hiding in open social networks is introduced. The method, called StegHash, is based on the use of hashtags in various open social networks to connect multimedia files (like images, movies, songs) with embedded hidden messages. The evaluation of the system was performed on two social media services (Twitter and Instagram) with a simple environment as a proof of concept. The experiments proved that the initial idea was correct, thus the proposed system could create a completely new area of threats in social networks.


2010 ◽  
Vol 20 (02) ◽  
pp. 361-367 ◽  
Author(s):  
C. O. DORSO ◽  
A. D. MEDUS

The problem of community detection is relevant in many disciplines of science. A community is usually defined, in a qualitative way, as a subset of nodes of a network which are more connected among themselves than to the rest of the network. In this article, we introduce a new method for community detection in complex networks. We define new merit factors based on the weak and strong community definitions formulated by Radicchi et al. [2004] and we show that this local definition properly describes the communities observed experimentally in two typical social networks.


2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Katarzyna Musial ◽  
Piotr Bródka ◽  
Przemysław Kazienko ◽  
Jarosław Gaworecki

The data gathered in all kinds of web-based systems, which enable users to interact with each other, provides an opportunity to extract social networks that consist of people and relationships between them. The emerging structures are very complex due to the number and type of discovered connections. In web-based systems, the characteristic element of each interaction between users is that there is always an object that serves as a communication medium. This can be, for example, an e-mail sent from one user to another or post at the forum authored by one user and commented on by others. Based on these objects and activities that users perform towards them, different kinds of relationships can be identified and extracted. Additional challenge arises from the fact that hierarchies can exist between objects; for example, a forum consists of one or more groups of topics, and each of them contains topics that finally include posts. In this paper, we propose a new method for creation of multilayered social network based on the data about users activities towards different types of objects between which the hierarchy exists. Due to the flattening, preprocessing procedure of new layers and new relationships in the multilayered social network can be identified and analysed.


2017 ◽  
Vol 7 (3) ◽  
pp. 149-156
Author(s):  
Mucahit Baydar ◽  
Songul Albayrak

AbstractDevelopments in mobile devices and wireless networks have led to the increasing popularity of location-based social networks. These networks allow users to explore new places, share their location, videos and photos and make friends. They give information about the mobility of users, which can be used to improve the networks. This paper studies the problem of predicting the next check-in of users of location-based social networks. For an accurate prediction, we first analyse the datasets that are obtained from the social networks, Foursquare and Gowalla. Then we obtain some features like place popularity, place popular time range, place distance to user’s home, user’s past visits, category preferences and friendships ,which are used for prediction and deeper understanding of the user behaviours. We use each feature individually, and then in combination, using the new method. Finally, we compare the acquired results and observe the improvement with the new method.Keywords: Location prediction, location-based social network, check-in data.


2017 ◽  
Vol 9 (7) ◽  
pp. 1153-1168 ◽  
Author(s):  
Hossein Shirgahi ◽  
Mehran Mohsenzadeh ◽  
Hamid Haj Seyyed Javadi

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Kamaldeep Joshi ◽  
Swati Gill ◽  
Rajkumar Yadav

As the internet has become the medium for transferring the sensitive information, the security of the transferred message has become the utmost priority. Image steganography has emerged out as the eminent tool of information hiding that ensures the security of the transmitted data. Image files provide high capacity, and their frequency of availability over the internet is also high. In this paper, a method of image coding is proposed that hides the information along a selected pixel and on the next value of the selected pixel, that is, pixel + 1. One bit is hidden at the selected pixel, and the second bit is hidden on the pixel +1 value. On the basis of the 7th bit of the pixels of an image, a mathematical function is applied at the 7th bit of the pixels, which generates a temporary variable (pixel + 1). The 7th bit of the selected pixel and 7th bit of pixel + 1 are used for information hiding and extraction. On the basis of a combination of these two values, two bits of the message can be hidden on each pixel. After implementation, the efficiency of the method is checked on the basis of parameters like PSNR and MSE, and then comparison with some already proposed techniques was done. This proposed image steganography showed interesting, promising results when compared with other existing techniques.


Sign in / Sign up

Export Citation Format

Share Document