Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values.

Published in: AINA Workshops (1) (2007)

Keyphrases

lightweight
distributed systems
group communication
cooperative
computational complexity
np complete
multi party
distributed environment
multi agent
tcp ip
polynomial size
arithmetic operations
security protocols
space complexity
decision problems
attribute values
mobile agents