Dr. Henning Schnoor

Dr. Henning Schnoor

Funktion function Wissenschaftlicher Mitarbeiter
Telefon phone +49 (0)431 880 7508
Fax +49 (0)431 880 7614
E-Mail schnoor@ti.informatik.uni-kiel.de
PGP/GPG Key 6600:95AF:6553:CD5B:5DE6:3534:834F:3857:5979:E4C0
Dienstzimmer office CAP4, 1017
Sprechzeiten office hours nach Absprache

Research Interests

  • Cryptographic Protocols
  • Complexity Theory
  • Complexity of Satisfiability Problems
  • Modal Logic

Teaching

Publications

2009

[AllenderBaulandImmermanSchnoorVollmer-CSP-JCSS-2009 | .bib]

E. Allender, M. Bauland, N. Immerman, H. Schnoor, and H. Vollmer, "The complexity of satisfiability problems: Refining Schaefer’s Theorem," Journal of Computer and System Sciences, vol. 75, iss. 4, pp. 245-254, 2009.

@article{AllenderBaulandImmermanSchnoorVollmer-CSP-JCSS-2009,
  author = {Eric Allender and Michael Bauland and Neil Immerman and Henning Schnoor and Heribert Vollmer},
  title = {The complexity of satisfiability problems: Refining {S}chaefer's {T}heorem},
  journal = {Journal of Computer and System Sciences},
  volume = {75},
  number = {4},
  year = {2009},
  pages = {245-254},
  ee = {http://dx.doi.org/10.1016/j.jcss.2008.11.001},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

[BaulandMundhenkSchneiderSchnoorSchnoorVollmer-LTLMC-ENTCS-2009 | .bib]

M. Bauland, M. Mundhenk, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer, "The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments," Electronic Notes in Theoretical Computer Science, vol. 231, pp. 277-292, 2009.

@article{BaulandMundhenkSchneiderSchnoorSchnoorVollmer-LTLMC-ENTCS-2009,
  author = {Michael Bauland and Martin Mundhenk and Thomas Schneider and Henning Schnoor and Ilka Schnoor and Heribert Vollmer},
  title = {The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments},
  journal = {Electronic Notes in Theoretical Computer Science},
  volume = {231},
  pages = {277--292},
  year = {2009},
  note = {Proceedings of the 5th Workshop on Methods for Modalities (M4M5 2007)},
  issn = {1571-0661},
  doi = {DOI: 10.1016/j.entcs.2009.02.041}
}

[BaulandSchneiderSchnoorSchnoorVollmer-LTLSAT-LMCS-2009 | .bib]

M. Bauland, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer, "The Complexity of Generalized Satisfiability for Linear Temporal Logic," Logical Methods in Computer Science, vol. 5, iss. 1, pp. 1-21, 2009.

@Article{BaulandSchneiderSchnoorSchnoorVollmer-LTLSAT-LMCS-2009,
  author = {Michael Bauland and Thomas Schneider and Henning Schnoor and Ilka Schnoor and Heribert Vollmer},
  title = {The Complexity of Generalized Satisfiability for Linear Temporal Logic},
  journal = {Logical Methods in Computer Science},
  year = {2009},
  volume = {5},
  number = {1},
  pages = {1-21}
}

[AizatulinSchnoorWilke-ProbCSP-ESORICS-TOAPPEAR-2009 | .bib]

M. Aizatulin, H. Schnoor, and T. Wilke, "Computationally Sound Analysis of a Probabilistic Contract Signing Protocol," in ESORICS 2009, 2009.

@InProceedings{AizatulinSchnoorWilke-ProbCSP-ESORICS-TOAPPEAR-2009,
  author = {Mihhail Aizatulin and Henning Schnoor and Thomas Wilke},
  title = {Computationally Sound Analysis of a Probabilistic Contract Signing Protocol},
  booktitle = {ESORICS 2009},
  year = {2009},
  series = {Lecture Notes in Computer Science},
  note = \emph{to appear}
}

[AizatulinSchnoorWilke-ProbCSP-TR-CAU-2009 | .pdf | .bib]

M. Aizatulin, H. Schnoor, and T. Wilke, "Computationally Sound Analysis of a Probabilistic Contract Signing Protocol", Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 0911, 2009.

@TechReport{AizatulinSchnoorWilke-ProbCSP-TR-CAU-2009,
  author = {Mihhail Aizatulin and Henning Schnoor and Thomas Wilke},
  title = {Computationally Sound Analysis of a Probabilistic Contract Signing Protocol},
  institution = {Institut f{\"u}r Informatik, Christian-Albrechts-Universit{\"a}t zu Kiel},
  year = {2009},
  number = {0911},
  url = {http://www.informatik.uni-kiel.de/uploads/tx_publication/tr_0911.pdf}
}

[KuertzSchnoorWilke-2MUTAUT-CRYPTEPRINT-2009 | .bib]

K. O. Kuertz, H. Schnoor, and T. Wilke, "Computationally Secure Two-Round Authenticated Message Exchange", 2009.

@TechReport{KuertzSchnoorWilke-2MUTAUT-CRYPTEPRINT-2009,
  author = {Klaas Ole Kuertz and Henning Schnoor and Thomas Wilke},
  title = {Computationally Secure Two-Round Authenticated Message Exchange},
  howpublished = {Cryptology ePrint Archive, Report 2009/262},
  year = {2009}
}

2008

[HemaspaandraSchnoorSchnoor-GeneralizedModal-CORR-2008 | .bib]

E. Hemaspaandra, H. Schnoor, and I. Schnoor, "Generalized Modal Satisfiability", Computing Research Repository, arXiv:0804.2729v1, 2008.

@TechReport{HemaspaandraSchnoorSchnoor-GeneralizedModal-CORR-2008,
  author = {Edith Hemaspaandra and Henning Schnoor and Ilka Schnoor},
  title = {Generalized Modal Satisfiability},
  institution = {Computing Research Repository},
  year = {2008},
  number = {arXiv:0804.2729v1}
}

[KuertzSchnoorWilke-2MUTAUT-TR-CAU-2008 | .pdf | .bib]

K. O. Kürtz, H. Schnoor, and T. Wilke, "Computationally Secure Two-Round Authenticated Message Exchange", Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 0809, 2008.

@TechReport{KuertzSchnoorWilke-2MUTAUT-TR-CAU-2008,
  author = {Klaas Ole K\"urtz and Henning Schnoor and Thomas Wilke},
  title = {Computationally Secure Two-Round Authenticated Message Exchange},
  institution = {Institut f{\"u}r Informatik, Christian-Albrechts-Universit{\"a}t zu Kiel},
  year = {2008},
  number = {0809},
  url = {http://www.informatik.uni-kiel.de/uploads/tx_publication/tr0810.pdf}
}

[CreignouSchnoorSchnoor-BalCSP-CSL-2008 | .bib]

N. Creignou, H. Schnoor, and I. Schnoor, "Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint," in CSL, 2008, pp. 109-123.

@inproceedings{CreignouSchnoorSchnoor-BalCSP-CSL-2008,
  author = {Nadia Creignou and Henning Schnoor and Ilka Schnoor},
  title = {Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint},
  booktitle = {CSL},
  year = {2008},
  pages = {109--123},
  ee = {http://dx.doi.org/10.1007/978-3-540-87531-4_10},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

[BrelsfordFaliszewskiHemaspaandraSchnoorSchnoor-Approx-AAAI-2008 | .bib]

E. Brelsford, P. Faliszewski, E. Hemaspaandra, H. Schnoor, and I. Schnoor, "Approximability of Manipulating Elections," in AAAI, 2008, pp. 44-49.

@InProceedings{BrelsfordFaliszewskiHemaspaandraSchnoorSchnoor-Approx-AAAI-2008,
  author = {Eric Brelsford and Piotr Faliszewski and Edith Hemaspaandra and Henning Schnoor and Ilka Schnoor},
  title = {Approximability of Manipulating Elections},
  booktitle = {AAAI},
  year = {2008},
  pages = {44--49},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

[HemaspaandraSchnoor-Elementary-STACS-2008 | .bib]

E. Hemaspaandra and H. Schnoor, "On the Complexity of Elementary Modal Logics," in STACS, 2008, pp. 349-360.

@inproceedings{HemaspaandraSchnoor-Elementary-STACS-2008,
  author = {Edith Hemaspaandra and Henning Schnoor},
  title = {On the Complexity of Elementary Modal Logics},
  booktitle = {STACS},
  year = {2008},
  pages = {349--360},
  ee = {http://drops.dagstuhl.de/opus/volltexte/2008/1356},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

[HemaspaandraSchnoor-Elementary-CORR-2008 | .bib]

E. Hemaspaandra and H. Schnoor, "On the Complexity of Elementary Modal Logics", Computing Research Repository, arXiv:0802.1884v1, 2008.

@TechReport{HemaspaandraSchnoor-Elementary-CORR-2008,
  author = {Edith Hemaspaandra and Henning Schnoor},
  title = {On the Complexity of Elementary Modal Logics},
  institution = {Computing Research Repository},
  year = {2008},
  number = {arXiv:0802.1884v1}
}

[HemaspaandraSchnoorSchnoor-GeneralizedModal-JCSS-TOAPPEAR-2008 | .bib]

E. Hemaspaandra, H. Schnoor, and I. Schnoor, "Generalized Modal Satisfiability," Journal of Computer and System Sciences, 2008.

@Article{HemaspaandraSchnoorSchnoor-GeneralizedModal-JCSS-TOAPPEAR-2008,
  author = {Edith Hemaspaandra and Henning Schnoor and Ilka Schnoor},
  title = {Generalized Modal Satisfiability},
  journal = {Journal of Computer and System Sciences},
  year = {2008},
  note = \emph{to appear}
}

[BaulandMundhenkSchneiderSchnoorSchnoorVollmer-LTLMC-CORR-2008 | .bib]

M. Bauland, M. Mundhenk, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer, "The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments," Computing Research Repository, vol. abs/0805.0498, 2008.

@article{BaulandMundhenkSchneiderSchnoorSchnoorVollmer-LTLMC-CORR-2008,
  author = {Michael Bauland and Martin Mundhenk and Thomas Schneider and Henning Schnoor and Ilka Schnoor and Heribert Vollmer},
  title = {The Tractability of Model-Checking for {LTL}: The Good, the Bad, and the Ugly Fragments},
  journal = {Computing Research Repository},
  volume = {abs/0805.0498},
  year = {2008},
  ee = {http://arxiv.org/abs/0805.0498},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

[Schnoor-SYMBBRT-TR-CAU-2008 | .pdf | .bib]

H. Schnoor, "Symbolic Verification of Computational Security for Branching-Time Properties", Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 0809, 2008.

@TechReport{Schnoor-SYMBBRT-TR-CAU-2008,
  author = {Henning Schnoor},
  title = {Symbolic Verification of Computational Security for Branching-Time Properties},
  institution = {Institut f{\"u}r Informatik, Christian-Albrechts-Universit{\"a}t zu Kiel},
  year = {2008},
  number = {0809},
  url = {http://www.informatik.uni-kiel.de/uploads/tx_publication/tr8009.pdf}
}

[BaulandBoehlerCreignouReithSchnoorVollmer-QCSP-TOCS-TOAPPEAR-2008 | .bib]

M. Bauland, E. Böhler, N. Creignou, S. Reith, H. Schnoor, and H. Vollmer, "The Complexity of Problems for Quantified Constraints," Theory of Computing Systems, 2008.

@Article{BaulandBoehlerCreignouReithSchnoorVollmer-QCSP-TOCS-TOAPPEAR-2008,
  author = {Michael Bauland and Elmar B\"ohler and Nadia Creignou and Steffen Reith and Henning Schnoor and Heribert Vollmer},
  title = {The Complexity of Problems for Quantified Constraints},
  journal = {Theory of Computing Systems},
  year = {2008},
  note = \emph{to appear}
}

[FaliszewskiHemaspaandraSchnoor-TiesMatter-AAMAS-2008 | .bib]

P. Faliszewski, E. Hemaspaandra, and H. Schnoor, "Copeland voting: ties matter," in AAMAS (2), 2008, pp. 983-990.

@inproceedings{FaliszewskiHemaspaandraSchnoor-TiesMatter-AAMAS-2008,
  author = {Piotr Faliszewski and Edith Hemaspaandra and Henning Schnoor},
  title = {Copeland voting: ties matter},
  booktitle = {AAMAS (2)},
  year = {2008},
  pages = {983-990},
  ee = {http://doi.acm.org/10.1145/1402298.1402359},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

[SchnoorSchnoor-Galois-LNCS-2008 | .bib]

H. Schnoor and I. Schnoor, "Partial Polymorphisms and Constraint Satisfaction Problems," in Complexity of Constraints, 2008, pp. 229-254.

@inproceedings{SchnoorSchnoor-Galois-LNCS-2008,
  author = {Henning Schnoor and Ilka Schnoor},
  title = {Partial Polymorphisms and Constraint Satisfaction Problems},
  booktitle = {Complexity of Constraints},
  year = {2008},
  pages = {229-254},
  ee = {http://dx.doi.org/10.1007/978-3-540-92800-3_9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

2007

[Schnoor-PhdThesis-2007 | .pdf | .bib]

H. Schnoor, "Algebraic Techniques for Satisfiability Problems", PhD Thesis, 2007.

@PhdThesis{Schnoor-PhdThesis-2007,
  author = {Henning Schnoor},
  title = {Algebraic Techniques for Satisfiability Problems},
  school = {Leibniz University of Hannover},
  year = {2007},
  url = {http://www.thi.uni-hannover.de/file\-ad\-min/for\-schung/ar\-bei\-ten/hschnoor-diss.pdf}
}

[SchnoorSchnoor-Enumerate-STACS-2007 | .bib]

H. Schnoor and I. Schnoor, "Enumerating All Solutions for Constraint Satisfaction Problems," in STACS, 2007, pp. 694-705.

@inproceedings{SchnoorSchnoor-Enumerate-STACS-2007,
  author = {Henning Schnoor and Ilka Schnoor},
  title = {Enumerating All Solutions for Constraint Satisfaction Problems},
  booktitle = {STACS},
  year = {2007},
  pages = {694-705},
  ee = {http://dx.doi.org/10.1007/978-3-540-70918-3_59},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

[BoehlerSchnoor-Descriptiveness-TOCS-2007 | .bib]

E. Böhler and H. Schnoor, "The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates," Theory of Computing Systems, vol. 41, iss. 4, pp. 753-777, 2007.

@article{BoehlerSchnoor-Descriptiveness-TOCS-2007,
  author = {Elmar B\"ohler and Henning Schnoor},
  title = {The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates},
  journal = {Theory of Computing Systems},
  volume = {41},
  number = {4},
  year = {2007},
  issn = {1432-4350},
  pages = {753--777},
  doi = {http://dx.doi.org/10.1007/s00224-006-1301-3},
  publisher = {Springer-Verlag New York, Inc.},
  address = {Secaucus, NJ, USA},
  }

[BaulandBoehlerCreignouReithSchnoorVollmer-QCSP-ECCC-2007 | .bib]

M. Bauland, E. Böhler, N. Creignou, S. Reith, H. Schnoor, and H. Vollmer, "The Complexity of Problems for Quantified Constraints", Electronic Colloqium on Computational Complexity, TR07-023, 2007.

@TechReport{BaulandBoehlerCreignouReithSchnoorVollmer-QCSP-ECCC-2007,
  author = {Michael Bauland and Elmar B\"ohler and Nadia Creignou and Steffen Reith and Henning Schnoor and Heribert Vollmer},
  title = {The Complexity of Problems for Quantified Constraints},
  institution = {Electronic Colloqium on Computational Complexity},
  number = {TR07-023},
  year = 2007, address = { }
}

[FaliszewskiHemaspaandraSchnoor-TiesMatter-TR-2007 | .bib]

P. Faliszewski, E. Hemaspaandra, and H. Schnoor, "Copeland Voting: Ties Matter", Department for Computer Science, University of Rochester, 926, 2007.

@TechReport{FaliszewskiHemaspaandraSchnoor-TiesMatter-TR-2007,
  author = {Piotr Faliszewski and Edith Hemaspaandra and Henning Schnoor},
  title = {Copeland Voting: Ties Matter},
  institution = {Department for Computer Science, University of Rochester},
  year = {2007},
  number = {926}
}

[BaulandSchneiderSchnoorSchnoorVollmer-LTLSAT-FOSSACS-2007 | .bib]

M. Bauland, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer, "The Complexity of Generalized Satisfiability for Linear Temporal Logic," in Foundations of Software Science and Computational Structures, 2007, pp. 48-62.

@inproceedings{BaulandSchneiderSchnoorSchnoorVollmer-LTLSAT-FOSSACS-2007,
  author = {Michael Bauland and Thomas Schneider and Henning Schnoor and Ilka Schnoor and Heribert Vollmer},
  title = {The Complexity of Generalized Satisfiability for Linear Temporal Logic},
  booktitle = {Foundations of Software Science and Computational Structures},
  year = {2007},
  pages = {48--62},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  volume = 4423, }

2006

[SchnoorSchnoor-Enumerate-DAGSTUHL-2006 | .bib]

H. Schnoor and I. Schnoor, "Enumerating all Solutions for Constraint Satisfaction Problems," in Complexity of Constraints, 2006.

@InProceedings{SchnoorSchnoor-Enumerate-DAGSTUHL-2006,
  author = {Henning Schnoor and Ilka Schnoor},
  title = {Enumerating all Solutions for Constraint Satisfaction Problems},
  booktitle = {Complexity of Constraints},
  year = {2006},
  editor = {Nadia Creignou and Phokion Kolaitis and Heribert Vollmer},
  number = {06401},
  series = {Dagstuhl Seminar Proceedings},
  ISSN = {1862-4405},
  publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany},
  }

[BaulandHemaspaandraSchnoorSchnoor-GeneralizedModal-STACS-2006 | .bib]

M. Bauland, E. Hemaspaandra, H. Schnoor, and I. Schnoor, "Generalized Modal Satisfiability," in Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science, 2006, pp. 500-511.

@inproceedings{BaulandHemaspaandraSchnoorSchnoor-GeneralizedModal-STACS-2006,
  author = {Michael Bauland and Edith Hemaspaandra and Henning Schnoor and Ilka Schnoor},
  editor = {Bruno Durand and Wolfgang Thomas},
  title = {Generalized Modal Satisfiability},
  booktitle = {Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science},
  year = {2006},
  series = {Lecture Notes in Computer Science},
  publisher = "Springer", volume = 3884, pages = {500--511},
  ee = {http://dx.doi.org/10.1007/11672142_41},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

[SchnoorSchnoor-Galois-DAGSTUHL-2006 | .bib]

H. Schnoor and I. Schnoor, "New Algebraic Tools for Constraint Satisfaction," in Complexity of Constraints, 2006.

@InProceedings{SchnoorSchnoor-Galois-DAGSTUHL-2006,
  author = {Henning Schnoor and Ilka Schnoor},
  title = {New Algebraic Tools for Constraint Satisfaction},
  booktitle = {Complexity of Constraints},
  year = {2006},
  editor = {Nadia Creignou and Phokion Kolaitis and Heribert Vollmer},
  number = {06401},
  series = {Dagstuhl Seminar Proceedings},
  ISSN = {1862-4405},
  publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany},
  }

2005

[BaulandBoehlerCreignouReithSchnoorVollmer-QCSP-ECCC-2005 | .bib]

M. Bauland, E. Böhler, N. Creignou, S. Reith, H. Schnoor, and H. Vollmer, "Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation", Electronic Colloqium on Computational Complexity, TR05-024, 2005.

@TechReport{BaulandBoehlerCreignouReithSchnoorVollmer-QCSP-ECCC-2005,
  author = {Michael Bauland and Elmar B\"ohler and Nadia Creignou and Steffen Reith and Henning Schnoor and Heribert Vollmer},
  title = {Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation},
  institution = {Electronic Colloqium on Computational Complexity},
  number = {TR05-024},
  year = 2005, address = { }
}

[AllenderBaulandImmermanSchnoorVollmer-CSP-MFCS-2005 | .bib]

E. Allender, M. Bauland, N. Immerman, H. Schnoor, and H. Vollmer, "The Complexity of Satisfiability Problems: Refining Schaefer’s Theorem.," in Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, 2005, pp. 71-82.

@inproceedings{AllenderBaulandImmermanSchnoorVollmer-CSP-MFCS-2005,
  author = {Eric Allender and Michael Bauland and Neil Immerman and Henning Schnoor and Heribert Vollmer},
  editor = {Joanna Jedrzejowicz and Andrzej Szepietowski},
  title = {The Complexity of Satisfiability Problems: Refining {Schaefer's} Theorem.},
  booktitle = {Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science},
  series = {Lecture Notes in Computer Science},
  publisher = "Springer", volume = 3618, year = {2005},
  pages = {71--82},
  ee = {http://dx.doi.org/10.1007/11549345_8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

[Schnoor-FormulaValue-TR-2005 | .bib]

H. Schnoor, "The Complexity of the Boolean Formula Value Problem", Theoretical Computer Science, Leibniz University of Hannover2005.

@TechReport{Schnoor-FormulaValue-TR-2005,
  author = {Henning Schnoor},
  institution = {Theoretical Computer Science, Leibniz University of Hannover},
  title = {The Complexity of the {B}oolean Formula Value Problem},
  ee = {http://www.thi.uni-hannover.de/forschung/publikationen/daten/schnoor05.pdf},
  year = 2005 }

[BoehlerReithSchnoorVollmer-Bases-IPL-2005 | .bib]

E. Böhler, S. Reith, H. Schnoor, and H. Vollmer, "Bases for Boolean Co-Clones," Information Processing Letters, vol. 96, pp. 59-66, 2005.

@Article{BoehlerReithSchnoorVollmer-Bases-IPL-2005,
  author = {Elmar B\"ohler and Steffen Reith and Henning Schnoor and Heribert Vollmer},
  title = {Bases for {B}oolean Co-Clones},
  journal = {Information Processing Letters},
  year = 2005, volume= {96},
  issue = {2},
  pages = {59--66}
}

[KuertzSchnoorWilke-AMX-Simulation-ASIAN-2009-TOAPPEAR | .bib]

K. O. Kürtz, H. Schnoor, and T. Wilke, "A Simulation-Based Treatment of Authenticated Message Exchange," in Proceedings of ASIAN 2009.

@InProceedings{KuertzSchnoorWilke-AMX-Simulation-ASIAN-2009-TOAPPEAR,
  author = {Klaas Ole K\"urtz and Henning Schnoor and Thomas Wilke},
  title = {A Simulation-Based Treatment of Authenticated Message Exchange},
  booktitle = {Proceedings of ASIAN 2009},
  yuear = {2009},
  note = \emph{to appear}
}