521 search results - page 73 / 105 » Scalable Secure Multiparty Computation |
EUROCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
IANDC
2007
13 years 7 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
IEEEARES
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper, we address the security of routing protocols. Internet routing protocols are subject to attacks in the control plane as well as the data plane. In the control pla...
CCR
2006
13 years 8 months ago
2006
The rapid growth of the Internet over the last decade has been startling. However, efforts to track its growth have often fallen afoul of bad data -- for instance, how much traffi...