๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


A Probabilistic Polynomial-time Calculus
โœ J. Mitchell; A. Ramanathan; A. Scedrov; V. Teague ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 294 KB

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 model for the analysis o
โœ P. Agrawal; M. A. Breuer ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 784 KB

## 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

A HYBRID FORMULATION FOR THE ANALYSIS OF
โœ E.A. Butcher; S.C. Sinha ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 239 KB

## 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