Kordy, Barbara ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Radomirovic, Sasa ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
S. Mauw, S. Radomirović, and M. T. Dashti, "Minimal message complexity of asynchronous multi-party contract signing," in Proceedings of the 22nd IEEE Computer Security Foundations Symposium (CSF'09). IEEE Computer Society, 2009, pp. 13-25.
S. D. Gordon, "On fairness in secure computation," PhD Thesis, University of Maryland, 2010.
N. Asokan, "Fairness in electronic commerce," PhD Thesis, University of Waterloo, 1998.
J. Garay, M. Jakobsson, and P. MacKenzie, "Abuse-free optimistic contract signing," in Advances in Cryptology - CRYPTO'99, ser. LNCS, M. J. Wiener, Ed., vol. 1666. Santa Barbara, California, USA: Springer-Verlag, Aug. 1999, pp. 449-466.
A. Mukhamedov and M. D. Ryan, "Fair multi-party contract signing using private contract signatures," Inf. Comput., vol. 206, no. 2-4, pp. 272-290, 2008.
J. A. Garay and P. D. MacKenzie, "Abuse-free multi-party contract signing," in Distributed Computing, 13th International Symposium, Bratislava, Slavak Republic, September 27-29, 1999, Proceedings, ser. Lecture Notes in Computer Science, vol. 1693. Springer, 1999, pp. 151-165.
R. Chadha, S. Kremer, and A. Scedrov, "Formal analysis of multi-party contract signing," in CSFW '04. Washington, DC, USA: IEEE Computer Society, 2004, p. 266.
Y. Zhang, C. Zhang, J. Pang, and S. Mauw, "Game-based verification of multi-party contract signing protocols," in Formal Aspects in Security and Trust, ser. Lecture Notes in Computer Science, P. Degano and J. D. Guttman, Eds., vol. 5983. Springer, 2009, pp. 186-200.
-, "Game-based verification of multi-party contract signing protocols with minimal messages," Innovations in Systems and Software Engineering, in press.
B. Baum-Waidner and M. Waidner, "Round-optimal and abuse free optimistic multi-party contract signing," in Automata, Languages and Programming - ICALP 2000, ser. LNCS, U. Montanari, J. D. P. Rolim, and E. Welzl, Eds., vol. 1853. Geneva, Switzerland: Springer-Verlag, Jul. 2000, pp. 524-535.
B. Baum-Waidner, "Optimistic asynchronous multi-party contract signing with reduced number of rounds," in Automata, Languages and Programming - ICALP 2001, ser. LNCS, F. Orejas, P. G. Spirakis, and J. van Leeuwen, Eds., vol. 2076. Crete, Greece: Springer-Verlag, Jul. 2001, pp. 898-911.
L. Adleman, "Short permutation strings," Discrete Math., vol. 10, pp. 197-200, 1974.
M. C. Newey, "Notes on a problem involving permutations as subsequences," Stanford University, Department of Computer Science, Stanford, CA, USA, Tech. Rep. STAN-CS-73-340, March 1973, http://infolab. stanford.edu/pub/cstr/reports/cs/tr/ 73/340/CS-TR-73-340.pdf.
S. P. Mohanty, "Shortest string containing all permutations," Discrete Math., vol. 31, pp. 91-95, 1980.
E. Zalinescu, "Shorter strings containing all k-element permutations," Inf. Process. Lett., vol. 111, no. 12, pp. 605-608, 2011.
S. Radomirović, "A construction of short sequences containing all permutations of a set as subsequences," unpublished.
C. Savage, "Short strings containing all k-element permutations," Discrete Math., vol. 42, pp. 281-285, 1982.
