Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bruno P. S. Rocha

dblp:52/5483 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-authorSecurity and privacy · 2 · 2 first-authorSystems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Systems and software security · 92% Web and mobile security · 8%
Software engineering, system software, and programming languages
2 papers
Program analysis · 89% Programming languages and type systems · 11%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Systems and software security › information flow control
declassification
0.322013
Hybrid Static-Runtime Information Flow and Declassification Enforcement · IEEE Trans. Inf. Forensics Secur. 2013
Towards Static Flow-Based Declassification for Legacy and Untrusted Programs · IEEE Symposium on Security and Privacy 2010
Systems and software security
information flow control
0.322013
Hybrid Static-Runtime Information Flow and Declassification Enforcement · IEEE Trans. Inf. Forensics Secur. 2013
Towards Static Flow-Based Declassification for Legacy and Untrusted Programs · IEEE Symposium on Security and Privacy 2010
Program analysis
static analysis
0.322013
Hybrid Static-Runtime Information Flow and Declassification Enforcement · IEEE Trans. Inf. Forensics Secur. 2013
Towards Static Flow-Based Declassification for Legacy and Untrusted Programs · IEEE Symposium on Security and Privacy 2010
Web and mobile security
mobile security
0.012013
Hybrid Static-Runtime Information Flow and Declassification Enforcement · IEEE Trans. Inf. Forensics Secur. 2013

Methods — techniques the papers use, named apart from their topics

static analysis · 0.3runtime enforcement · 0.3tree automata · 0.2
YearPublicationVenuePosition
2013 Hybrid Static-Runtime Information Flow and Declassification Enforcement
abstract
There are different paradigms for enforcing information flow and declassification policies. These approaches can be divided into static analyzers and runtime enforcers. Each class has its own strengths and weaknesses, each being able to enforce a different set of policies. In this paper, we introduce a hybrid static-runtime enforcement mechanism that works on unannotated program code and supports information-flow control, as well as declassification policies. Our approach manages to enforce realistic policies, as shown by our three running examples, all within the context of a mobile device application, which cannot be handled separately by static or runtime approaches, and are also not covered by current access control models of mobile platforms such as Android or iOS. We also show that including an intermediate step (called preload check) makes both the static analysis system independent (in terms of security labels) and the runtime enforcer lightweight. Finally, we implement our runtime enforcer and run experiments that show that its overhead is so low that the approach can be rolled out on current mobile systems.
Bruno P. S. Rocha, Mauro Conti, Sandro Etalle, Bruno Crispo
IEEE Trans. Inf. Forensics Secur.1
2011 The impact of mobility on Mobile Ad Hoc Networks through the perspective of complex networks
Cristiano G. Rezende, Azzedine Boukerche, Richard Werner Nelem Pazzi, Bruno P. S. Rocha, Antonio Alfredo Ferreira Loureiro
J. Parallel Distributed Comput.4
2010 Towards Static Flow-Based Declassification for Legacy and Untrusted Programs
abstract
Simple non-interference is too restrictive for specifying and enforcing information flow policies in most programs. Exceptions to non-interference are provided using declassification policies. Several approaches for enforcing declassification have been proposed in the literature. In most of these approaches, the declassification policies are embedded in the program itself or heavily tied to the variables in the program being analyzed, thereby providing little separation between the code and the policy. Consequently, the previous approaches essentially require that the code be trusted, since to trust that the correct policy is being enforced, we need to trust the source code. In this paper, we propose a novel framework in which declassification policies are related to the source code being analyzed via its I/O channels. The framework supports many of the of declassification policies identified in the literature. Based on flow-based static analysis, it represents a first step towards a new approach that can be applied to untrusted and legacy source code to automatically verify that the analyzed program complies with the specified declassification policies. The analysis works by constructing a conservative approximation of expressions over input channel values that could be output by the program, and by determining whether all such expressions satisfy the declassification requirements stated in the policy. We introduce a representation of such expressions that resembles tree automata. We prove that if a program is considered safe according to our analysis then it satisfies a property we call Policy Controlled Release, which formalizes information-flow correctness according to our notion of declassification policy. We demonstrate, through examples, that our approach works for several interesting and useful declassification policies, including one involving declassification of the average of several confidential values.
Bruno P. S. Rocha, Sruthi Bandhakavi, Jerry den Hartog, William H. Winsborough, Sandro Etalle
IEEE Symposium on Security and Privacy1
2010 Adaptive security protocol selection for mobile computing
Bruno P. S. Rocha, Daniel N. O. Costa, Rande A. Moreira, Cristiano G. Rezende, Antonio Alfredo Ferreira Loureiro, Azzedine Boukerche
J. Netw. Comput. Appl.1
2008 Understanding and using mobility on Publish/Subscribe based architectures for MANETs
abstract
Mobile Ad Hoc Networks present several new challenges, mainly due to mobility. Publish/Subscribe is a communication paradigm that fits this network model well since the entities involved in the communication process do not need to be online at the same time or know each otherpsilas addresses. In order to develop properly a Pub/Sub based Architecture for MANETs, it is essential that designers understand how mobility impacts the performance of any solution. This work presents an analysis of the influence of mobility on a previous solution and extends it based on a different perspective on mobility in MANETs. We show that in using this new approach we have managed to achieve better match rates while sending substantially fewer messages.
Cristiano G. Rezende, Azzedine Boukerche, Bruno P. S. Rocha, Antonio Alfredo Ferreira Loureiro
LCN3