Conference Proceeding

# Privacy Management for Context Transponders.

01/2007; DOI:10.1109/SAINT-W.2007.86 In proceeding of: 2007 International Symposium on Applications and the Internet - Workshops (SAINT 2007 Workshops), 15-19 January 2007, Hiroshima, Japan
Source: DBLP

ABSTRACT While by now feasible solutions to protect privacy for complex ubiquitous applications are available, very small devices, called context transponders (CTP) still lack re- sources to run sophisticated full scale approaches like DRM and strong encryption. These devices however, will play an important role in the success of ubiquitous computing as they support the idea of pervasiveness (small, mobile etc.). We propose a set of techniques outlined as the CTP- classmark that aims to introduce data avoidance and ob- fuscation strategies to enable information security in con - text aware applications. Using this classmark, the users' privacy can be protected even on low resource devices and hence the users' trust in ubicomp applications will rise.

0 0
·
0 Bookmarks
·
47 Views
• Source
##### Conference Proceeding: Similarity estimation techniques from rounding algorithms.
[hide abstract]
ABSTRACT: (MATH) A locality sensitive hashing scheme is a distribution on a family $\F$ of hash functions operating on a collection of objects, such that for two objects x,y, PrhεF[h(x) = h(y)] = sim(x,y), where sim(x,y) ε [0,1] is some similarity function defined on the collection of objects. Such a scheme leads to a compact representation of objects so that similarity of objects can be estimated from their compact sketches, and also leads to efficient algorithms for approximate nearest neighbor search and clustering. Min-wise independent permutations provide an elegant construction of such a locality sensitive hashing scheme for a collection of subsets with the set similarity measure sim(A,B) = \frac{|A &Pgr; B|}{|A &Pgr B|}.(MATH) We show that rounding algorithms for LPs and SDPs used in the context of approximation algorithms can be viewed as locality sensitive hashing schemes for several interesting collections of objects. Based on this insight, we construct new locality sensitive hashing schemes for:A collection of vectors with the distance between → \over u and → \over v measured by Ø(→ \over u, → \over v)/π, where Ø(→ \over u, → \over v) is the angle between → \over u) and → \over v). This yields a sketching scheme for estimating the cosine similarity measure between two vectors, as well as a simple alternative to minwise independent permutations for estimating set similarity.A collection of distributions on n points in a metric space, with distance between distributions measured by the Earth Mover Distance (EMD), (a popular distance measure in graphics and vision). Our hash functions map distributions to points in the metric space such that, for distributions P and Q, EMD(P,Q) &xie; Ehε\F [d(h(P),h(Q))] &xie; O(log n log log n). EMD(P, Q)..
Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada; 01/2002
• Source
##### Conference Proceeding: Dynamic classmarks for SDR equipment
[hide abstract]
ABSTRACT: The paper describes a dynamic classmark scheme based on a finite number of stages during a radio connection procedure for reconfigurable terminals in future multiple radio access technology environments. Based on the user profile, terminal profile and service profile that the user applies, features are clustered into different sets called classmarks. The classmarks are designed in a stage-based manner in order to realize the method of dynamically creating and triggering them. During the reconfiguration, radio link establishment and communication processes, the number of stages is adaptive to the access frequency and priorities of the necessary features required by the network. Thanks to this approach, the signaling burden is highly reduced in the radio network. Therefore, the efficiency of radio resource management is improved.
Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on; 10/2002
• Source
##### Article: An engineering approach to adaptation and calibration
[hide abstract]
ABSTRACT: A new computing era after Mainframes, PC's and mobiles is becoming more and more anticipated since the beginning of the 21st century. This new era is often described with several confusing terms such as pervasive, ubiquitous, ambient or context-aware computing. However, there is a common characteristic behind all these projections: They are all based on a substantially more flexible system understanding, whereby the thought of the system as a tool moves into the background and the needs and wishes of the user step into the foreground. Such concepts for software applications being aware of their context are in fact not new, but become more and more important nowadays for productive fields of software and systems engineering and particularly in ubiquitous and wearable computing.