25 May 2024 in ICT Express
13 October 2023 in Computer Graphics Forum
3 February 2023 in IEEE Access
Methods for automatic analysis of user interfaces are essential for a wide range of applications in computer science and software engineering. These methods are used in software security, document archiving, human-computer interaction, software engineering, and data science. Even though these methods are essential, no single research systematically lists most of the methods and their characteristics. This paper aims to give an overview of different solutions and their applications in the separate processes of automatic analysis of user interfaces. The main focus is on the techniques that analyze web page layouts and web page structure. Web pages’ style, type of content, and even structure constantly (often drastically) change, as do methods that analyze them. The fact that most methods use very different datasets and web pages of various complexities are some of the reasons that the direct comparison of methods is difficult, if not impossible. Another fact is that the vast applications of methods practically solve similar problems. With these facts in mind, in the paper, we surveyed relevant scientific articles, categorized them, and provided an overview of how these methods have developed over time.
28 November 2022 in IEEE Access
Cause-effect graphs are a popular black-box testing technique. The most commonly used approach for generating test cases from cause-effect graph specifications uses backward propagation of forced effect activations through the graph in order to get the values of causes for the desired test case. Many drawbacks have been identified when using this approach for different testing requirements. Several algorithms for automatically generating test case suites from cause-effect graph specifications have been proposed. However, many of these algorithms do not solve the main drawbacks of the initial back-propagation approach and offer only minor improvements for specific purposes. This work proposes two new algorithms for deriving test cases from cause-effect representations – an algorithm that uses forward-propagation of all possible cause values in order to get all feasible test cases and an algorithm that minimizes the feasible test case suite while taking multiple effect activations into account. Cause-effect graphs previously used for testing algorithms based on the backward-propagation approach were used for evaluation and comparison, as well as the newly introduced test effect coverage metric and fault detection rate effectiveness. The evaluation shows that the proposed algorithms work in real time even for a very large number of cause nodes. The results also indicate that the first newly proposed algorithm generates a larger test case suite, whereas the second newly proposed algorithm generates a smaller test case subset than the originally proposed approaches while ensuring the maximum effect coverage, fault detection rate effectiveness and a better test effect coverage ratio.
16 December 2024 in IEEE Access
RMRazija Turčinhodžić Mulahasanović
Razija Turčinhodžić Mulahasanović
Digital credentials represent crucial elements of digital identity on the Internet. Credentials should have specific properties that allow them to achieve privacy-preserving capabilities. One of these properties is selective disclosure, which allows users to disclose only the claims or attributes they must. This paper presents a novel approach to selective disclosure BLS-MT-ZKP that combines existing cryptographic primitives: Boneh-Lynn-Shacham (BLS) signatures, Merkle hash trees (MT) and zero-knowledge proof (ZKP) method called Bulletproofs. Combining these methods, we achieve selective disclosure of claims while conforming to selective disclosure requirements. New requirements are defined based on the definition of selective disclosure and privacy spectrum. Besides selective disclosure, specific use cases for equating digital credentials with paper credentials are achieved. The proposed approach was compared to the existing solutions, and its security, threat, performance and limitation analysis was done. For validation, a proof-of-concept was implemented, and the execution time was measured to demonstrate the practicality and efficiency of the approach.