Sciweavers

81 search results - page 13 / 17
» 06401 Abstracts Collection - Complexity of Constraints
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Privacy-Preserving Protocols for Eigenvector Computation
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
Manas A. Pathak, Bhiksha Raj
TIT
2008
73views more  TIT 2008»
13 years 7 months ago
Detection of Information Flows
Abstract-- Distributed detection of information flows by timing analysis is considered. Timing measurements are subject to perturbations and the insertion of chaff noise. Moreover,...
Ting He, Lang Tong
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 7 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
INFOCOM
2009
IEEE
14 years 2 months ago
A Queueing Model Framework of PCE-Based Inter-Area Path Computation
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
FC
2009
Springer
150views Cryptology» more  FC 2009»
14 years 2 months ago
Privacy-Preserving Information Markets for Computing Statistical Data
Abstract. Consider an “information market” where private and potentially sensitive data are collected, treated as commodity and processed into aggregated information with comme...
Aggelos Kiayias, Bülent Yener, Moti Yung