95 search results - page 6 / 19 » Fast Multiparty Multiplications from shared bits |
180
click to vote
IWMM
1998
Springer
15 years 10 months ago
1998
Springer
Stoye's one-bit reference tagging scheme can be extended to local counts of two or more via two strategies. The first, suited to pure register transactions, is a cache of ref...
189
click to vote
FOCS
2006
IEEE
16 years 11 days ago
2006
IEEE
There is a vast body of work on implementing anonymous communication. In this paper, we study the possibility of using anonymous communication as a building block, and show that o...
143
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper discusses a novel and effective technique for extracting multiple ellipses from an image, using a Multi-Population Genetic Algorithm (MPGA). MPGA evolves a number of su...
144
click to vote
GLOBECOM
2007
IEEE
16 years 20 days ago
2007
IEEE
—BitTorrent is the most popular peer-to-peer software for file sharing, which has contributed to a significant portion of today’s Internet traffic. Many measurement studies ...
198
click to vote
ASAP
2004
IEEE
15 years 10 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...