469 search results - page 67 / 94 » On Adversary Models and Compositional Security |
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
Building on research previously reported at AAMAS conferences, this paper describes an innovative application of a novel gametheoretic approach for a national scale security deplo...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
MOBIHOC
2005
ACM
14 years 7 months ago
2005
ACM
Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protoco...