Sciweavers

977 search results - page 10 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
CIE
2007
Springer
13 years 11 months ago
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves ...
CRYPTO
2011
Springer
207views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Secure Computation on the Web: Computing without Simultaneous Interaction
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
Shai Halevi, Yehuda Lindell, Benny Pinkas
EUROCRYPT
2007
Springer
13 years 11 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
EUROCRYPT
2004
Springer
14 years 1 months ago
Multi-party Computation with Hybrid Security
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
Matthias Fitzi, Thomas Holenstein, Jürg Wulls...
PAKDD
2010
ACM
182views Data Mining» more  PAKDD 2010»
13 years 11 months ago
Computation of Ratios of Secure Summations in Multi-party Privacy-Preserving Latent Dirichlet Allocation
In this paper, we focus our attention on the problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties...
Bin Yang, Hiroshi Nakagawa