Sciweavers

976 search results - page 69 / 196
» Evaluating Adversarial Partitions
Sort
View
INFOCOM
2005
IEEE
14 years 2 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
ISW
2004
Springer
14 years 2 months ago
The Obfuscation Executive
Abstract. Code obfuscations are semantics-preserving code transformations used to protect a program from reverse engineering. There is generally no expectation of complete, long-te...
Kelly Heffner, Christian S. Collberg
TRUST
2010
Springer
14 years 2 months ago
SBAP: Software-Based Attestation for Peripherals
Abstract. Recent research demonstrates that adversaries can inject malicious code into a peripheral’s firmware during a firmware update, which can result in password leakage or...
Yanlin Li, Jonathan M. McCune, Adrian Perrig
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
PKC
2010
Springer
118views Cryptology» more  PKC 2010»
13 years 11 months ago
Text Search Protocols with Simulation Based Security
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen