default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndre Scedrov
Andrej Scedrov
Person information
- affiliation: University of Pennsylvania
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c86]Tajana Ban Kirigin
, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott:
Time-Bounded Resilience. WRLA 2024: 22-44- [i18]Tajana Ban Kirigin, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott:
Technical Report: Time-Bounded Resilience. CoRR abs/2401.05585 (2024) - 2023
- [c85]Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov:
Explorations in Subexponential Non-associative Non-commutative Linear Logic. AMSLO@ESSLLI 2023: 4-19 - [e5]Helle Hvid Hansen, Andre Scedrov, Ruy J. G. B. de Queiroz:
Logic, Language, Information, and Computation - 29th International Workshop, WoLLIC 2023, Halifax, NS, Canada, July 11-14, 2023, Proceedings. Lecture Notes in Computer Science 13923, Springer 2023, ISBN 978-3-031-39783-7 [contents] - [i17]Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov:
Explorations in Subexponential non-associative non-commutative Linear Logic (extended version). CoRR abs/2307.03059 (2023) - 2022
- [j57]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Language models for some extensions of the Lambek calculus. Inf. Comput. 287: 104760 (2022) - [j56]Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Security and Complexity of Periodic Systems. SN Comput. Sci. 3(5): 356 (2022) - [c84]Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov:
Non-associative, Non-commutative Multi-modal Linear Logic. IJCAR 2022: 449-467 - [c83]Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems. ICTAC 2022: 96-113 - 2021
- [j55]Abraão Aires Urquiza, Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Resource and timing aspects of security protocols. J. Comput. Secur. 29(3): 299-340 (2021) - [j54]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities. J. Log. Lang. Inf. 30(1): 31-88 (2021) - [j53]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Correction to: The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities. J. Log. Lang. Inf. 30(1): 89 (2021) - [c82]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Complexity of Verification of Time-Sensitive Distributed Systems. Protocols, Strands, and Logic 2021: 251-275 - [c81]Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On Security Analysis of Periodic Systems: Expressiveness and Complexity. ICISSP 2021: 43-54 - [i16]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report. CoRR abs/2105.03531 (2021) - 2020
- [j52]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Reconciling Lambek's restriction, cut-elimination and substitution in the presence of exponential modalities. J. Log. Comput. 30(1): 239-256 (2020) - [c80]Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov:
Soft Subexponentials and Multiplexing. IJCAR (1) 2020: 500-517 - [i15]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Language Models for Some Extensions of the Lambek Calculus. CoRR abs/2008.00070 (2020) - [i14]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities. CoRR abs/2008.00075 (2020)
2010 – 2019
- 2019
- [j51]Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt:
Automated Analysis of Cryptographic Assumptions in Generic Group Models. J. Cryptol. 32(2): 324-360 (2019) - [j50]Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov:
Subexponentials in non-commutative linear logic. Math. Struct. Comput. Sci. 29(8): 1217-1249 (2019) - [c79]Musab A. AlTurki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
A Multiset Rewriting Model for Specifying and Verifying Timing Aspects of Security Protocols. Foundations of Security, Protocols, and Equational Reasoning 2019: 192-213 - [c78]Abraão Aires Urquiza, Musab A. AlTurki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Resource-Bounded Intruders in Denial of Service Attacks. CSF 2019: 382-396 - [c77]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Undecidability of a Newly Proposed Calculus for CatLog3. FG 2019: 67-83 - [c76]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
The Complexity of Multiplicative-Additive Lambek Calculus: 25 Years Later. WoLLIC 2019: 356-372 - [c75]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
L-Models and R-Models for Lambek Calculus Enriched with Additives and the Multiplicative Unit. WoLLIC 2019: 373-391 - 2018
- [c74]Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov:
A Logical Framework with Commutative and Non-commutative Subexponentials. IJCAR 2018: 228-245 - [c73]Musab A. AlTurki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of Protocols. CPS-SPC@CCS 2018: 60-71 - [c72]Glyn Morrill, Stepan L. Kuznetsov, Max I. Kanovich, Andre Scedrov:
Bracket Induction for Lambek Calculus with Bracket Modalities. FG 2018: 84-101 - [i13]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Compliance in Real Time Multiset Rewriting Models. CoRR abs/1811.04826 (2018) - 2017
- [j49]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Time, computational complexity, and probability in the analysis of distance-bounding protocols. J. Comput. Secur. 25(6): 585-630 (2017) - [j48]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic:
A rewriting framework and logic for activities subject to regulations. Math. Struct. Comput. Sci. 27(3): 332-375 (2017) - [c71]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities. FCT 2017: 326-340 - [c70]Max I. Kanovich, Stepan L. Kuznetsov, Glyn Morrill, Andre Scedrov:
A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order. FSCD 2017: 22:1-22:17 - [i12]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Time, Computational Complexity, and Probability in the Analysis of Distance-Bounding Protocols. CoRR abs/1702.03504 (2017) - [i11]Max I. Kanovich, Stepan L. Kuznetsov, Glyn Morrill, Andre Scedrov:
A polynomial time algorithm for the Lambek calculus with brackets of bounded order. CoRR abs/1705.00694 (2017) - 2016
- [j47]Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov, Benedikt Schmidt, Mehdi Tibouchi:
Strongly-optimal structure preserving signatures from Type II pairings: synthesis and lower bounds. IET Inf. Secur. 10(6): 358-371 (2016) - [c69]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Undecidability of the Lambek Calculus with a Relevant Modality. FG 2016: 240-256 - [c68]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems. FORMATS 2016: 228-244 - [c67]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
On Lambek's Restriction in the Presence of Exponential Modalities. LFCS 2016: 146-158 - [i10]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Undecidability of the Lambek calculus with a relevant modality. CoRR abs/1601.06303 (2016) - [i9]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems. CoRR abs/1606.07886 (2016) - [i8]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities. CoRR abs/1608.02254 (2016) - [i7]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Undecidability of the Lambek calculus with subexponentials and bracket modalities. CoRR abs/1608.04020 (2016) - 2015
- [c66]Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov, Benedikt Schmidt, Mehdi Tibouchi:
Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. Public Key Cryptography 2015: 355-376 - [c65]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Discrete vs. Dense Times in the Analysis of Cyber-Physical Security Protocols. POST 2015: 259-279 - [i6]Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov, Benedikt Schmidt, Mehdi Tibouchi:
Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. IACR Cryptol. ePrint Arch. 2015: 19 (2015) - 2014
- [j46]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded memory protocols. Comput. Lang. Syst. Struct. 40(3-4): 137-154 (2014) - [j45]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded memory Dolev-Yao adversaries in collaborative systems. Inf. Comput. 238: 233-261 (2014) - [j44]Lev D. Beklemishev, Ruy J. G. B. de Queiroz, Andre Scedrov:
Editors' foreword. J. Comput. Syst. Sci. 80(6): 1037 (2014) - [c64]Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt:
Automated Analysis of Cryptographic Assumptions in Generic Group Models. CRYPTO (1) 2014: 95-112 - [c63]Anduo Wang, Alexander J. T. Gurney, Xianglong Han, Jinyan Cao, Boon Thau Loo, Carolyn L. Talcott, Andre Scedrov:
A reduction-based approach towards scaling up formal analysis of internet configurations. INFOCOM 2014: 637-645 - [c62]Mário S. Alvim, Andre Scedrov, Fred B. Schneider:
When Not All Bits Are Equal: Worth-Based Information Flow. POST 2014: 120-139 - [i5]Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt:
Automated Analysis of Cryptographic Assumptions in Generic Group Models. IACR Cryptol. ePrint Arch. 2014: 458 (2014) - 2013
- [c61]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded Memory Protocols and Progressing Collaborative Systems. ESORICS 2013: 309-326 - [c60]Anduo Wang, Salar Moarref, Boon Thau Loo, Ufuk Topcu, Andre Scedrov:
Automated synthesis of reactive controllers for software-defined networks. ICNP 2013: 1-6 - 2012
- [j43]Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedrov:
Maintaining distributed logic programs incrementally. Comput. Lang. Syst. Struct. 38(2): 158-180 (2012) - [j42]Anduo Wang, Limin Jia, Wenchao Zhou, Yiqing Ren, Boon Thau Loo, Jennifer Rexford, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
FSR: formal analysis and implementation toolkit for safe interdomain routing. IEEE/ACM Trans. Netw. 20(6): 1814-1827 (2012) - [c59]Peifung E. Lam, John C. Mitchell, Andre Scedrov, Sharada Sundaram, Frank Wang:
Declarative privacy policy: finite models and attribute-based encryption. IHI 2012: 323-332 - [c58]Vivek Nigam, Tajana Ban Kirigin, Andre Scedrov, Carolyn L. Talcott, Max I. Kanovich, Ranko Perovic:
Towards an automated assistant for clinical investigations. IHI 2012: 773-778 - [c57]Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov:
Brief announcement: a calculus of policy-based routing systems. PODC 2012: 343-344 - [c56]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic:
A Rewriting Framework for Activities Subject to Regulations. RTA 2012: 305-322 - [c55]Anduo Wang, Alexander J. T. Gurney, Xianglong Han, Jinyan Cao, Carolyn L. Talcott, Boon Thau Loo, Andre Scedrov:
Reduction-based analysis of BGP systems with BGPVerif. SIGCOMM 2012: 89-90 - [c54]Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov:
Reduction-Based Formal Analysis of BGP Instances. TACAS 2012: 283-298 - 2011
- [j41]Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay:
Cryptographically sound security proofs for basic and public-key Kerberos. Int. J. Inf. Sec. 10(2): 107-134 (2011) - [j40]Max I. Kanovich, Paul D. Rowe, Andre Scedrov:
Collaborative Planning with Confidentiality. J. Autom. Reason. 46(3-4): 389-421 (2011) - [c53]Anduo Wang, Carolyn L. Talcott, Limin Jia, Boon Thau Loo, Andre Scedrov:
Analyzing BGP Instances in Maude. FMOODS/FORTE 2011: 334-348 - [c52]Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedrov:
Maintaining distributed logic programs incrementally. PPDP 2011: 125-136 - 2010
- [c51]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded Memory Dolev-Yao Adversaries in Collaborative Systems. Formal Aspects in Security and Trust 2010: 18-33 - [c50]Vivek Nigam, Limin Jia, Anduo Wang, Boon Thau Loo, Andre Scedrov:
An Operational Semantics for Network Datalog. LAM@LICS 2010: 68-81
2000 – 2009
- 2009
- [j39]Iliano Cervesato, Andre Scedrov:
Relating state-based and process-based concurrency through linear logic (full-version). Inf. Comput. 207(10): 1044-1077 (2009) - [j38]Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov:
Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage. J. Comput. Secur. 17(5): 737-797 (2009) - [c49]Max I. Kanovich, Paul D. Rowe, Andre Scedrov:
Policy Compliance in Collaborative Systems. CSF 2009: 218-233 - 2008
- [j37]Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad:
Breaking and fixing public-key Kerberos. Inf. Comput. 206(2-4): 402-424 (2008) - [j36]Michael Backes, Birgit Pfitzmann, Andre Scedrov:
Key-dependent message security under active attacks - BRSIM/UC-soundness of Dolev-Yao-style encryption with key cycles. J. Comput. Secur. 16(5): 497-530 (2008) - [c48]John C. Mitchell, Arnab Roy, Paul D. Rowe, Andre Scedrov:
Analysis of EAP-GPSK Authentication Protocol. ACNS 2008: 309-327 - [c47]Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay:
Computationally sound mechanized proofs for basic and public-key Kerberos. AsiaCCS 2008: 87-99 - 2007
- [c46]Michael Backes, Birgit Pfitzmann, Andre Scedrov:
Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles. CSF 2007: 112-124 - [c45]Max I. Kanovich, Paul D. Rowe, Andre Scedrov:
Collaborative Planning With Privacy. CSF 2007: 265-278 - [c44]Andre Scedrov:
The work of Dean Rosenzweig: a tribute to a scientist and an innovator. ESEC/SIGSOFT FSE 2007: 371-374 - [e4]Michael Backes, Andre Scedrov:
Proceedings of the International Workshop on Security and Concurrency, SecCo@CONCUR 2005, San Francisco, CA, USA, August 22, 2005. Electronic Notes in Theoretical Computer Science 180(1), Elsevier 2007 [contents] - 2006
- [j35]Rohit Chadha, Steve Kremer, Andre Scedrov:
Formal Analysis of Multiparty Contract Signing. J. Autom. Reason. 36(1-2): 39-83 (2006) - [j34]John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague:
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. Theor. Comput. Sci. 353(1-3): 118-164 (2006) - [j33]Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad:
Formal analysis of Kerberos 5. Theor. Comput. Sci. 367(1-2): 57-87 (2006) - [c43]Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad:
Breaking and Fixing Public-Key Kerberos. ASIAN 2006: 167-181 - [c42]Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay:
Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. ESORICS 2006: 362-383 - [c41]Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov:
Games and the Impossibility of Realizable Ideal Functionality. TCC 2006: 360-379 - [c40]Iliano Cervesato, Andre Scedrov:
Relating State-Based and Process-Based Concurrency through Linear Logic. WoLLIC 2006: 145-176 - [i4]Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad:
Breaking and Fixing Public-Key Kerberos. IACR Cryptol. ePrint Arch. 2006: 9 (2006) - [i3]Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay:
Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. IACR Cryptol. ePrint Arch. 2006: 219 (2006) - 2005
- [j32]Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov:
Contract signing, optimism, and advantage. J. Log. Algebraic Methods Program. 64(2): 189-218 (2005) - [c39]Pedro Adão, Gergei Bana, Andre Scedrov:
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption. CSFW 2005: 170-184 - [c38]Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov:
Soundness of Formal Encryption in the Presence of Key-Cycles. ESORICS 2005: 374-396 - [c37]Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad:
Specifying Kerberos 5 cross-realm authentication. WITS 2005: 12-26 - [c36]Michael Backes, Andre Scedrov:
Preface. SecCO@CONCUR 2005: 1-2 - [i2]Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov:
Games and the Impossibility of Realizable Ideal Functionality. IACR Cryptol. ePrint Arch. 2005: 211 (2005) - [i1]Michael Backes, Birgit Pfitzmann, Andre Scedrov:
Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles. IACR Cryptol. ePrint Arch. 2005: 421 (2005) - 2004
- [c35]Rohit Chadha, Steve Kremer, Andre Scedrov:
Formal Analysis of Multi-Party Contract Signing. CSFW 2004: 266-265 - [c34]Ajith Ramanathan, John C. Mitchell, Andre Scedrov, Vanessa Teague:
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols. FoSSaCS 2004: 468-483 - 2003
- [j31]Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov:
Preface. Theor. Comput. Sci. 294(3): 333 (2003) - [j30]Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov:
Phase semantics for light linear logic. Theor. Comput. Sci. 294(3): 525-549 (2003) - [c33]Paulo Mateus, John C. Mitchell, Andre Scedrov:
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus. CONCUR 2003: 323-345 - [c32]Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov:
Contract Signing, Optimism, and Advantage. CONCUR 2003: 361-377 - [c31]Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov:
Verifying Confidentiality and Authentication in Kerberos 5. ISSS 2003: 1-24 - [e3]Mitsuhiro Okada, Benjamin C. Pierce, Andre Scedrov, Hideyuki Tokuda, Akinori Yonezawa:
Software Security -- Theories and Systems, Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers. Lecture Notes in Computer Science 2609, Springer 2003, ISBN 3-540-00708-3 [contents] - 2002
- [c30]Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov:
A Formal Analysis of Some Properties of Kerberos 5 Using MSR. CSFW 2002: 175- - [c29]Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov:
A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis. ISSS 2002: 356-383 - 2001
- [c28]Rohit Chadha, Max I. Kanovich, Andre Scedrov:
Inductive methods and contract-signing protocols. CCS 2001: 176-185 - [c27]Andre Scedrov, Ran Canetti, Joshua D. Guttman, David A. Wagner, Michael Waidner:
Relating Cryptography and Cryptographic Protocols. CSFW 2001: 111-114 - [c26]John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague:
Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis. LICS 2001: 3-5 - [c25]John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague:
A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Preliminary Report). MFPS 2001: 280-310 - 2000
- [j29]Andre Scedrov:
A language-based security analysis. ACM SIGSOFT Softw. Eng. Notes 25(1): 80-81 (2000) - [c24]Iliano Cervesato, Nancy A. Durgin, John C. Mitchell, Patrick Lincoln, Andre Scedrov:
Relating Strands and Multiset Rewriting for Security Protocol Analysis. CSFW 2000: 35-51
1990 – 1999
- 1999
- [j28]