Sciweavers

179 search results - page 25 / 36
» Adversarial Leakage in Games
Sort
View
ACNS
2010
Springer
132views Cryptology» more  ACNS 2010»
14 years 1 months ago
Efficient Implementation of the Orlandi Protocol
Abstract. We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty computation on arithmetic circuits, which is...
Thomas P. Jakobsen, Marc X. Makkes, Janus Dam Niel...
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
14 years 3 months ago
A Computationally Sound Mechanized Prover for Security Protocols
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
Bruno Blanchet
INFOCOM
2005
IEEE
14 years 3 months ago
Designing incentives for peer-to-peer routing
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
Alberto Blanc, Yi-Kai Liu, Amin Vahdat
AAAI
1996
13 years 11 months ago
Exploiting Graph Properties of Game Trees
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de...
AINA
2007
IEEE
14 years 4 months ago
QoS-LI: QoS Loss Inference in Disadvantaged Networks
— Quality of Service (QoS) of disadvantaged networks is usually considered from a purely network standpoint in existing works. Adversarial intervention in such networks is not an...
Vidyaraman Sankaranarayanan, Shambhu J. Upadhyaya,...