Abstract
We analyse and exploit implementation features in OpenSSL version 0.9.8g which permit an attack against ECDH-based functionality. The attack, although more general, can recover the entire (static) private key from an associated SSL server via 633 adaptive queries when the NIST curve P-256 is used. One can view it as a software-oriented analogue of the bug attack concept due to Biham et al. and, consequently, as the first bug attack to be successfully applied against a real-world system. In addition to the attack and a posteriori countermeasures, we show that formal verification, while rarely used at present, is a viable means of detecting the features which the attack hinges on. Based on the security implications of the attack and the extra justification posed by the possibility of intentionally incorrect implementations in collaborative software development, we conclude that applying and extending the coverage of formal verification to augment existing test strategies for OpenSSL-like software should be deemed a worthwhile, long-term challenge.

Abstract
Vehicular sensing is emerging as a powerful mean to collect information using the variety of sensors that equip modern vehicles. These sensors range from simple speedometers to complex video capturing systems capable of performing image recognition. The advent of connected vehicles makes such information accessible nearly in real-time and creates a sensing network with a massive reach, amplified by the inherent mobility of vehicles. In this paper we discuss several applications that rely on vehicular sensing, using sensors such as the GPS receiver, windshield cameras, or specific sensors in special vehicles, such as a taximeter in taxi cabs. We further discuss connectivity issues related to the mobility and limited wireless range of an infrastructure-less network based only on vehicular nodes. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

Abstract
The municipal planning and management tasks are generally performed based on text documents or through digital maps provided by geographic information systems (GIS). However, most municipal GIS follow different data models, leading to interoperability problems when there is a need to combine data from different sources. Furthermore, most of the time these tasks are performed in a collaborative way between the municipal technicians, emerging some difficulties in decision making due to the three-dimensional nature of urban space. Thus, this paper describes a methodology which can integrate multiple sources of real data from diverse municipal GIS, in a unified data model based on the CityGML specification. This model is mapped onto an urban ontology oriented for procedural modeling, which, in turn, produces the threedimensional models of the urban environments. The system developed operates in a client-server approach, where the server is responsible for mapping the urban information to the unified data model and the client represents the procedural modeling technology that generates the urban environment in three-dimensional format, allowing users to interact and amplify the existing urban information.

Abstract
Multi-agent system (MAS) is being pointed out as a suitable technology to develop systems that demand flexibility, robustness and re-configurability. Consequently, a significant effort has been noticed to apply MAS to industrial domains exhibiting these characteristics, like manufacturing and smart grids. In spite of the adequacy of the MAS principles to solve the industrial requirements, the truly deployment of MAS for industrial applications is far to be solved. This paper discusses the current challenges for the deployment of MAS in the context of industrial applications, mainly focusing the integration of agents with physical equipment and the ability to run agents directly in industrial or low cost controllers. An experimental MAS solution for a smart grid case study was deployed aiming to support the discussion.

Abstract
We propose a new cryptographic primitive called Delegatable Homomorphic Encryption (DHE). This allows a Trusted Authority to control/delegate the evaluation of circuits over encrypted data to untrusted workers/evaluators by issuing tokens. This primitive can be both seen as a public-key counterpart to Verifiable Computation, where input generation and output verification are performed by different entities, or as a generalisation of Fully Homomorphic Encryption enabling control over computations on encrypted data. Our primitive conies with a series of extra features: 1) there is a one-time setup procedure for all circuits; 2) senders do not need to be aware of the functions which will be evaluated on the encrypted data, nor do they need to register keys; 3) tokens are independent of senders and receiver; and 4) receivers are able to verify the correctness of computation given short auxiliary information on the input data and the function, independently of the complexity of the computed circuit. We give a modular construction of such a DHE scheme from three components: Fully Homomorphic Encryption (FHE), Functional Encryption (FE), and a (customised) MAC. As a stepping stone, we first define Verifiable Functional Encryption (VFE), and then show how one can build a secure DHE scheme from a VFE and an FHE scheme. We also show how to build the required VFE from a standard FE together with a MAC scheme. All our results hold in the standard model. Finally, we show how one can build a verifiable computation (VC) scheme generically from a DHE. As a corollary, we get the first VC scheme which remains verifiable even if the attacker can observe verification results.

Abstract
This paper presents a distributed algorithm to simultaneously compute the diameter, radius and node eccentricity in all nodes of a synchronous network. Such topological information may be useful as input to configure other algorithms. Previous approaches have been modular, progressing in sequential phases using building blocks such as BFS tree construction, thus incurring longer executions than strictly required. We present an algorithm that, by timely propagation of available estimations, achieves a faster convergence to the correct values. We show local criteria for detecting convergence in each node. The algorithm avoids the creation of BFS trees and simply manipulates sets of node ids and hop counts. For the worst scenario of variable start times, each node i with eccentricity ecc(i) can compute: the node eccentricity in diam(G)+ecc(i)+2 rounds; the diameter in 2 diam(G)+ecc(i)+ 2 rounds; and the radius in diam(G) + ecc(i) + 2 radius(G) rounds.