62 search results - page 4 / 13 » Non-Local Box Complexity and Secure Function Evaluation |
IEEEARES
2007
IEEE
14 years 14 days ago
2007
IEEE
In [7] we have proposed a model for the robust and private evaluation of a function within a group of cooperating mobile agents, called an agent Alliance. The model has been given...
CCS
2007
ACM
14 years 10 days ago
2007
ACM
An alarming trend in malware attacks is that they are armed with stealthy techniques to detect, evade, and subvert malware detection facilities of the victim. On the defensive sid...
FSE
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
CRYPTO
2008
Springer
13 years 8 months ago
2008
Springer
In this article, we analyze the security of the GOST hash function. The GOST hash function, defined in the Russian standard GOST 34.11-94, is an iterated hash function producing a ...
IACR
2011
12 years 5 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...