56 search results - page 5 / 12 » Secret Sharing Made Short |
PAISI
2010
Springer
13 years 6 months ago
2010
Springer
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...
SOUPS
2009
ACM
14 years 3 months ago
2009
ACM
Initiating and bootstrapping secure, yet low-cost, ad-hoc transactions is an important challenge that needs to be overcome if the promise of mobile and pervasive computing is to b...
PARLE
1993
14 years 1 months ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
ACNS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
ACNS
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. "Pairing" is referred to as the operation of achieving authenticated key agreement between two human-operated devices over a short- or medium-range wireless com...