We describe properties of a process calculus that has been developed for the purpose of analyzing security protocols. The process calculus is a restricted form of ฯ-calculus, with bounded replication and probabilistic polynomial-time expressions allowed in messages and boolean tests. In order to avo
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
โ Scribed by John C. Mitchell; Ajith Ramanathan; Andre Scedrov; Vanessa Teague
- Book ID
- 108281145
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 528 KB
- Volume
- 353
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract A probabilistic model is developed for studying the problem of routing printed circuits. The model, which uses the density of blockages on the carrier as a parameter, is based on the pathโsearching mechanism of Lee's algorithm. Lee's algorithm is used in our analysis because it belongs
## 1. ๏ฉ๏ฎ๏ด๏ฒ๏ฏ๏ค๏ต๏ฃ๏ด๏ฉ๏ฏ๏ฎ Recently several studies (see e.g. references [1,2]) have been reported in which the solutions of both constant and time-varying systems are expressed in terms of Chebyshev polynomials. The first applications of orthogonal polynomials to differential equations with periodic coeff