95 search results - page 3 / 19 » Fast Multiparty Multiplications from shared bits |
ESAS
2007
Springer
14 years 1 months ago
2007
Springer
Secure communication over wireless channels necessitates authentication of communication partners to prevent man-in-the-middle attacks. For spontaneous interaction between independ...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Abstract—Fast multiplication can be achieved by using canonical signed digit (CSD) to speed-up computations. Conversion to CSD is needed when the multiplier is not known a priori...
IACR
2011
12 years 9 months ago
2011
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
MSS
1999
IEEE
14 years 1 months ago
1999
IEEE
In computer systems today, speed and responsiveness is often determined by network and storage subsystem performance. Faster, more scalable networking interfaces like Fibre Channe...
NETWORKING
2007
13 years 11 months ago
2007
Abstract. Peer-to-peer (P2P) file sharing systems have become ubiquitous and at present the BitTorrent (BT) based P2P systems are very popular and successful. It has been argued t...