227 search results - page 13 / 46 » On the Reachability Problem in Cryptographic Protocols |
RTA
2005
Springer
14 years 29 days ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
ICISC
2000
13 years 8 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
FC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information ...
FCS
2006
13 years 9 months ago
2006
By far the most important automated tool for network and communications security is encryption, but encryption itself needs security. As we know, many cryptosystems and cryptograp...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...