Sciweavers

172 search results - page 22 / 35
» Black-Box Constructions of Protocols for Secure Computation
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Network Extractor Protocols
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerm...
ICDM
2007
IEEE
104views Data Mining» more  ICDM 2007»
14 years 2 months ago
Secure Logistic Regression of Horizontally and Vertically Partitioned Distributed Databases
Privacy-preserving data mining (PPDM) techniques aim to construct efficient data mining algorithms while maintaining privacy. Statistical disclosure limitation (SDL) techniques a...
Aleksandra B. Slavkovic, Yuval Nardi, Matthew M. T...
SCN
2010
Springer
232views Communications» more  SCN 2010»
13 years 5 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena
ICISC
2008
103views Cryptology» more  ICISC 2008»
13 years 9 months ago
Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
Ahmad-Reza Sadeghi, Thomas Schneider 0003
PPSN
2010
Springer
13 years 6 months ago
Privacy-Preserving Multi-Objective Evolutionary Algorithms
Existing privacy-preserving evolutionary algorithms are limited to specific problems securing only cost function evaluation. This lack of functionality and security prevents thei...
Daniel Funke, Florian Kerschbaum