Sciweavers

978 search results - page 33 / 196
» Knowledge, Probability, and Adversaries
Sort
View
JCS
2008
93views more  JCS 2008»
14 years 9 months ago
On the Bayes risk in information-hiding protocols
Randomized protocols for hiding private information can be regarded as noisy channels in the information-theoretic sense, and the inference of the concealed information can be reg...
Konstantinos Chatzikokolakis, Catuscia Palamidessi...
ICNP
2009
IEEE
14 years 7 months ago
Memory Efficient Protocols for Detecting Node Replication Attacks in Wireless Sensor Networks
Sensor networks deployed in hostile areas are subject to node replication attacks, in which an adversary compromises a few sensors, extracts the security keys, and clones them in a...
Ming Zhang, Vishal Khanapure, Shigang Chen, Xuelia...
ISW
2007
Springer
15 years 3 months ago
Strongly-Secure Identity-Based Key Agreement and Anonymous Extension
Abstract. We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in the random oracle mod...
Sherman S. M. Chow, Kim-Kwang Raymond Choo
SACRYPT
2004
Springer
105views Cryptology» more  SACRYPT 2004»
15 years 3 months ago
Provably Secure Masking of AES
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
Johannes Blömer, Jorge Guajardo, Volker Krumm...
AAAI
2000
14 years 11 months ago
Defining and Using Ideal Teammate and Opponent Agent Models
A common challenge for agents in multiagent systems is trying to predict what other agents are going to do in the future. Such knowledge can help an agent determine which of its c...
Peter Stone, Patrick Riley, Manuela M. Veloso