Sciweavers

225 search results - page 31 / 45
» Nonperfect Secret Sharing Schemes
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...
CCS
2006
ACM
13 years 11 months ago
An efficient key establishment scheme for secure aggregating sensor networks
Key establishment is a fundamental prerequisite for secure communication in wireless sensor networks. A new node joining the network needs to efficiently and autonomously set up s...
Erik-Oliver Blaß, Martina Zitterbart
ET
2010
89views more  ET 2010»
13 years 6 months ago
On the Duality of Probing and Fault Attacks
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
Berndt M. Gammel, Stefan Mangard
ACISP
1999
Springer
13 years 11 months ago
Changing Thresholds in the Absence of Secure Channels
The ways the threshold parameter can be modified after the setup of a secret sharing scheme is the main theme of this work. The considerations are limited to the case when there ...
Keith M. Martin, Josef Pieprzyk, Reihaneh Safavi-N...
TDSC
2008
121views more  TDSC 2008»
13 years 7 months ago
Multipath Key Establishment for Wireless Sensor Networks Using Just-Enough Redundancy Transmission
In random key predistribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from a large key pool and are loaded on the sensors pri...
Jing Deng, Yunghsiang S. Han