Sciweavers

40 search results - page 5 / 8
» Secure and private sequence comparisons
Sort
View
DAWAK
2005
Springer
14 years 1 months ago
FMC: An Approach for Privacy Preserving OLAP
To preserve private information while providing thorough analysis is one of the significant issues in OLAP systems. One of the challenges in it is to prevent inferring the sensitiv...
Ming Hua, Shouzhi Zhang, Wei Wang 0009, Haofeng Zh...
KDD
1998
ACM
181views Data Mining» more  KDD 1998»
13 years 12 months ago
Approaches to Online Learning and Concept Drift for User Identification in Computer Security
The task in the computer security domain of anomaly detection is to characterize the behaviors of a computer user (the `valid', or `normal' user) so that unusual occurre...
Terran Lane, Carla E. Brodley
ICMCS
2010
IEEE
146views Multimedia» more  ICMCS 2010»
13 years 8 months ago
Privacy-preserving approximation of L1 distance for multimedia applications
Alice and Bob possess sequences x and y respectively and would like to compute the 1 distance, namely x - y 1 under privacy and communication constraints. The privacy constraint r...
Shantanu Rane, Wei Sun, Anthony Vetro
ESAS
2007
Springer
14 years 1 months ago
Authenticating DSR Using a Novel Multisignature Scheme Based on Cubic LFSR Sequences
The problem of secure routing in mobile ad hoc networks is long-standing and has been extensively studied by researchers. Recently, techniques of aggregating signatures have been a...
Saikat Chakrabarti 0002, Santosh Chandrasekhar, Mu...
ICIP
2009
IEEE
14 years 8 months ago
Secure Distortion Computation Among Untrusting Parties Using Homomorphic Encryption
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn , yn ) where d(., .) is a distortion measure. However, Alice and Bob do not trust each other ...