Author of the publication

Probabilistic Polynomial-Time Equivalence and Security Analysis.

, , , and . World Congress on Formal Methods, volume 1708 of Lecture Notes in Computer Science, page 776-793. Springer, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols., , , and . FoSSaCS, volume 2987 of Lecture Notes in Computer Science, page 468-483. Springer, (2004)Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus., , and . CONCUR, volume 2761 of Lecture Notes in Computer Science, page 323-345. Springer, (2003)Bounded memory protocols., , , and . Comput. Lang. Syst. Struct., 40 (3-4): 137-154 (2014)Functorial Polymorphism., , , and . Theor. Comput. Sci., 70 (1): 35-64 (1990)Some Properties of Epistemic Set Theory with Collection.. J. Symb. Log., 51 (3): 748-754 (1986)The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities., , and . CoRR, (2020)Language Models for Some Extensions of the Lambek Calculus., , and . CoRR, (2020)Uniform Proofs as a Foundation for Logic Programming., , , and . Ann. Pure Appl. Log., 51 (1-2): 125-157 (1991)Time, computational complexity, and probability in the analysis of distance-bounding protocols., , , , and . J. Comput. Secur., 25 (6): 585-630 (2017)Notes on Sconing and Relators., and . CSL, volume 702 of Lecture Notes in Computer Science, page 352-378. Springer, (1992)