Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal JUTI: Jurnal Ilmiah Teknologi Informasi
Firdausi, Hafara
Unknown Affiliation
Computer Science & IT Dentistry Education Library & Information Science

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
CLOUTIDY: A CLOUD-BASED SUPPLY CHAIN MANAGEMENT SYSTEM USING SEMAR AND BLOCKCHAIN SYSTEM Zulfa, Nafa; Firdausi, Hafara; Asyrofi, Rakha
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 18, No. 2, July 2020
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v18i2.a937

Abstract

Supply chain management (SCM) system is an essential requirement for companies and manufacturers to collaborate in doing business. There are many techniques to manage supply chains, such as using Excel sheets and web-based applications. However, these techniques are ineffective, insecure, and prone to human error. In this paper, we propose CLOUTIDY, a cloud-based SCM system using SEMAR (Service Market) and Blockchain system. We modify JUGO architecture to develop SEMAR as a broker between users and cloud service providers. Also, we apply the Blockchain concept to store the activity log of the SCM system in a decentralized database. CLOUTIDY system can solve several common cases: service selection, resource provisioning, authentication and access control. Also, it improves the security of data by storing each activity log of the supply chain management system in the Blockchain system.
MAPPING POTENTIAL ATTACKERS AGAINST NETWORK SECURITY USING LOCATION AWARE REACHABILITY QUERIES ON GEO SOCIAL DATA Firdausi, Hafara; Santoso, Bagus Jati; Qudus, Rohana; Ciptaningtyas, Henning Titi
JUTI: Jurnal Ilmiah Teknologi Informasi Vol. 19, No. 2, Juli 2021
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24068535.v19i2.a1071

Abstract

Attacks on network security can happen anywhere. Using Geo-Social Networks (GSN), i.e., a graph that combines social network data and spatial information, we can find the potential attackers based on the given location. In answering the graph-based problems, Reachability Queries are utilized. It verifies the reachability between two nodes in the graph. This paper addresses a problem defined as follows: Given a geo-social graph and a location area as a query point, we map potential attackers against network security using location-aware reachability queries. We employ the concepts of Reachability Minimum Bounding Rectangle (RMBR) and graph traversal algorithm, i.e., Depth-First Search (DFS), to answer the location-aware reachability queries. There are two kinds of the proposed solution, i.e., (1) RMBR-based solution map potential attackers by looking for intersecting RMBR values, and (2) Graph traversal-based solution map potential attackers by traversing the graph. We evaluate the performance of both proposed solutions using synthetic datasets. Based on the experimental result, the RMBR-based solution has much lower execution time and memory usage than the graph traversal-based solution.
Co-Authors Asyrofi, Rakha Henning Titi Ciptaningtyas Qudus, Rohana Santoso, Bagus Jati Zulfa, Nafa