Sciweavers

469 search results - page 5 / 94
» On Adversary Models and Compositional Security
Sort
View
CCS
2011
ACM
12 years 7 months ago
Trust-based anonymous communication: adversary models and routing algorithms
We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on ano...
Aaron Johnson, Paul F. Syverson, Roger Dingledine,...
CRYPTO
2004
Springer
138views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Secure Identity Based Encryption Without Random Oracles
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model. Selective identity secure IBE is a slightly w...
Dan Boneh, Xavier Boyen
SAC
2009
ACM
14 years 8 days ago
A taxonomy and adversarial model for attacks against network log anonymization
In recent years, it has become important for researchers, security incident responders and educators to share network logs, and many log anonymization tools and techniques have be...
Justin King, Kiran Lakkaraju, Adam J. Slagell
CCS
2009
ACM
14 years 8 months ago
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...
Kannan Srinathan, Arpita Patra, Ashish Choudhary, ...
EUROCRYPT
2008
Springer
13 years 9 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith