z-logo
open-access-imgOpen Access
Trust-Based Privacy for Internet of Things
Author(s) -
Vera Suryani,
Selo Sulistyo,
Widyawan Widyawan
Publication year - 2016
Publication title -
international journal of electrical and computer engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.277
H-Index - 22
ISSN - 2088-8708
DOI - 10.11591/ijece.v6i5.pp2396-2402
Subject(s) - computer science , smart objects , object (grammar) , internet of things , encryption , computer security , selection (genetic algorithm) , the internet , process (computing) , cloud computing , value (mathematics) , internet privacy , world wide web , artificial intelligence , machine learning , operating system
Internet of Things or widely known as IOT makes smart objects become active participants in the communication process between objects and their environment. IoT services that utilize Internet connection require solutions to a new problem: security and privacy. Smart objects and machine-to-machine communications in IOT now become interesting research, including that related to security. Privacy, which is a safe condition in which object is free from interference from other objects, is one of the important aspects in IOT. Privacy can be implemented using various ways for examples by applying encryption algorithms, restrictions on access to data or users, as well as implementing rules or specific policy. Trustable object selection is one technique to improve privacy. The process of selecting a trustable object can be done based on past activities or trust history of the object, also by applying a threshold value to determine whether an object is "trusted" or not. Some researchers have studied this approach. In this study, the selection processes of trustable objects are calculated using Modified Ant Colony algorithm. The simulation was performed and resulted in declining graphic trend but stabilized in certain trust value.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here