83 search results - page 14 / 17 » Security Evaluation of Asynchronous Circuits |
CRYPTO
2001
Springer
13 years 12 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
USS
2004
13 years 8 months ago
2004
We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding per...
ASIACRYPT
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
CODES
2005
IEEE
14 years 29 days ago
2005
IEEE
In this paper, we present the analysis, design and implementation of an estimator to realize large bit width unsigned integer multiplier units. Larger multiplier units are require...