- Soundness of Formal Encryption in the Presence of Pedro Adao 1? , Gergei Bana 2?? , Jonathan Herzog 3 , and Andre Scedrov 2? ? ?
- Maintaining Distributed Recursive Views Incrementally Vivek Nigam
- Specifying Kerberos 5 Cross-Realm Authentication I. Cervesato, A.D. Jaggard
- Probabilistic PolynomialTime Equivalence and Security Analysis
- An Operational Semantics for Network Datalog Vivek Nigam1, Limin Jia2, Anduo Wang1, Boon Thau Loo1, Andre Scedrov1
- Policy Compliance in Collaborative Systems Max Kanovich
- Optimization Complexity of Linear Logic Proof Games Patrick D. Lincoln \Lambda John C. Mitchell y Andre Scedrov z
- A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
- Specifying RealTime FiniteState Systems in Linear Logic Max I. Kanovich \Lambda Mitsuhiro Okada y Andre Scedrov z
- Noname manuscript No. (will be inserted by the editor)
- Collaborative Planning With Confidentiality Max Kanovich
- Soundness and Completeness of Formal Encryption: the Cases of Key Cycles and Partial Information Leakage
- A Formal Analysis of Some Properties of Kerberos 5 Using MSR University of Pennsylvania Department of Computer & Information Science Technical Report MSCIS0404
- Inductive Methods and ContractSigning Protocols R. Chadha M. Kanovich A. Scedrov
- A Formal Analysis of Some Properties of Kerberos 5 Using MSR Frederick Butler+ Iliano Cervesato# Aaron D. Jaggard+ Andre Scedrov+
- A probabilistic polynomial-time calculus for analysis of cryptographic protocols
- A Formal Analysis of Some Properties of Kerberos 5 Using MSR Frederick Butler Iliano Cervesato Aaron D. Jaggard Andre Scedrov
- Breaking and Fixing Public-Key Kerberos I. Cervesato1
- Contract Signing, Optimism, and Advantage ? Rohit Chadha a John C. Mitchell b Andre Scedrov c
- Undecidability of bounded security protocols \Lambda N.A. Durgin P.D. Lincoln J.C. Mitchell A. Scedrov
- A probabilistic polytime framework for protocol analysis P. Lincoln \Lambday
- A PROBABILISTIC POLYNOMIALTIME PROCESS CALCULUS FOR THE ANALYSIS OF CRYPTOGRAPHIC PROTOCOLS
- A Formal Analysis of Some Properties of Kerberos 5 Using MSR University of Pennsylvania Department of Computer & Information Science Technical Report MS-CIS-04-04
- Formal analysis of multiparty contract signing Rohit Chadha (rchadha@sussex.ac.uk) #
- Bounded memory Dolev-Yao adversaries in collaborative systems
- Relating Strands and Multiset Rewriting for Security Protocol Analysis Revised Extended Abstract y
- Formal analysis of multiparty contract signing Rohit Chadha 1# , Steve Kremer 2## , and Andre Scedrov 3# # #
- Formal analysis of multi-party contract signing Rohit Chadha1
- Collaborative Planning With Privacy Max Kanovich
- Bounded memory Dolev-Yao adversaries in collaborative systems
- Progressing Collaborative Systems Max Kanovich1
- Phase Semantics for Light Linear Logic Max I. Kanovich \Lambda Mitsuhiro Okada y Andre Scedrov z
- Formal analysis of multi-party contract signing Rohit Chadha (rchadha@sussex.ac.uk)
- Interpreting Strands in Linear Logic \Lambday I. Cervesato
- Computational and InformationTheoretic Soundness and Completeness of Formal Encryption
