How to Work with Honest but Curious Judges? (Preliminary Report)

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

No Coincidence?

This paper critically examines coincidence arguments and evolutionary debunking arguments against non-naturalist realism in metaethics. It advances a version of these arguments that goes roughly like this: Given a non-naturalist, realist metaethic, it would be cosmically coincidental if our first order normative beliefs were true. This coincidence undermines any prima facie justification enjoyed by those beliefs

The fourth root of the Kogut-Susskind determinant via infinite component fields

An example of interpolation by means of local field theories between the case of normal Kogut-Susskind fermions and the case of keeping just the fourth root of the Kogut-Susskind determinant is given. For the fourth root trick to be a valid approximation certain limits need to be smooth. The question about the validity of the fourth root trick is not resolved, only cast into a local field theoretical framework.Comment: 2