girao.bib

@article{comcom2007,
  author = {Frederik Armknecht and Dirk Westhoff and Joao Girao and Alban Hessler},
  title = {A lifetime-optimized end-to-end encryption scheme for sensor
               networks allowing in-network processing},
  journal = {Computer Communications},
  volume = {31},
  number = {4},
  month = {October},
  year = {2007},
  pages = {734-749},
  ee = {http://dx.doi.org/10.1016/j.comcom.2007.10.019},
  abstract = {
		The use of converge-cast traffic and in-network processing to
		minimize the amount of transmitted data is a frequently used
		approach to increase the lifetime of a wireless sensor network
		(WSN). Consequently, when aiming at security for WSNs, one has
		to focus primarily on protecting this type of traffic. Some
		recent proposals support the encryption of converge-cast traffic
		with in-network processing. However, they either require the
		transmission of the sensors’ IDs, creating additional data overhead
		linear in the number of sensors, or require an elaborate key
		pre-distribution mechanism. In this paper we propose a solution for
		end-to-end encryption of converge-cast traffic with a simple key
		pre-distribution scheme causing additional data only logarithmic in
		the number of sensors. The scheme is robust with respect to
		unreliable channels, exhausted nodes, and routing flexibility.
		It supports refreshing the keys at the nodes, which has so far
		been fully neglected.
	},
  url = {http://www.elsevier.com/locate/comcom},
  pdf = {http://www.girao.org/joao/papers/comcom2007.pdf}
}
@inproceedings{globecom2007,
  author = {Alfredo Matos and Joao Girao and Susana Sargento and Rui L. Aguiar},
  title = {Preserving Privacy in Mobile Environments With Virtual Network Stacks},
  booktitle = {50th Annual IEEE Global Telecommunications Conference},
  year = {2007},
  address = {Washington, DC, USA},
  month = {November},
  organization = {GLOBECOM 2007},
  abstract = {
	 User privacy is a growing requirement in the evolution of
	 communication networks. In this sense, the concept of
	 virtual personae, which corresponds at different
	 identities of the same user, starts getting much attention.
	 However, to provide privacy and non-linkage between these
	 virtual users, a cross-layer approach to identity needs to
	 be supported.
	 This paper proposes a solution to preserve the application
	 layer privacy models by applying the virtual personae concept
	 throughout the network stack. It also proposes mechanisms
	 for non-correlation between identities in 4G mobile
	 environments, and addresses the benefits of the evolving
	 multi-homing characteristics of 4G networks to enrich the
	 non-linkage between identities support of our privacy solution. 
  },
  pdf = {http://www.girao.org/joao/papers/globecom2007.pdf},
  url = {http://www.ieee-globecom.org/2007/},
  cfp = {http://www.girao.org/joao/cfps/globecom2007.pdf}
}
@inproceedings{icc2007,
  author = {Julien Abeille and Rui L. Aguiar and Joao Girao and Telemaco Melia and Ignacio Soto and Patrick Stupar},
  title = {MobiSplit in a Virtualized, Multi-Device Environment},
  booktitle = {IEEE International Conference on Communications},
  year = {2007},
  address = {Glasgow, Scotland},
  month = {June},
  organization = {ICC 2007},
  abstract = {
	  This paper details a novel architecture, MobiSplit
	  [17], for managing mobility in future IP based networks. The
	  architecture separates mobility management in two levels, local
	  and global, that are managed in completely independent ways.
	  We describe how such a mobility architecture can be used to
	  support a new paradigm in mobility. By combining the user's
	  identity with a multi physical virtual terminal we treat the
	  movement of people rather than their physical manifestations
	  in one device. We conclude by analyzing the concrete system,
	  built from this new architecture and existing protocols, in
	  terms of scalability, flexibility and security.
  },
  pdf = {http://www.girao.org/joao/papers/icc2007.pdf},
  url = {http://www.ieee-icc.org/2007/},
  cfp = {http://www.girao.org/joao/cfps/icc2007.pdf}
}
@inproceedings{infocom2007,
  author = {Frederik Armknecht and Joao Girao and Alfredo Matos and Rui L. Aguiar},
  title = {Who said that? Privacy at link layer.},
  booktitle = {26th Annual IEEE Conference on Computer Communications},
  year = {2007},
  address = {Anchorage, Alaska, USA},
  month = {May},
  organization = {INFOCOM 2007},
  note = {Minisymposium},
  abstract = {
	Wireless LAN and other radio broadcast technologies are now in full swing.
	However, the widespread usage of these technologies comes at the price of
	location privacy, be it by observing the communication patterns or the
	interface identifiers. Although a number of network level solutions have
	been proposed , this paper describes a novel approach to location privacy
	at the link layer level. We present a generic mechanism and then map it to
	a real protocol, IEEE 802.11. The work also provides an analysis of the
	protocol in terms of privacy and performance considerations.
  },
  pdf = {http://www.girao.org/joao/papers/infocom2007.pdf},
  url = {http://www.comsoc.org/confs/infocom/2007/},
  cfp = {http://www.girao.org/joao/cfps/infocom2007.pdf}
}
@inproceedings{wiopt2007,
  author = {Michael Sirivianos and Dirk Westhoff and Frederik Armknecht and Joao Girao},
  title = {Non-Manipulable Aggregator Node Election Protocols for Wireless Sensor Networks},
  booktitle = {5th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks},
  year = {2007},
  address = {Limassol, Cyprus, Greece},
  month = {April},
  organization = {WiOpt 2007},
  abstract = {
	Aggregator nodes commonly have the ability to read,
	corrupt or disrupt the flow of information produced by a Wireless
	Sensor Network (WSN). Despite this fact, existing aggregator
	node election schemes do not address an adversary that strives
	to influence the election process towards candidate nodes that it
	controls. We discuss the requirements that need to be fulfilled
	by a non-manipulable aggregator node election protocol. We
	conclude that these requirements can be satisfied by a distributed
	random number generator function in which no node is able to
	determine the output of the function. We provide and compare
	three protocols that instantiate such function.
  },
  pdf = {http://www.girao.org/joao/papers/wiopt2007.pdf},
  url = {http://www.wiopt.org/},
  cfp = {http://www.girao.org/joao/cfps/wiopt2007.pdf}
}