Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols

Details Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols

2010-10-12

arxiv.org/abs/1010.2287v1

Computer Science

Logic in Computer Science

Scientific paper

The paper describes an abstraction for protocols that are based on multiple rounds of Chaum's Dining Cryptographers protocol. It is proved that the abstraction preserves a rich class of specifications in the logic of knowledge, including specifications describing what an agent knows about other agents' knowledge. This result can be used to optimize model checking of Dining Cryptographers-based protocols, and applied within a methodology for knowledge-based program implementation and verification. Some case studies of such an application are given, for a protocol that uses the Dining Cryptographers protocol as a primitive in an anonymous broadcast system. Performance results are given for model checking knowledge-based specifications in the concrete and abstract models of this protocol, and some new conclusions about the protocol are derived.

Affiliated with

Also associated with

No associations

Rating

Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-607541