TrustedPals: Secure multiparty computation implemented with smart cards

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4189 LNCS, Issue , 2006, Pages 34-48

  Fort, Milan ^b   Freiling, Felix ^c   Penso, Lucia Draque ^c   Benenson, Zinaida ^a   Kesdogan, Dogan ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; SECURITY SYSTEMS; SMART CARDS;

FAULT-TOLERANCE PROBLEMS; SECURE MULTI-PARTY COMPUTATION (SMC); SECURITY MODULES;

COMPUTATION THEORY;

EID: 33750232983     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11863908_3     Document Type: Conference Paper

References (30)

1. Trustedpals source code. Downloadable from http://pil.informatik.uni- mannlieim.de, April 2006.
2. ActiveMQ. http://activemq.codehaus.org.
3. Gildas Avoine, Felix Gärtner, Rachid Guerraoui, and Marko Vukolic. Gracefully degrading fair exchange with security modules. In Proceedings of the Fifth European Dependable Computing Conference, pages 55-71. Springer-Verlag, April 2005.
4. Gildas Avoine and Serge Vaudenay. Fair exchange with guardian angels. In The 4th International Workshop on Information Security Applications - WISA 2003, Jeju Island, Korea, August 2003.
5. Michael Ben-Or, Shafi Goldwasser, and Ari Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual Symposium on Theory of Computing (STOC), pages 1-10, Chicago, IL USA, May 1988. ACM Press.
6. Zinaida Benenson, Felix C. Gärtner, and Dogan Kesdogan. Secure multi-party computation with security modules. Technical Report AIB-10-2004, RWTH Aachen, December 2004.
7. David Chaum, Claude Crepeau, and Ivan Damgård. Multiparty unconditionally secure protocols. In Richard Cole, editor, Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, pages 11-19, Chicago, IL, May 1988. ACM Press.
8. Z. Chen. Java Card Technology for Smart Cards - 1st Edition. Addison-Wesley Professional, 2000.
9. Carole Delporte-Gallet, Hugues Fauconnier, and Felix C. Freiling. Revisiting failure detection and consensus in omission failure environments. In Proceedings of the International Colloquium on Theoretical Aspects of Computing (ICTAC05), Hanoi, Vietnam, October 2005.
10. Joan G. Dyer, Mark Lindemann, Ronald Ferez, Reiner Sailer, Leendert van Doorn, Sean W. Smith, and Steve Weingart. Building the IBM 4758 secure coprocessor. IEEE Computer, 34(10):57-66, October 2001.
11. M. Fowler. Inversion of Control Containers and the Dependency Injection Pattern. http://martinfowler.com/articles/injection.html.
12. Spring Framework, http://www.springframework.org.
13. F. Freiling, M. Herlihy, and L. Penso. Optimal randomized fair exchange with secret shared coins. In Proceedings of the Ninth International Conference on Principles of Distributed Systems. Springer, December 2005.
14. Oded Goldreich. Secure multi-party computation. Internet: http://www.wisdom.weizmann.ac.il/~oded/pp.html, 2002.
15. Oded Goldreich, S. Micali, and A. Wigderson. 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), pages 218-229, 1987.
16. U. Hansmann, M. Nicklous, T. Schäck, A. Schneider, and F. Seliger. Smart Card Application Development Using Java - 2nd Edition. Springer, 2002.
17. Martin Hirt, Ueli Maurer, and Bartosz Przydatek. Efficient secure multi-party computation. In Proceedings of Asiacrypt, 2000.
18. Alexander Iliev and Sean Smith. More efficient secure function evaluation using tiny trusted third parties. Technical Report TR2005-551, Dartmouth College, Computer Science, Hanover, NH, July 2005.
19. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
20. P. MacKenzie, A. Oprea, and M.K. Reiter. Automatic generation of two-party computations. In SIGSAC: 10th ACM Conference on Computer and Communications Security. ACM SIGSAC, 2003.
21. Dahlia Malkhi, Noam Nisan, Benny Pinkas, and Yaron Sella. Fairplay - A secure two-party computation system. In Proceedings of the 13th USENIX Security Symposium. USENIX, August 2004.
22. Philippe Raïpin Parvédy and Michel Raynal. Uniform agreement despite process omission failures. In 17th International Parallel and Distributed Processing Symposium (IPDPS 2003). IEEE Computer Society, April 2003.
23. Appears also as IRISA Technical Report Number PI-1490, November 2002.
24. M. Pease, R. Shostak, and L. Lamport. Reaching agreements in the presence of faults. Journal of the ACM, 27(2):228-234, April 1980.
25. Kenneth J. Perry and Sam Toueg. Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering, 12(3):477-482, March 1986.
26. Andreas Pfitzmann and Marit Köhntopp. Anonymity, unobservability, and pseudonymity - A proposal for terminology. In H. Federrath, editor, Anonymity 2000, number 2009 in Lecture Notes in Computer Science, pages 1-9, 2001.
27. Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299-319, December 1990.
28. Trusted Computing Group. Trusted computing group homepage. Internet: https://www.trustedcomputinggroup.org/, 2003.
29. A. C. Yao. Protocols for secure computations (extended abstract). In 23th Annual Symposium on Foundations of Computer Science (FOCS '82), pages 160-164, Los Alamitos, Ca., USA, November 1982. IEEE Computer Society Press.
30. Lidong Zhou, Fred B. Schneider, and Robbert van Renesse. COCA: A secure distributed on-line certification authority. TOCS, 20(4):329-368, November 2002.