Sciweavers

24 search results - page 4 / 5
» Space efficient secret sharing for implicit data security
Sort
View
OOPSLA
2005
Springer
13 years 10 months ago
Lifting sequential graph algorithms for distributed-memory parallel computation
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
Douglas Gregor, Andrew Lumsdaine
SIGMOD
2007
ACM
115views Database» more  SIGMOD 2007»
14 years 5 months ago
Privacy preserving schema and data matching
In many business scenarios, record matching is performed across different data sources with the aim of identifying common information shared among these sources. However such need...
Monica Scannapieco, Ilya Figotin, Elisa Bertino, A...
CCS
2008
ACM
13 years 7 months ago
HMAC is a randomness extractor and applications to TLS
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...
Pierre-Alain Fouque, David Pointcheval, Séb...
EUROCRYPT
2006
Springer
13 years 9 months ago
Our Data, Ourselves: Privacy Via Distributed Noise Generation
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to crea...
Cynthia Dwork, Krishnaram Kenthapadi, Frank McSher...
MOBIHOC
2007
ACM
14 years 4 months ago
A random perturbation-based scheme for pairwise key establishment in sensor networks
A prerequisite for secure communications between two sensor nodes is that these nodes exclusively share a pairwise key. Although numerous pairwise key establishment (PKE) schemes ...
Wensheng Zhang, Minh Tran, Sencun Zhu, Guohong Cao