335 search results - page 50 / 67 » Reasoning about Probabilistic Security Using Task-PIOAs |
148
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
165
click to vote
OOPSLA
2007
Springer
15 years 12 months ago
2007
Springer
Objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and i...
149
click to vote
ASIAN
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
248
click to vote
AICT
2009
IEEE
16 years 20 days ago
2009
IEEE
Unlike other wireless technologies, the deployment of 802.11 networks is not limited to operators: access points can easily be installed by end-users for domestic use. This singul...
144
click to vote
CALCO
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions an...