Offloading the Training of an I/O Access Pattern Detector to the Cloud

Author(s):  
Cristiano A. Kunas ◽  
Matheus S. Serpa ◽  
Jean Luca Bez ◽  
Edson L. Padoin ◽  
Philippe O. A. Navaux
Keyword(s):  
Author(s):  
Muhammad Zia Aftab Khan ◽  
Jihyun Park

The purpose of this paper is to develop WebSecuDMiner algorithm to discover unusual web access patterns based on analysing the potential rules hidden in web server log and user navigation history. Design/methodology/approach: WebSecuDMiner uses equivalence class transformation (ECLAT) algorithm to extract user access patterns from the web log data, which will be used to identify the user access behaviours pattern and detect unusual one. Data extracted from the web serve log and user browsing behaviour is exploited to retrieve the web access pattern that is produced by the same user. Findings: WebSecuDMiner is used to detect whether any unauthorized access have been posed and take appropriate decisions regarding the review of the original rights of suspicious user. Research limitations/implications: The present work uses the database which is extracted from web serve log file and user browsing behaviour. Although the page is viewed by the user, the visit is not recorded in the server log file, since it can be access from the browser's cache.


Author(s):  
Abu Naser ◽  
Muhammad ◽  
Nusrat Sultana ◽  
Md. Ashraful Islam ◽  
Jesan Ahammed Ovi

2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Kholoud Al-Saleh ◽  
Abdelfettah Belghith

Oblivious Random-Access Memory (ORAM) is becoming a fundamental component for modern outsourced storages as a cryptographic primitive to prevent information leakage from a user access pattern. The major obstacle to its proliferation has been its significant bandwidth overhead. Recently, several works proposed acceptable low-overhead constructions, but unfortunately they are only evaluated using algorithmic complexities which hide valuable constants that severely impact their practicality. Four of the most promising constructions are Path ORAM, Ring ORAM, XOR Ring ORAM, and Onion ORAM. However, they have never been thoroughly compared against each other and tested on the same experimental platform. To address this issue, we provide a thorough study and assessment of these recent ORAM constructions and implement them under the same testbed. We perform extensive experiments to provide insights into their performance characteristics, simplicity, and practicality in terms of processing time, server storage, client storage, and communication cost. Our extensive experiments show that despite the claimed algorithmic efficiency of Ring and Onion ORAMs and their judicious limited bandwidth requirements, Path ORAM stands out to be the simplest and most efficient ORAM construction.


Sign in / Sign up

Export Citation Format

Share Document