Security, probability and nearly fair coins in the cryptographers' café

Annabelle McIver*, Larissa Meinicke, Carroll Morgan

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

4 Citations (Scopus)


Security and probability are both artefacts that we hope to bring increasingly within the reach of refinement-based Formal Methods; although we have worked on them separately, in the past, the goal has always been to bring them together. In this report we describe our ongoing work in that direction: we relate it to a well known problem in security, Chaum's Dining Cryptographers, where the various criteria of correctness that might apply to it expose precisely the issues we have found to be significant in our efforts to deal with security, probability and abstraction all at once. Taking our conviction into this unfamiliar and demanding territory, that abstraction and refinement are the key tools of software development, has turned out to be an exciting challenge.

Original languageEnglish
Title of host publicationFM 2009: Formal Methods
Subtitle of host publicationSecond World Congress, Eindhoven, The Netherlands, November 2-6, 2009. Proceedings
EditorsAna Cavalcanti, Dennis R. Dams
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Number of pages31
ISBN (Electronic)9783642050893
ISBN (Print)9783642050886
Publication statusPublished - 2009
Event2nd World Congress on Formal Methods, FM 2009 - Eindhoven, Netherlands
Duration: 2 Nov 20096 Nov 2009

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other2nd World Congress on Formal Methods, FM 2009


Dive into the research topics of 'Security, probability and nearly fair coins in the cryptographers' café'. Together they form a unique fingerprint.

Cite this