Computer Science – Cryptography and Security
Scientific paper
2009-10-21
EPTCS 7, 2009, pp. 31-45
Computer Science
Cryptography and Security
Scientific paper
10.4204/EPTCS.7.3
The three-judges protocol, recently advocated by Mclver and Morgan as an example of stepwise refinement of security protocols, studies how to securely compute the majority function to reach a final verdict without revealing each individual judge's decision. We extend their protocol in two different ways for an arbitrary number of 2n+1 judges. The first generalisation is inherently centralised, in the sense that it requires a judge as a leader who collects information from others, computes the majority function, and announces the final result. A different approach can be obtained by slightly modifying the well-known dining cryptographers protocol, however it reveals the number of votes rather than the final verdict. We define a notion of conditional anonymity in order to analyse these two solutions. Both of them have been checked in the model checker MCMAS.
Pang Jun
Zhang Chenyi
No associations
LandOfFree
How to Work with Honest but Curious Judges? (Preliminary Report) 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 How to Work with Honest but Curious Judges? (Preliminary Report), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to Work with Honest but Curious Judges? (Preliminary Report) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-143909