TrustedPals: Secure Multiparty Computation Implemented with Smart Cards

  • Milan Fort
  • Felix Freiling
  • Lucia Draque Penso
  • Zinaida Benenson
  • Dogan Kesdogan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4189)


We study the problem of Secure Multi-party Computation (SMC) in a model where individual processes contain a tamper-proof security module, and introduce the TrustedPals framework, an efficient smart card based implementation of SMC for any number of participating entities in such a model. Security modules can be trusted by other processes and can establish secure channels between each other. However, their availability is restricted by their host, that is, a corrupted party can stop the computation of its own security module as well as drop any message sent by or to its security module. We show that in this model SMC can be implemented by reducing it to a fault-tolerance problem at the level of security modules. Since the critical part of the computation can be executed locally on the smart card, we can compute any function securely with a protocol complexity which is polynomial only in the number of processes (that is, the complexity does not depend on the function which is computed), in contrast to previous approaches.


Smart Card Correct Process Trusted Third Party Security Module Fair Exchange 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Trustedpals source code (April 2006), downloadable from:
  2. 2.
  3. 3.
    Avoine, G., Gärtner, F.C., Guerraoui, R., Vukolić, M.: Gracefully degrading fair exchange with security modules. In: Dal Cin, M., Kaâniche, M., Pataricza, A. (eds.) EDCC 2005. LNCS, vol. 3463, pp. 55–71. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Avoine, G., Vaudenay, S.: Fair exchange with guardian angels. In: The 4th International Workshop on Information Security Applications – WISA 2003, Jeju Island, Korea (August 2003)Google Scholar
  5. 5.
    Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th Annual Symposium on Theory of Computing (STOC), Chicago, IL USA, pp. 1–10. ACM Press, New York (1988)Google Scholar
  6. 6.
    Benenson, Z., Gärtner, F.C., Kesdogan, D.: Secure multi-party computation with security modules. Technical Report AIB-10-2004, RWTH Aachen (December 2004)Google Scholar
  7. 7.
    Chaum, D., Crepeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: Cole, R. (ed.) Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, Chicago, IL, pp. 11–19. ACM Press, New York (1988)Google Scholar
  8. 8.
    Chen, Z.: Java Card Technology for Smart Cards, 1st edn. Addison-Wesley Professional, Reading (2000)Google Scholar
  9. 9.
    Delporte-Gallet, C., Fauconnier, H., Freiling, F.C.: Revisiting failure detection and consensus in omission failure environments. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 394–408. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Dyer, J.G., Lindemann, M., Perez, R., Sailer, R., van Doorn, L., Smith, S.W., Weingart, S.: Building the IBM 4758 secure coprocessor. IEEE Computer 34(10), 57–66 (2001)Google Scholar
  11. 11.
    Fowler, M.: Inversion of Control Containers and the Dependency Injection Pattern,
  12. 12.
  13. 13.
    Freiling, F.C., Herlihy, M.P., Penso, L.D.: Optimal randomized fair exchange with secret shared coins. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 61–72. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  14. 14.
    Goldreich, O.: Secure multi-party computation (2002), Internet:
  15. 15.
    Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game — a completeness theorem for protocols with honest majority. In: Proceedings of the 19th ACM Symposium on the Theory of Computing (STOC), pp. 218–229 (1987)Google Scholar
  16. 16.
    Hansmann, U., Nicklous, M., Schäck, T., Schneider, A., Seliger, F.: Smart Card Application Development Using Java, 2nd edn. Springer, Heidelberg (2002)Google Scholar
  17. 17.
    Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multi-party computation. In: Proceedings of Asiacrypt (2000)Google Scholar
  18. 18.
    Iliev, A., Smith, S.: More efficient secure function evaluation using tiny trusted third parties. Technical Report TR2005-551, Dartmouth College, Computer Science, Hanover, NH (July 2005)Google Scholar
  19. 19.
    Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3), 382–401 (1982)CrossRefMATHGoogle Scholar
  20. 20.
    MacKenzie, P., Oprea, A., Reiter, M.K.: Automatic generation of two-party computations. In: SIGSAC: 10th ACM Conference on Computer and Communications Security. ACM SIGSAC (2003)Google Scholar
  21. 21.
    Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay — A secure two-party computation system. In: Proceedings of the 13th USENIX Security Symposium, USENIX (August 2004)Google Scholar
  22. 22.
    Parvédy, P.R., Raynal, M.: Uniform agreement despite process omission failures. In: 17th International Parallel and Distributed Processing Symposium (IPDPS 2003). IEEE Computer Society, Los Alamitos (April 2003); appears also as IRISA Technical Report Number PI-1490 (November 2002) Google Scholar
  23. 23.
    Pease, M., Shostak, R., Lamport, L.: Reaching agreements in the presence of faults. Journal of the ACM 27(2), 228–234 (1980)CrossRefMathSciNetMATHGoogle Scholar
  24. 24.
    Perry, K.J., Toueg, S.: Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering 12(3), 477–482 (1986)Google Scholar
  25. 25.
    Pfitzmann, A., Köhntopp, M.: Anonymity, unobservability, and pseudonymity - A proposal for terminology. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 1–9. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  26. 26.
    Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys 22(4), 299–319 (1990)CrossRefGoogle Scholar
  27. 27.
    Trusted Computing Group. Trusted computing group homepage (2003), Internet:
  28. 28.
    Yao, A.C.: Protocols for secure computations (extended abstract). In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), pp. 160–164. IEEE Computer Society Press, Los Alamitos (1982)CrossRefGoogle Scholar
  29. 29.
    Zhou, L., Schneider, F.B., van Renesse, R.: COCA: A secure distributed on-line certification authority. TOCS 20(4), 329–368 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Milan Fort
    • 2
  • Felix Freiling
    • 3
  • Lucia Draque Penso
    • 3
  • Zinaida Benenson
    • 1
  • Dogan Kesdogan
    • 2
  1. 1.Department of Information TechnologyUppsala UniversityUppsalaSweden
  2. 2.Computer Science DepartmentRWTH Aachen UniversityAachenGermany
  3. 3.Computer Science DepartmentUniversity of MannheimMannheimGermany

Personalised recommendations