Is Distributed Trust More Trustworthy?
Reference21 articles.
1. Abraham, I., Dolev, D., Gonen, R., and Halpern, J. “Distributed Computing Meets Game Theory: Robust Mechanisms for Rational Secret Sharing and Multiparty Computation,” in Proceedings of the twenty-fifth annual 18 ACM symposium on Principles of distributed computing, ACM Press, New York, NY, USA, 2006, pp. 53–62. 2. Abreu, D. “Extremal Equilibria of Oligopolistic Supergames,” Journal of Economic Theory (39), 1986, pp. 191–225. 3. Ben-Or, M., Goldwasser, S. and Wigderson, A. “Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computation,” in Proceedings of ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 1988, pp. 1–10. 4. Bogetoft, P., Christensen, D. L., Damgaard, I., Geisler, M., Jakobsen, T., Krøigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J., Schwartzbach, M. and Toft, T. “Multiparty Computation Goes Live,” Cryptology ePrint Archive, Report 2008/068. http://eprint.iacr.org/ . 2008. 5. Bogetoft, P., Damgaard, I., Jacobsen, T., Nielsen, K., Pagter, J. and Toft, T. “Secure Computing, Economy, and Trust- a Generic Solution for Secure Auctions with Real-World Applications,” Report RS-05-18, Basic Research in Computer Science. 2005.
|
|