girao.bib
@inproceedings{istms2005,
author = {Susana Sargento and Tania Calcada and Joao Paulo Barraca and Sergio Crisostomo and Joao Girao and Marek Natkaniec and Norbert Vicari and Francisco Cuesta and Manuel Ricardo},
title = {Mobile Ad-Hoc Networks Integration in the Daidalos Architecture},
booktitle = {IST Mobile and Wireless Communications Summit},
year = {2005},
address = {Dresden, Germany},
month = {June},
organization = {IST Mobile Summit 2005},
abstract = {This paper describes the Ad-hoc network integration architecture being developed
inside the IST project Daidalos. This architecture contains the required functionalities
to support efficient delivery of services, unicast and multicast, legacy and multimedia,
to users connected to the ad-hoc network. For this purpose, several functionalities need
to be in place. First, efficient routing and mobility mechanisms are proposed to decrease
the overhead in the ad-hoc network. Second, distributed QoS mechanisms need to be developed
to support service differentiation and resources control responsive to nodes mobility.
Finally, security, charging and rewarding mechanisms are proposed to guarantee that only
authorized users access the requested services, to increase the operators interest, and to
ensure the correct behaviour of the users in the ad-hoc network.},
pdf = {http://www.girao.org/joao/papers/ist-ms-2005.pdf},
url = {http://www.mobilesummit2005.org/},
cfp = {http://www.girao.org/joao/cfps/ist-ms-2005.pdf}
}
@misc{wwrf13,
author = {Joao Girao and Amardeo Sarma and Dirk Westhoff and Hans-Joerg Voegel},
title = {WSNs on the Road for Automobiles},
howpublished = {Presentation},
month = {March},
year = {2005},
note = {13th Wireless World Reseach Forum, Jeju Island, Korea},
abstract = {Wireless sensor networks (WSN) are a particular class of ad hoc networks that attract
more and more attention both in academia and industry. The sensor nodes themselves are preferably
cost-cheap and tiny consisting of a) application specific sensors, b) a wireless transceiver, c) a
simple processor, and d) an energy unit which may be battery or solar driven. Such sensor nodes
are envisioned to be spread out over a geographical area to form in a truly self-organising manner
a multi-hop network. Such a network may remain autonomous and local in nature, but also obtain
gateway connectivity to larger area networks. Services provided by and within sensor networks may be
pure data acquisition, but also derived added value services such as local hazard information
broadcast. Potential applications for such a scenario can be found in monitoring environmental data
with the objective to understand complex and geographical wide spread interdependencies of the nature.
Examples are the detection of fire in huge forest areas, the monitoring of the road status (frosted,
aquaplaning, oily, obstacle) at some particular points like bridges or curves, or the incremental
shift of snow and rocks in the Alps. Within the IST-FP6 project Daidalos we intend to use WSNs for
the Automobile scenario.
},
pdf = {http://www.girao.org/joao/presentations/wwrf13_abs.pdf},
url = {http://www.wireless-world-research.org/meeting/2005/WWRF13-Jeju/WWRF13-default.asp},
cfp = {http://www.girao.org/joao/cfps/wwrf13.pdf}
}
@inproceedings{wiopt2005,
author = {Mithun Acharya and Joao Girao and Dirk Westhoff},
title = {Secure Comparison of Encrypted Data in Wireless Sensor Networks},
booktitle = {3rd Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks},
year = {2005},
address = {Trentino, Italy},
month = {April},
organization = {WiOpt2005},
abstract = {End to end encryption schemes that support operations over ciphertext are of utmost
importance for commercial private party Wireless Sensor Network (WSN)
implementations to become meaningful and profitable. For WSNs we
demonstrated in our previous work that homomorphic encryption schemes,
when used for concealed data aggregation (CDA), offer two striking
advantages apart from end-to-end concealment of data and ability
to operate on ciphertexts: flexibility by keyless aggregation and
conservation and balancing of aggregator backbone energy. We offered proof
of concept by applying a certain Privacy Homomorphism for sensor
network applications that rely on the addition operation. But a large
class of aggregator functions like median computation or finding
maximum/minimum rely exclusively on comparison operations. Unfortunately
any Privacy Homomorpshism is insecure even against ciphertext only
attacks, if they support comparsion operations. In this paper we show
that a particular order preserving encryption scheme achieves the
above mentioned energy benefits and flexibility when used to support
comparison operations over encrypted texts for Wireless Sensor Networks,
while also managing to hide the plaintext distribution and being
secure against ciphertext only attacks. The scheme is shown to have
reasonable memory and computation overhead when applied for WSNs.},
pdf = {http://www.girao.org/joao/papers/wiopt2005.pdf},
url = {http://www.wiopt.org/},
cfp = {http://www.girao.org/joao/cfps/wiopt2005.pdf}
}
@inproceedings{icc2005,
author = {Joao Girao and Dirk Westhoff and Markus Schneider},
title = {CDA: Concealed Data Aggregation for Reverse Multicast Traffic in Wireless Sensor Networks},
booktitle = {IEEE International Conference on Communications},
year = {2005},
address = {Seoul, Korea},
month = {May},
organization = {ICC2005},
keywords = {Wireless sensor networks, data
encryption, data aggregation, energy consumption, privacy homomorphism},
abstract = {End-to-end encryption
for wireless sensor networks is a challenging problem. To save the
overall energy resources of the network it is agreed that sensed data
need to be consolidated and aggregated on their way to the final
destination. For such circumstances we present an approach that (1)
conceals sensed data end-to-end, by (2) still providing efficient
in-network data aggregation. The aggregating intermediate nodes are
not required to operate on the sensed plaintext data. We apply a
particular class of encryption transformation and exemplarily discuss the
approach on the basis of two aggregation functions. We use actual
implementation to show that the approach is feasible and flexible and
frequently even more energy efficient than hop-by-hop encryption.},
pdf = {http://www.girao.org/joao/papers/icc2005.pdf},
url = {http://www.icc05.org/main/main.html},
cfp = {http://www.girao.org/joao/cfps/icc2005.pdf}
}
@inproceedings{wwan2005,
author = { Jonathan Hammell and Andre Weimerskirch and Joao Girao and Dirk Westhoff},
title = {Recognition in a Low-Power Environment},
booktitle = {Workshop on Wireless Ad Hoc Networking, held in conjunction with IEEE International Conference on Distributed Computing Systems},
year = {2005},
address = {Columbus, Ohio, USA},
month = {June},
organization = {WWAN2005, ICDCS2005},
keywords = { Ad-hoc Networks, Security, Authentication, Identification, Low-Power },
abstract = { This paper formally defines recognition as a new security principle closely related to authentication. Low-power, clean environments require the less authoritative security of recognition. We give general properties of recognition protocols based on the method of key disclosure. We examine previously proposed low-power protocols according to the environment and security model presented. Finally, we give measurements from an implementation of a recognition protocol called Zero Common- Knowledge and discuss how well this proof-of-concept satisfies the properties of the environment.
},
pdf = {http://www.girao.org/joao/papers/wwan2005.pdf},
url = {http://www.lifl.fr/RD2P/WWAN2005/},
cfp = {http://www.girao.org/joao/cfps/wwan2005.pdf}
}