35 search results - page 4 / 7 » Partial Order Reduction for Branching Security Protocols |
CONEXT
2007
ACM
13 years 11 months ago
2007
ACM
Despite the pressing need to secure routing, none of the existing secure variants of BGP has been widely deployed. Due to the size and decentralized nature of the Internet, it bec...
SIAMCOMP
2011
13 years 2 months ago
2011
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
PSTV
1992
13 years 8 months ago
1992
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...
FC
2007
Springer
14 years 1 months ago
2007
Springer
While transparency in financial markets should enhance liquidity, its exploitation by unethical and parasitic traders discourages others from fully embracing disclosure of their o...
ENTCS
2006
13 years 7 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...