Sciweavers

135 search results - page 3 / 27
» Secure Computation of the Mean and Related Statistics
Sort
View
CRYPTO
2001
Springer
144views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
Yehuda Lindell
ACL
1993
13 years 10 months ago
Towards the Automatic Identification of Adjectival Scales: Clustering Adjectives According to Meaning
In this paper we present a method to group adjectives according to their meaning, as a first step towards the automatic identification of adjectival scales. We discuss the propert...
Vasileios Hatzivassiloglou, Kathleen McKeown
BMCBI
2008
176views more  BMCBI 2008»
13 years 8 months ago
H2r: Identification of evolutionary important residues by means of an entropy based analysis of multiple sequence alignments
Background: A multiple sequence alignment (MSA) generated for a protein can be used to characterise residues by means of a statistical analysis of single columns. In addition to t...
Rainer Merkl, Matthias Zwick
SASN
2004
ACM
14 years 2 months ago
Resilient aggregation in sensor networks
This paper studies security for data aggregation in sensor networks. Current aggregation schemes were designed without security in mind and there are easy attacks against them. We...
David Wagner
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 9 months ago
Differential privacy and robust statistics
We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradig...
Cynthia Dwork, Jing Lei