C. M. Swanson and D. R. Stinson. Unconditionally secure signature schemes revisited. Journal of Mathematical Cryptology 10 (2016), 35-67.
S. Khattak, T. Elahi, L. Simon, C. M. Swanson, S. J. Murdoch and I. Goldberg. SoK: Making sense of censorship resistance systems. Proceedings on Privacy Enhancing Technologies 2016(4), 37–61.
C. M. Swanson and D. R. Stinson. Extended results on privacy against coalitions of users in user-private information retrieval protocols. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences 7 (2015), 415-437.
C. M. Swanson and D. R. Stinson. Additional constructions to solve the generalized Russian cards problem using combinatorial designs. Electronic Journal of Combinatorics 21 (2014), paper #P3.29, 31 pp.
D. R. Stinson, C. M. Swanson and T. van Trung. A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs. Discrete Mathematics 325 (2014), 23-31.
E. Wustrow, C. M. Swanson and J. A. Halderman. TapDance: End-to-middle anticensorship without flow blocking. In Proc. 23rd USENIX Security Symposium (USENIX '14), August 2014.
C. M. Swanson and D. R. Stinson. Combinatorial solutions providing improved security for the generalized Russian cards problem. Designs, Codes and Cryptography 72 (2014), 345-367.
M. Rushanan, D. F. Kune, C. M. Swanson, and A. D. Rubin. SoK: Security and privacy in implantable medical devices and body area networks. In Proc. IEEE Symposium on Security and Privacy (2014), 524-539. (Oakland 2014.)
C. M. Swanson and D. R. Stinson. Extended combinatorial constructions for peer-to-peer user-private information retrieval. Advances in Mathematics of Communications 6 (2012), 479-497.
C. M. Swanson and D. R. Stinson. Unconditionally secure signature schemes revisited. Lecture Notes in Computer Science 6673 (2011), 100-116. (ICITS 2011 Proceedings.)
C. M. Swanson, R. Urner and E. Lank. Naive security in a Wi-Fi world. IFIP Advances in Information and Communication Technology 321 (2010), 32-47. (IFIPTM 2010 Proceedings.)
C. M. Swanson and D. Jao. A study of two-party certificateless authenticated key agreement protocols. Lecture Notes in Computer Science 5922 (2009), 57-71. (INDOCRYPT 2009 Proceedings.)
K. Henry, C. M. Swanson, Q. Xie and K. Daudjee. Efficient hierarchical quorums in unstructured peer-to-peer networks. Lecture Notes in Computer Science 5870 (2009), 183-200. (CoopIS 2009 Proceedings.)