Travelled to:
1 × Denmark
1 × France
1 × Poland
1 × United Kingdom
3 × USA
Collaborated with:
∅ P.Narendran S.Escobar J.Meseguer D.Kapur S.Erbatur C.Lynch R.Sasse F.Yang A.M.Marshall C.Ringeissen Z.Liu S.Santiago
Talks about:
protocol (5) analysi (5) unif (5) cryptograph (4) homomorph (2) asymmetr (2) encrypt (2) theori (2) formal (2) use (2)
Person: Catherine Meadows
DBLP: Meadows:Catherine
Contributed to:
Wrote 7 papers:
- FoSSaCS-2014-ErbaturKMMNR #on the #problem #symmetry #unification
- On Asymmetric Unification and the Combination Problem in Disjoint Theories (SE, DK, AMM, CM, PN, CR), pp. 274–288.
- PPDP-2014-YangEMMN #encryption #finite #unification
- Theories of Homomorphic Encryption, Unification, and the Finite Variant Property (FY, SE, CM, JM, PN), pp. 123–133.
- CADE-2013-ErbaturEKLLMMNSS #analysis #encryption #paradigm #protocol #symmetry #unification
- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis (SE, SE, DK, ZL, CL, CM, JM, PN, SS, RS), pp. 231–248.
- PPDP-2011-EscobarKLMMNS #analysis #encryption #protocol #unification #using
- Protocol analysis in Maude-NPA using unification modulo homomorphic encryption (SE, DK, CL, CM, JM, PN, RS), pp. 65–76.
- ESOP-2003-Meadows #analysis #encryption #evolution #protocol #requirements #specification #what
- What Makes a Cryptographic Protocol Secure? The Evolution of Requirements Specification in Formal Cryptographic Protocol Analysis (CM), pp. 10–21.
- PADL-2002-Meadows #analysis #declarative #using
- Using a Declarative Language to Build an Experimental Analysis Tool (CM), pp. 1–2.
- CAV-2000-Meadows #analysis #encryption #formal method #protocol
- Invited Address: Applying Formal Methods to Cryptographic Protocol Analysis (CM), p. 2.