Seila Becirovic
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Seila Becirovic has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Irfan Prazina
Faculty of Electrical Engineering, University of Sarajevo, 71000 Sarajevo, Bosnia and Herzegovina
4 shared publications Ehlimana Krupalija
Department of Computer Science and Informatics, Faculty of Electrical Engineering University of Sarajevo Sarajevo Bosnia and Herzegovina
2 shared publicationsEmir Cogo
Faculty of Electrical Engineering, University of Sarajevo, Sarajevo, Bosnia and Herzegovina
2 shared publications- Emir Cogo
Faculty of Electrical Engineering University of Sarajevo Sarajevo Bosnia and Herzegovina
2 shared publications - Razija Turčinhodžić Mulahasanović
University of Sarajevo
2 shared publications Damir Pozderac
Faculty of Electrical Engineering, University of Sarajevo, Zmaja od Bosne bb, Sarajevo, Bosnia and Herzegovina
1 shared publication
Latest Publications
- Open Access
- 16 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
BLS-MT-ZKP: A novel approach to selective disclosure of claims from digital credentials
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.
- 16 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
Open AccessBLS-MT-ZKP: A novel approach to selective disclosure of claims from digital credentials
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.
- Open Access
- 25 May 2024
- Published by Elsevier in ICT Express
- Vol. 10 (4) , 916-934
Selective disclosure in digital credentials: A review
- 25 May 2024
- Published by Elsevier in ICT Express
- Vol. 10 (4) , 916-934
Open AccessSelective disclosure in digital credentials: A review
- 13 October 2023
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (1)
A Survey of Procedural Modelling Methods for Layout Generation of Virtual Scenes
As virtual worlds continue to rise in popularity, so do the expectations of users for the content of virtual scenes. Virtual worlds must be large in scope and offer enough freedom of movement to keep the audience occupied at all times. For content creators, it is difficult to keep up by manually producing the surrounding content. Therefore, the application of procedural modelling techniques is required. Virtual worlds often mimic the real world, which is composed of organized and connected outdoor and indoor layouts. It is expected that all content is present on the virtual scene and that a user can navigate streets, enter buildings, and interact with furniture within a single virtual world. While there are many procedural methods for generating different layout types, they mostly focus only on one layout type, whereas complete scene generation is greatly underrepresented. This paper aims to identify the coverage of layout types by different methods because similar issues exist for the generation of content of different layout types. When creating a new method for layout generation, it is important to know if the results of existing methods can be appended to other methods. This paper presents a survey of existing procedural modelling methods, which were organized into five categories based on the core approach: pure subdivision, grammar‐based, data‐driven, optimization, and simulation. Information about the covered layout types, the possibility of user interaction during the generation process, and the input and output shape types of the generated content is provided for each surveyed method. The input and output shape types of the generated content can be useful to identify which methods can continue the generation by using the output of other methods as their input. It was concluded that all surveyed methods work for only a few different layout types simultaneously. Moreover, only 35% of the surveyed methods offer interaction with the user after completing the initial process of space generation. Most existing approaches do not perform transformations of shape types. A significant number of methods use the irregular shape type as input and generate the same shape type as the output, which is sufficient for coverage of all layout types when generating a complete virtual world.
- 13 October 2023
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (1)
A Survey of Procedural Modelling Methods for Layout Generation of Virtual Scenes
As virtual worlds continue to rise in popularity, so do the expectations of users for the content of virtual scenes. Virtual worlds must be large in scope and offer enough freedom of movement to keep the audience occupied at all times. For content creators, it is difficult to keep up by manually producing the surrounding content. Therefore, the application of procedural modelling techniques is required. Virtual worlds often mimic the real world, which is composed of organized and connected outdoor and indoor layouts. It is expected that all content is present on the virtual scene and that a user can navigate streets, enter buildings, and interact with furniture within a single virtual world. While there are many procedural methods for generating different layout types, they mostly focus only on one layout type, whereas complete scene generation is greatly underrepresented. This paper aims to identify the coverage of layout types by different methods because similar issues exist for the generation of content of different layout types. When creating a new method for layout generation, it is important to know if the results of existing methods can be appended to other methods. This paper presents a survey of existing procedural modelling methods, which were organized into five categories based on the core approach: pure subdivision, grammar‐based, data‐driven, optimization, and simulation. Information about the covered layout types, the possibility of user interaction during the generation process, and the input and output shape types of the generated content is provided for each surveyed method. The input and output shape types of the generated content can be useful to identify which methods can continue the generation by using the output of other methods as their input. It was concluded that all surveyed methods work for only a few different layout types simultaneously. Moreover, only 35% of the surveyed methods offer interaction with the user after completing the initial process of space generation. Most existing approaches do not perform transformations of shape types. A significant number of methods use the irregular shape type as input and generate the same shape type as the output, which is sufficient for coverage of all layout types when generating a complete virtual world.
- Open Access
- 3 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 13948-13964
Methods for Automatic Web Page Layout Testing and Analysis: A Review
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.
- 3 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 13948-13964
Open AccessMethods for Automatic Web Page Layout Testing and Analysis: A Review
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.
- Open Access
- 28 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 124545-124562
Forward-Propagation Approach for Generating Feasible and Minimum Test Case Suites From Cause-Effect Graph Specifications
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.
- 28 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 124545-124562
Open AccessForward-Propagation Approach for Generating Feasible and Minimum Test Case Suites From Cause-Effect Graph Specifications
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.