Skip to main content

3.4 Reconciling Privacy and Security in Pervasive Computing (The Case for Pseudonymous Group Membership)

Ian Wakeman, University of Sussex
Dan Chalmers, University of Sussex
Michael Fry, University of Sydney


Abstract:
In this paper, we outline an approach to the identification of entities for access control that is based on the membership of groups, rather than individuals. By using group membership as a level of indirection between the individual and the system, we can increase privacy and provide incentives for better behaviour. Privacy comes from the use of pseudonyms generated within the group and which can be authenticated as belonging to the group. The incentives for better behaviour come from the continuous nature of groups - members may come and go, but the group lives on, and groups are organised so as to ensure group-longevity, and prevent actions which may harm the group’s reputation. We present a novel pseudonym generation mechanism suitable for use in groups without a centralised administration. Finally, we argue that the use of group membership as the basis for formulating policies on interaction is more efficient for disconnected operation, facilitating proxies and the efficient storage of revoked membership and distrusted organisations within bloom filters for small memory footprints.

ACM Copyright Notice Copyright © by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Comments

Popular posts from this blog

Best Paper

Update: Sorry about that -- didn't realize this got posted initially with no content. As Steve pointed out in comments, the votes were close. After tallying the online voting with in-attendance votes (from those who didn't make the online poll before it closed), Todor made a strong comeback but Ian Wakeman et. al. finally triumphed with a 9-7 edge. Congratulations to them, and we look forward to seeing you all again next year.

Posting abstracts for papers ..

The workshop is just over ten days away. In preparation for the discussions, and also to get the attendees more conversant with the researchers and papers to be presented, we will be posting the abstracts for accepted papers (one per blog item) over the next few days. If you are the author of a paper, and want to add links in to related research or a personal website for more information, please feel free to do so. For convenience, the blog posting will be prefixed with a number of the form S.P, where S is the session number (1, 2 or 3) and P is the paper number within that session. Each session will conclude with a panel focussed on discussion around the papers presented. In that context, if you have specific questions for authors, or have comments on the topic -- feel free to post them against the relevant blog items.. Update: I'm just waiting on some clarifications from ACM before I release the abstracts... do check back. Update: ACM granted us permissions -- the abstracts will...

2.2 A Probabilistic Reasoning Framework for Smart Homes

Todor Dimitrov, Fraunhofer IMS Josef Pauli, Universität Duisburg-Essen Edwin Naroska , Fraunhofer IMS Abstract: Inference and reasoning in modern AmI (Ambient Intelligence) middlewares is still a complex task. Currently no common patterns for building smart applications can be identified. This paper presents an ongoing effort to build a generic probabilistic reasoning framework for the networked homes. The framework can be utilized for designing smart agents in a systematic and unified way. The developed modeling and reasoning algorithms make an extensive use of the information about the user and the way he/she interacts with the system. To achieve this, several levels of knowledge representation are combined. Each level enriches the domain knowledge in a way that a consistent, user-adaptable probabilistic knowledge base is constructed. The facts in the knowledge base can be used to encode the logic for a specific application scenario. ACM Copyright Notice Copyright © by the Associat...