1369 search results - page 98 / 274 » Lattice computations for random numbers |
EUROCRYPT
2007
Springer
14 years 27 days ago
2007
Springer
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...
CEC
2009
IEEE
14 years 1 months ago
2009
IEEE
— The protein structure prediction (PSP) problem is one of the most important problems in computational biology. This paper proposes a novel Estimation of Distribution Algorithms...
SAC
2002
ACM
13 years 8 months ago
2002
ACM
We investigate the universal characteristics of the simulated time horizon of the basic conservative parallel algorithm when implemented on regular lattices. This technique [1, 2]...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We consider the problems of Byzantine Agreement and Leader Election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary. The first problem...
EUROCRYPT
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...