95 search results - page 2 / 19 » Fast Multiparty Multiplications from shared bits |
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
Integer division on modern processors is expensive compared to multiplication. Previous algorithms for performing unsigned division by an invariant divisor, via reciprocal approxi...
TMC
2010
13 years 3 months ago
2010
—Secret keys can be generated and shared between two wireless nodes by measuring and encoding radio channel characteristics without ever revealing the secret key to an eavesdropp...
ASIACRYPT
2008
Springer
13 years 6 months ago
2008
Springer
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
CRYPTO
2012
Springer
11 years 7 months ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
EUROCRYPT
2007
Springer
13 years 11 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 ...