Filters








198 Hits in 4.6 sec

Arbitrary Length k-Anonymous Dining-Cryptographers Communication [article]

David Mödinger and Alexander Heß and Franz J. Hauck
2021 arXiv   pre-print
Dining-cryptographers networks (DCN) can achieve information-theoretical privacy.  ...  The interquartile range of the largest test of the highly secured version took 35s+-1.25s for a full run.  ...  We applied a preliminary version of an arbitrary length k-anonymous dining-cryptographers network to realise the first of the three phases of 3P3.  ... 
arXiv:2103.17091v1 fatcat:slgc4vvtrjbo7cspybh5vcx2eq

Anonymous One-Time Broadcast Using Non-interactive Dining Cryptographer Nets with Applications to Voting [chapter]

Jeroen van de Graaf
2010 Lecture Notes in Computer Science  
However, instead of using a MIX net, we use a new broadcast protocol for anonymously publishing the vote, a non-interactive variation of the Dining Cryptographer Net.  ...  Acknowledgements I would like to thank Berry Schoenmakers, who gave important feedback on an earlier (and erroneous) version of this paper.  ...  the Dining Cryptographers protocol [3] to post her vote.  ... 
doi:10.1007/978-3-642-12980-3_14 fatcat:e2r5qp4g2zhrpff7273nuz3wj4

Modularity and Openness in Modeling Multi-Agent Systems

Wojciech Jamroga, Artur Mȩski, Maciej Szreter
2013 Electronic Proceedings in Theoretical Computer Science  
We demonstrate this on two well-known examples, namely the trains, tunnel and controller, and the dining cryptographers.  ...  Dining Cryptographers: Standard Version (DC1) Dining Cryptographers is a well-known benchmark proposed by Chaum [5] . n cryptographers are having dinner, and the bill is to be paid anonymously, either  ...  Dining Cryptographers: Standard Version with Broadcast (DC1) Let us now go back to the standard version of the protocol, presented in Section 3.3 Adding a new cryptographer C i requires the following changes  ... 
doi:10.4204/eptcs.119.19 fatcat:isou3hfmzjdcvivcx2s2kzifji

A Tool For Specification And Verification Of Epistemic Properties In Interpreted Systems

Franco Raimondi, Alessio Lomuscio
2004 Electronical Notes in Theoretical Computer Science  
We apply this methodology to the verification of a communication protocol -the dining cryptographers. 1  ...  The Methodology in Practice Following the considerations above, we encoded the Interpreted System for the dining Cryptographers as an XML file.  ...  Statement of the Problem The Dining Cryptographers scenario is introduced in [6] as follows: "Three cryptographers are sitting down to dinner at their favourite threestar restaurant.  ... 
doi:10.1016/s1571-0661(05)82609-x fatcat:xdhxgq3ia5aolely43bmgy77ui

Information Hiding in Probabilistic Concurrent Systems

Miguel E. Andres, Catuscia Palamidessi, Peter van Rossum, Ana Sokolova
2010 2010 Seventh International Conference on the Quantitative Evaluation of Systems  
Anonymity and Information Flow are examples of this notion. We study the problem of information hiding in systems characterized by the presence of randomization and concurrency.  ...  Acknowledgement The authors wish to thank Flavio Garcia, Pedro D'Argenio, Sergio Giro, and Mariëlle Stoelinga for useful comments on an earlier version of this paper, as well as the anonymous reviewers  ...  Dining Cryptographers This problem, described by Chaum in [9] , involves a situation in which three cryptographers are dining together.  ... 
doi:10.1109/qest.2010.11 dblp:conf/qest/AndresPRS10 fatcat:d6v3ivbcmrhzrim3lf3xooh7ja

Optimizing Epistemic Model Checking Using Conditional Independence (Extended Abstract)

Ron van der Meyden
2017 Electronic Proceedings in Theoretical Computer Science  
Performance results for model checking the Dining Cryptographers protocol running on a ring with n agents are shown in Figure 5 (a).  ...  Dining Cryptographers: Our first example is the Dining Cryptographers protocol [7] , discussed above. It was first model checked using epistemic logic in [21] .  ... 
doi:10.4204/eptcs.251.29 fatcat:35uid64y4rhj5j4jqg4oowj64q

Probabilistic Anonymity [chapter]

Mohit Bhargava, Catuscia Palamidessi
2005 Lecture Notes in Computer Science  
We illustrate our ideas by using the example of the dining cryptographers.  ...  We are currently investigating weaker versions of our notion of anonymity, and studying their application to protocols like Crowds [8, 6] .  ...  We are currently developing a model checker for the probabilistic π-calculus.  ... 
doi:10.1007/11539452_16 fatcat:rankdcswljg3tkrloixxvkbgfm

Probabilistic Bisimulation for Parameterized Systems [chapter]

Chih-Duo Hong, Anthony W. Lin, Rupak Majumdar, Philipp Rümmer
2019 Lecture Notes in Computer Science  
As a case study, we show that our framework is sufficiently expressive for proving the anonymity property of the parameterized dining cryptographers protocol and the parameterized grades protocol.  ...  We study two versions of dining cryptographers protocol in this paper: the classical version where the secrets are single bits, and a generalized version where the secrets are bit-vectors of arbitrary  ...  A generalized Dining Cryptographers Protocol.  ... 
doi:10.1007/978-3-030-25540-4_27 fatcat:xqlxhtqbhjdclk3n3g5airbaeq

Information hiding in probabilistic concurrent systems

Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, Ana Sokolova
2011 Theoretical Computer Science  
Through the paper, we use the canonical example of the Dining Cryptographers to illustrate our ideas and techniques.  ...  Anonymity and Information Flow are examples of this notion. We study the problem of information hiding in systems characterized by the coexistence of randomization and concurrency.  ...  Acknowledgements The authors wish to thank Flavio Garcia, Pedro D'Argenio, Sergio Giro, and Mariëlle Stoelinga for useful comments on an earlier version of this paper, as well as the anonymous reviewers  ... 
doi:10.1016/j.tcs.2011.02.045 fatcat:u5sp2zqf6zholkuy6d6jgcamwm

An Algebraic Approach for Reasoning About Information Flow [chapter]

Arthur Américo, Mário S. Alvim, Annabelle McIver
2018 Lecture Notes in Computer Science  
We consider that there are 4 cryptographers and 4 coins, and denote the protocol's channel by Dining.  ...  Since in the protocol first the coins are tossed, and only then the corresponding results are passed on to the party of cryptographers, Dining can be described as the cascading of these two channels:  ... 
doi:10.1007/978-3-319-95582-7_4 fatcat:rt343pmkfjc6dllrmxth5ss3xe

Security, Probability and Nearly Fair Coins in the Cryptographers' Café [chapter]

Annabelle McIver, Larissa Meinicke, Carroll Morgan
2009 Lecture Notes in Computer Science  
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  ...  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  ...  For example, in the Dining Cryptographers, the waitress has one perspective of the system, and Cryptographer A has another.  ... 
doi:10.1007/978-3-642-05089-3_5 fatcat:v37xoiqsqrbxfgeynhqd6m2h4a

Probabilistic Bisimulation for Parameterized Systems (Technical Report) [article]

Chih-Duo Hong, Anthony W. Lin, Rupak Majumdar, Philipp Rümmer
2020 arXiv   pre-print
As a case study, we show that our framework is sufficiently expressive for proving the anonymity property of the parameterized dining cryptographers protocol and the parameterized grades protocol, when  ...  We study two versions of dining cryptographers protocol in this paper: the classical version where the secrets are single bits, and a generalized version where the secrets are bit-vectors of arbitrary  ...  The dining cryptographers protocol. Dining cryptographers protocol [16] is a multiparty computation algorithm aiming to securely compute the XOR of the secret bits held by the participants.  ... 
arXiv:2011.02413v1 fatcat:of2omazvffhn3fqx5l2syi7n2a

Parameterised Anonymity [chapter]

Jan Friso Groote, Simona Orzan
2009 Lecture Notes in Computer Science  
Using recently developed invariant techniques for solving parameterised boolean equation systems, we then show that the Dining Cryptographers protocol guarantees parameterised anonymity with respect to  ...  We also argue that although the question whether a protocol guarantees parameterised anonymity is in general undecidable, there are practical subclasses where anonymity can be decided for any group of  ...  The Dining Cryptographers protocol. We give here an informal description of this protocol, a metaphor for anonymous broadcast. The story goes as follows: n cryptographers have dinner together.  ... 
doi:10.1007/978-3-642-01465-9_12 fatcat:hkhk2spjofdkhljgsdpmmkgquu

Learning to Prove Safety over Parameterised Concurrent Systems (Full Version) [article]

Yu-Fang Chen, Chih-Duo Hong, Anthony W. Lin, Philipp Ruemmer
2017 arXiv   pre-print
We have tested L* algorithm on standard (as well as new) examples in regular model checking including the dining philosopher protocol, the dining cryptographer protocol, and several mutual exclusion protocols  ...  ., an infinite family of finite-state concurrent systems that are represented by some finite (symbolic) means.  ...  Acknowledgements: This article is a full version of [28] . We thank anonymous referees for their useful comments. Rümmer was supported by the Swedish Research Council under grant 2014-5484.  ... 
arXiv:1709.07139v2 fatcat:qk4zvwgbsbcvdbkietnyxul744

Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems

Ralf Wimmer, Bettina Braitling, Bernd Becker, Ernst Moritz Hahn, Pepijn Crouzen, Holger Hermanns, Abhishek Dhama, Oliver Theel
2010 2010 Seventh International Conference on the Quantitative Evaluation of Systems  
Practical evidence shows that the implementation is effective, and sometimes uses considerably less memory than a fully explicit implementation.  ...  using binary decision diagrams, while the linear equation systems which have to be solved for the induced Markov chains to improve the current scheduler are solved using an explicit state representation  ...  Dining cryptographers [30] . This case study considers a group of N cryptographers which have dinner at a restaurant. An agreement has been made that the dinner will be paid anonymously.  ... 
doi:10.1109/qest.2010.12 dblp:conf/qest/WimmerBBHCHDT10 fatcat:4duhdy5weza77oe3zvyode4hom
« Previous Showing results 1 — 15 out of 198 results