469 search results - page 5 / 94 » Using Secret Sharing for Searching in Encrypted Data |
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Secret-key agreement between two parties Alice and Bob, connected by an insecure channel, can be realized in an informationtheoretic sense if the parties share many independent pai...
EUROPKI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Anonymous secret sharing schemes allow a secret to be recovered from shares regardless of the identity of shareholders. Besides being interesting in its own right, this p...
COMPSEC
1998
13 years 7 months ago
1998
This paper describes a data mixing method for encrypting a plaintext block using a block encryption algorithm (such as Elliptic Curve, RSA, etc.) having a block size smaller than ...
PAISI
2010
Springer
13 years 5 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...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We first propose the notion of universally anonymizable publickey encryption. Suppose that we have the encrypted data made with the same security parameter, and that the...