Abstract
This paper presents a modular redesign of TrustedPals, a smartcard-based security framework for solving secure multiparty computation (SMC). TrustedPals allows to reduce SMC to the problem of fault-tolerant consensus between smartcards. Within the redesign we investigate the problem of solving consensus in a general omission failure model augmented with failure detectors. To this end, we give novel definitions of both consensus and the class of \(\Diamond{\mathcal P}\) failure detectors in the omission model and show how to implement \(\Diamond{\mathcal P}\) and have consensus in such a system with some weak synchrony assumptions. The integration of failure detection into the TrustedPals framework uses tools from privacy enhancing techniques such as message padding and dummy traffic.
Work by the Spanish authors was supported by the Spanish Research Council, under grant HA2005-0078. Work by the German authors was supported by DAAD PPP Programme Acciones Integradas Hispano Alemanas.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avoine, G., Gärtner, F., Guerraoui, R., Vukolic, 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)
Avoine, G., Vaudenay, S.: Optimal fair exchange with guardian angels. In: Chae, K.J., Yung, M. (eds.) Information Security Applications. LNCS, vol. 2908, pp. 188–202. Springer, Heidelberg (2004)
Benenson, Z., Fort, M., Freiling, F., Kesdogan, D., Penso, L.D.: Trustedpals: Secure multiparty computation implemented with smartcards. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol. 4189, pp. 306–314. Springer, Heidelberg (2006)
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)
Chen, Z.: Java Card Technology for Smart Cards, 1st edn. Addison-Wesley, Reading (2000)
Correia, M., Veríssimo, P., Neves, N.F.: The design of a COTS-Real-time distributed security kernel. In: Bondavalli, A., Thévenod-Fosse, P. (eds.) Dependable Computing EDCC-4. LNCS, vol. 2485, pp. 234–252. Springer, Heidelberg (2002)
Cortiñas, R., Freiling, F.C., Ghajar-Azadanlou, M., Lafuente, A., Larrea, M., Penso, L.D., Soraluze, I.: Secure Failure Detection in TrustedPals. Technical Report EHU-KAT-IK-07-07, The University of the Basque Country, (July 2007), Available at http://www.sc.ehu.es/acwlaalm/
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, Springer, Heidelberg (2005)
Dolev, D., Friedman, R., Keidar, I., Malkhi, D.: Failure detectors in omission failure environments. Technical Report TR96-1608, Cornell University, Computer Science Department (September 1996)
Dolev, D., Friedman, R., Keidar, I., Malkhi, D.: Failure detectors in omission failure environments. In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, p. 286 (1997)
Doudou, A., Garbinato, B., Guerraoui, R.: Encapsulating failure detection: from crash to Byzantine failures. In: Proceedings of the Int. Conference on Reliable Software Technologies, Vienna (May 2002)
Dwork, C., Lynch, N.A., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM 35(2), 288–323 (1988)
Freiling, F.C., Guerraoui, R., Kouznetsov, P.: The failure detector abstraction. Technical report, Department for Mathematics and Computer Science, University of Mannheim (2006)
Hadzilacos, V.: Issues of Fault Tolerance in Concurrent Computations. PhD thesis, Harvard University 1984, also published as Technical Report TR11-84
Kihlstrom, K.P., Moser, L.E., Melliar-Smith, P.M.: Byzantine fault detectors for solving consensus. The Computer Journal 46(1) (2003)
Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3), 382–401 (1982)
MacKenzie, P., Oprea, A., Reiter, M.: Automatic generation of two-party computations. In: ACM SIGSAC. SIGSAC: 10th ACM Conference on Computer and Communications Security, ACM Press, New York (2003)
Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay — A secure two-party computation system. In: USENIX. Proceedings of the 13th USENIX Security Symposium (August 2004)
Babaoglu, Ö., Davoli, R., Montresor, A.: Group communication in partitionable systems: Specification and algorithms. IEEE Trans. Softw. Eng. 27(4), 308–336 (2001)
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)
Sousa, P., Neves, N.F., Veríssimo, P.: Proactive resilience through architectural hybridization. In: Proceedings of the 2006 ACM Symposium on Applied Computing, pp. 686–690 (2006)
Yao, A.C.: Protocols for secure computations. In: Proceedings of the Twenty-Third Annual Symposium on Foundations of Computer Science, pp. 160–164 (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cortiñas, R. et al. (2007). Secure Failure Detection in TrustedPals. In: Masuzawa, T., Tixeuil, S. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2007. Lecture Notes in Computer Science, vol 4838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76627-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-76627-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76626-1
Online ISBN: 978-3-540-76627-8
eBook Packages: Computer ScienceComputer Science (R0)