Sciweavers

604 search results - page 30 / 121
» Efficient Computation of Multiplicative Inverses for Cryptog...
Sort
View
PAISI
2010
Springer
13 years 5 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
CHI
2001
ACM
14 years 8 months ago
Partitioning digital worlds: focal and peripheral awareness in multiple monitor use
Software today does not help us partition our digital worlds effectively. We must organize them ourselves. This field study of users of multiple monitors examines how people with ...
Jonathan Grudin
TISSEC
2008
235views more  TISSEC 2008»
13 years 7 months ago
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
ICISC
2009
184views Cryptology» more  ICISC 2009»
13 years 5 months ago
Efficient Privacy-Preserving Face Recognition
Abstract. Automatic recognition of human faces is becoming increasingly popular in civilian and law enforcement applications that require reliable recognition of humans. However, t...
Ahmad-Reza Sadeghi, Thomas Schneider 0003, Immo We...
PKC
2009
Springer
140views Cryptology» more  PKC 2009»
14 years 8 months ago
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Abstract. The success of electronic authentication systems, be it eID card systems or Internet authentication systems such as CardSpace, highly depends on the provided level of use...
Jan Camenisch, Markulf Kohlweiss, Claudio Soriente