227 search results - page 11 / 46 » On the Reachability Problem in Cryptographic Protocols |
USS
2010
13 years 5 months ago
2010
In a bid to limit the harm caused by ubiquitous remotely exploitable software vulnerabilities, the computer systems security community has proposed primitives to allow execution o...
FCCM
2000
IEEE
13 years 12 months ago
2000
IEEE
Architectures that implement the Internet Protocol Security (IPSec) standard have to meet the enormous computing demands of cryptographic algorithms. In addition, IPSec architectu...
CAV
2010
Springer
13 years 10 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
TIT
2008
13 years 7 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
TCC
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...