Sciweavers

225 search results - page 26 / 45
» Weakly-Private Secret Sharing Schemes
Sort
View
IJNSEC
2008
140views more  IJNSEC 2008»
13 years 7 months ago
A Secure Group Key Management Scheme for Wireless Cellular Systems
In wireless networks, secure multicast protocols are more difficult to implement efficiently due to the dynamic nature of the multicast group and the scarcity of bandwidth at the ...
Hwa Young Um, Edward J. Delp
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
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
14 years 6 hour ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr