1. Ben-Or, M., Goldwasser, S., and Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proceedings of 20th ACM Symposium on the Theory of Computing (1988) 1–10
2. ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory, Vol. IT-31, No. 4, (1985) 469–472
3. Freuder, E. C., Minca, M., and Wallace, R. J.: Privacy/Efficiency Tradeoffs in Distributed Meeting Scheduling by Constraint-based Agents, Proceedings of IJCAI-01 Workshop on Distributed Constraint Reasoning (2001)
4. Goldreich, O., Micli, S., and Wigderson, A.: How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority, Proceedings of 19th ACM Symposium on the Theory of Computing (1987) 218–229
5. Hamadi, Y., Bessière, C., and Quinqueton, J.: Backtracking in Distributed Constraint Networks, Proceedings of the Thirteenth European Conference on Artificial Intelligence (ECAI-98) (1998) 219–223