Sciweavers

1390 search results - page 126 / 278
» Computing the depth of a flat
Sort
View
EUROCRYPT
2007
Springer
15 years 1 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
SIGUCCS
2000
ACM
15 years 1 months ago
From VTs to iMacs: Moving Public Computing Access into the 21st Century
In a Collegiate setting, technology must be functional, effective, and highly visible. In the fall of 1999 the CIS department at Bowdoin College saw the need for a greater number ...
Robert Denton, Patrick Jensen
TEC
2010
173views more  TEC 2010»
14 years 4 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
15 years 10 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
15 years 3 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna