1,720,983 research outputs found
Extending abstract interpretation to new applicative scenarios
No full textThe aim of this thesis is to extend the Abstract Interpretation framework to the broader context of Information Systems. In particular, we address issues related to security properties. We formalize a complete denotational semantics, both at concrete and abstract level, of data-intensive applications embedding data manipulation language operations such as SELECT, UPDATE, INSERT and DELETE. This theoretical work serves as a formal foundation of several interesting practical applications, including persistent watermarking, fine grained access control, SQL injection prevention, and cooperative query answering. We also address the issue of program slicing refinement, leading to an abstract program slicing algorithm that covers SQL data manipulation languages as well. A prototype of a tool implementing our abstract program slicing is also presented
Observation-based Fine Grained Access Control of Data
Get PDFIn this paper, we propose an observation-based fine grained access control (OFGAC) mechanism where data are made accessible at various levels of abstractions according to their sensitivity levels. In this setting, unauthorized users are not able to infer the exact content of the confidential data, while they are allowed to get partial information out of it, according to their access rights. The traditional fine grained access control (FGAC) can be seen as a special case of the OFGAC framework
Abstract program slicing on dependence condition graphs
No full textMastroeni and Zanardini introduced the notion of semanticsbased data dependences, both at concrete and abstract domains, that helps in converting the traditional syntactic Program Dependence Graphs (PDGs) into more refined semantics-based (abstract) PDGs by disregarding some false dependences from them. As a result, the slicing techniques based on these semantics-based (abstract) PDGs result into more precise slices.
Aim: The aim of this paper is to further refine the slicing algorithms when focussing on a given property.
Method: The improvement is obtained by (i) applying the notions of semantic relevancy of statements and semantic data dependences, and (ii) combining them with conditional dependences.
Result: We provide an abstract slicing algorithm based on semantics-based abstract Dependence Condition Graphs (DCGs) that enable to identify the conditions for dependences between program point
Abstract interpretation for sound approximation of database query languages
No full textIn this paper we extend the Abstract Interpretation framework to the field of query languages for relational databases as a way to support sound approximation techniques. This way, the semantics of query languages can be tuned according to suitable abstractions of the concrete domain of data
Watermarking Techniques for Relational Databases: Survey, Classification and Comparison
No full textDigital watermarking for relational databases emerged as a candidate solution to provide copyright protection, tamper detection, traitor tracing, maintaining integrity of relational data. Many watermarking techniques have been proposed in the literature to address these purposes. In this paper, we survey the current state-of-the-art and we classify them according to their intent, the way they express the watermark, the cover type, the granularity level, and their verifiability
Abstract Interpretation of Database Query Languages
No full textIn this paper, we extend the Abstract Interpretation framework to the field of query languages for relational databases as a way to support sound approximation techniques. This way, the semantics of query languages can be tuned according to suitable abstractions of the concrete domain of data. The abstraction of relational database system has many interesting applications, in particular, for security purposes, such as fine grained access control, watermarking, etc
Obfuscation-based analysis of SQL injection attacks
Get PDFIn this paper, we propose an obfuscation/deobfuscation based technique to detect the presence of possible SQL Injection Attacks (SQLIA) in a query before submitting it to a DBMS. This technique combines static and dynamic analysis. In the static phase, the queries in the application are replaced by queries in obfuscated form. The main idea behind obfuscation is to isolate all the atomic formulas from other control elements of the query. During the dynamic phase, the user inputs are merged into the obfuscated atomic formulas, and the dynamic verifier analysis the presence of possible SQLIA at atomic formula level. Finally, a deobfuscation step is performed to recover the original query before submitting it to the DBMS
Persistent Watermarking of Relational Databases
No full textDigital watermarking for relational databases emerged as a candidate solution to provide copyright protection of relational data, maintaining integrity of the database information, tamper detection, traitor tracing etc.
In this paper, we introduce the notion of persistent watermarking that serves as a way to recognize the integrity and ownership proof of the database bounded with a set of queries. It allows the evaluation of the database while applying the queries. We preserve the persistency of the watermark by exploiting two invariants of the database state w.r.t. the set of queries: Stable Cells and Semantics-based Properties of the data. We discuss how we can improve the existing techniques in terms of the persistency of the watermark. Moreover, we propose a novel persistent watermarking scheme that strictly improves the algorithm proposed by Li and Den
A Dynamic Context-Aware and Role-Capability Based Access Control Mechanism for Internet of Things
No full textThe Internet of Things (IoT) presents distinct challenges for access control due to its dynamic, heterogeneous, and evolving nature, which existing mechanisms often struggle to address. To overcome these challenges, this paper proposes a novel context-aware role-capability based access control (CRCBAC) system which ef-fectively handles key issues such as dynamic adaptation, capability delegation, con-text awareness, scalability, and security. At its core, CRCBAC utilizes a structured role capability tree (RCT) to ensure secure capability propagation and manage-ment across roles, resolving conflicts through a priority system. Additionally, we design a set of protocols leveraging RCT-operations to securely evaluate access requests, as well as to create, transfer, and revoke capabilities. These protocols are validated through formal analysis using BAN logic and Scyther-based attack simulation, demonstrating CRCBAC’s robustness in ensuring both confidentiality and integrity. Experimental evaluation confirms CRCBAC’s superior scalability and efficiency, achieving up to 75% lower response times and 4.6 times higher through-put compared to state-of-the-art approaches. The capability delegation mechanism consistently maintains response times below 3 ms, even as user capabilities scale, while also reducing energy consumption by 87.5% compared to state-of-the-art approach, making CRCBAC particularly well-suited for energy-constrained IoT environments
Verification of hibernate query language by abstract interpretation
No full textIn this paper, we propose an abstract interpretation framework of Hibernate Query Language (HQL), aiming at automatically and formally verifying enterprise policy specifications on persistent objects which have permanent representation in the underlying database. To this aim, we extend the abstract interpretation approach for object-oriented languages, combined with an abstract semantics of structured query language
- …
