Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

Publications by CRACS

2019

Using Grover's search quantum algorithm to solve Boolean satisfiability problems: Part I

Authors
Fernandes, D; Dutra, I;

Publication
ACM Crossroads

Abstract

2019

Characterizing Bipolar Disorder-Associated Single Nucleotide Polymorphisms in a Large British Cohort Using Association Rules

Authors
Pinheira, A; Silva Dias, Rd; Nascimento, C; Dutra, I;

Publication
Computational Intelligence Methods for Bioinformatics and Biostatistics - 16th International Meeting, CIBB 2019, Bergamo, Italy, September 4-6, 2019, Revised Selected Papers

Abstract
Bipolar Disorder (BD) is chronic and severe psychiatric illness presenting with mood alterations, including manic, hypomanic and depressive episodes. Due to the high clinical heterogeneity and lack of biological validation, both BD treatment and diagnostic are still problematic. Patients and clinicians would benefit from better clinical and biological characterization, ultimately opening a new possibility to distinct forms of treatment. In this context, we studied genome wide association (GWA) data from the Wellcome Trust Case Control Consortium (WTCCC). After an exploratory analysis, we found a higher prevalence of homozygous compared with heterozygous in different single nucleotide polymorphisms (SNPs) in genes previously associated with BD risk. Results from our association rules analysis indicate that there is a group of patients presenting with different groups of genotypes, including pairs or triples, while others present only one. We performed the same analysis with a control group from the same cohort (WTCCC) and found that although healthy subjects may present the same SNPs combinations, the risky alleles occur in a lower frequency. Moreover, no subject in the control group presented the same pairs or triples of genotypes found in the BD group, and if a pair or triple is found, the support and confidence are lower than in the BD group (< 50 %). © Springer Nature Switzerland AG 2020.

2019

Using Grover's search quantum algorithm to solve Boolean satisfiability problems, part 2

Authors
Fernandes, D; Silva, C; Dutra, I;

Publication
ACM Crossroads

Abstract

2019

Reputation-Based Security System For Edge Computing

Authors
Nwebonyi, FN; Martins, R; Correia, ME;

Publication
13TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY AND SECURITY (ARES 2018)

Abstract
Given the centralized architecture of cloud computing, there is a genuine concern about its ability to adequately cope with the demands of connecting devices which are sharply increasing in number and capacity. This has led to the emergence of edge computing technologies, including but not limited to mobile edge-clouds. As a branch of Peer-to-Peer (P2P) networks, mobile edge-clouds inherits disturbing security concerns which have not been adequately addressed in previous methods. P2P security systems have featured many trust-based methods owing to their suitability and cost advantage, but these approaches still lack in a number of ways. They mostly focus on protecting client nodes from malicious service providers, but downplay the security of service provider nodes, thereby creating potential loopholes for bandwidth attack. Similarly, trust bootstrapping is often via default scores, or based on heuristics that does not reflect the identity of a newcomer. This work has patched these inherent loopholes and improved fairness among participating peers. The use cases of mobile edge-clouds have been particularly considered and a scalable reputation based security mechanism was derived to suit them. BitTorrent protocol was modified to form a suitable test bed, using Peersim simulator. The proposed method was compared to some related methods in the literature through detailed simulations. Results show that the new method can foster trust and significantly improve network security, in comparison to previous similar systems.

2019

Reputation based approach for improved fairness and robustness in P2P protocols

Authors
Nwebonyi, FN; Martins, R; Correia, ME;

Publication
PEER-TO-PEER NETWORKING AND APPLICATIONS

Abstract
Peer-to-Peer (P2P) overlay networks have gained popularity due to their robustness, cost advantage, network efficiency and openness. Unfortunately, the same properties that foster their success, also make them prone to several attacks. To mitigate these attacks, several scalable security mechanisms which are based on the concepts of trust and reputation have been proposed. These proposed methods tend to ignore some core practical requirements that are essential to make them more useful in the real world. Some of such requirements include efficient bootstrapping of each newcomer's reputation, and mitigating seeder(s) exploitation. Additionally, although interaction among participating peers is usually the bases for reputation, the importance given to the frequency of interaction between the peers is often minimized or ignored. This can result in situations where barely known peers end-up having similar trust scores to the well-known and consistently cooperative nodes. After a careful review of the literature, this work proposes a novel and scalable reputation based security mechanism that addresses the aforementioned problems. The new method offers more efficient reputation bootstrapping, mitigation of bandwidth attack and better management of interaction rate, which further leads to improved fairness. To evaluate its performance, the new reputation model has been implemented as an extension of the BitTorrent protocol. Its robustness was tested by exposing it to popular malicious behaviors in a series of extensive PeerSim simulations. Results show that the proposed method is very robust and can efficiently mitigate popular attacks on P2P overlay networks.

2019

Privacy Preservation and Mandate Representation In Identity Management Systems

Authors
Shehu, AS; Pinto, A; Correia, ME;

Publication
2019 14TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI)

Abstract
The growth in Internet usage has increased the use of electronic services requiring users to register their identity on each service they subscribe to. This has resulted in the prevalence of redundant users data on different services. To protect and regulate access by users to these services identity management systems (IdMs) are put in place. IdMs uses frameworks and standards e.g SAML, OAuth and Shibboleth to manage digital identities of users for identification and authentication process for a service provider. However, current IdMs have not been able to address privacy issues (unauthorised and fine-grained access) that relate to protecting users identity and private data on web services. Many implementations of these frameworks are only concerned with the identification and authentication process of users but not authorisation. They mostly give full control of users digital identities and data to identity and service providers with less or no users participation. This results in a less privacy enhanced solutions that manage users available data in the electronic space. This article proposes a user-centred mandate representation system that empowers resource owners to take full of their digital data; determine and delegate access rights using their mobile phone. Thereby giving users autonomous powers on their resources to grant access to authenticated entities at their will. Our solution is based on the OpenID Connect framework for authorisation service. To evaluate the proposal, we've compared it with some related works and the privacy requirements yardstick outlined in GDPR regulation [1] and [2]. Compared to other systems that use OAuth 2.0 or SAML our solution uses an additional layer of security, where data owner assumes full control over the disclosure of their identity data through an assertion issued from their mobile phones to authorisation server (AS), which in turn issues an access token. This would enable data owners to assert the authenticity of a request, while service providers and requestors also benefit from the correctness and freshness of identity data disclosed to them.

  • 58
  • 200