189 search results - page 3 / 38 » On Unconditionally Secure Computation with Vanishing Communi... |
ICICS
2010
Springer
13 years 4 months ago
2010
Springer
With today's technology, many applications rely on the existence of small devices that can exchange information and form communication networks. In a significant portion of su...
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
TCC
2009
Springer
14 years 6 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
ICN
2005
Springer
13 years 11 months ago
2005
Springer
Proposed by Maurer the bounded storage model has received much academic attention in the recent years. Perhaps the main reason for this attention is that the model facilitates a un...
AINA
2005
IEEE
13 years 12 months ago
2005
IEEE
Most of existing user authentication schemes require high computation cost of exponentiation operations for the purpose of security. However, it is not suitable for mobile devices...