2017
Authors
Nielsen, MM; Carvalho, NR; Veiga, L; Barbosa, LS;
Publication
ICEGOV
Abstract
Burden reduction is a key issue in modern public administrations' and businesses' agendas. Compliance with mandatory regulations can have a direct impact on a country's economic performance, growth, and development. Research in this area, contributes to a better understanding of the implications and context of administrative burden, and increases the efficiency of the strategies adopted to reduce it. The goal of this study is to undertake a review of the current state of the art on Administrative Burden Reduction (ABR), in order to gain a deeper insight about the subject, identify current gaps, and better plan for future research. A total of 122 papers were identified as relevant, out of a pool of 742 papers retrieved from the current literature. The relevant papers were analyzed across four dimensions: methodology, type and focus, and targeted stakeholders. Three key gaps were identified and discussed in relation to: citizen orientated services and burden reduction; empirical research and post-initiative re-evaluation; and, the role of stakeholders, interest groups and end-users in driving ABR. Lastly a conceptual framework model and next steps are proposed.
2017
Authors
Dantas, ABD; de Carvalho, FH; Barbosa, LS;
Publication
FORMAL ASPECTS OF COMPONENT SOFTWARE (FACS 2017)
Abstract
The orchestration of high performance computing (HPC) services to build scientific applications is based on complex workflows. A challenging task consists of improving the reliability of such workflows, avoiding faulty behaviors that can lead to bad consequences in practice. This paper introduces a certifier component for certifying scientific workflows in a certification framework proposed for HPC Shelf, a cloud-based platform for HPC in which different kinds of users can design, deploy and execute scientific applications. This component is able to inspect the workflow description of a parallel computing system of HPC Shelf and check its consistency with respect to a number of safety and liveness properties specified by application designers and component developers.
2017
Authors
Oliveira Dantas, ABd; Carvalho Junior, FHd; Barbosa, LS;
Publication
CLOSER
Abstract
2017
Authors
Barbosa, LS;
Publication
DALI@TABLEAUX
Abstract
This note revisits layered logics from a coalgebraic point of view, and proposes a naturality condition to express the typical hierarchical requirement under which all abstract transitions should be traceable in more specialised layers. © Springer International Publishing AG 2018.
2017
Authors
Barbosa, LS;
Publication
I3E
Abstract
This lecture discusses the impact of digital transformation of governance mechanisms as a tool to promote sustainable development and more inclusive societies, in the spirit of the United Nations 2030 Agenda. Three main challenges are addressed: the pursuit of inclusiveness, trustworthiness of software infrastructures, and the mechanisms to enforce more transparent and accountable public institutions.
2017
Authors
Barbosa, M; Catalano, D; Fiore, D;
Publication
ESORICS (1)
Abstract
In privacy-preserving processing of outsourced data a Cloud server stores data provided by one or multiple data providers and then is asked to compute several functions over it. We propose an efficient methodology that solves this problem with the guarantee that a honest-but-curious Cloud learns no information about the data and the receiver learns nothing more than the results. Our main contribution is the proposal and efficient instantiation of a new cryptographic primitive called Labeled Homomorphic Encryption (labHE). The fundamental insight underlying this new primitive is that homomorphic computation can be significantly accelerated whenever the program that is being computed over the encrypted data is known to the decrypter and is not secret—previous approaches to homomorphic encryption do not allow for such a trade-off. Our realization and implementation of labHE targets computations that can be described by degree-two multivariate polynomials. As an application, we consider privacy preserving Genetic Association Studies (GAS), which require computing risk estimates from features in the human genome. Our approach allows performing GAS efficiently, non interactively and without compromising neither the privacy of patients nor potential intellectual property of test laboratories.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.