Mike Burmester

Selected Publications

  • Mike Burmester, Prasanta Das, Martin Edwards and Alec Yasinsac. `Multi-Domain trust managerment in variable threat environments using rollback-access'. Military Communications Conference, 2008 (MILCOM 2008), IEEE, San Diego, November 17-19, 2008.
  • Mike Burmester, Emmanuel Magkos and Vassilis Chrissikopoulos. `Strengthening Privacy Protection in VANETs'. Proceedings, IEEE WiMob2008, International Workshop on Security and Privacy in Wireless and Mobile Computing, Networking and Communications (SecPriWiMob 2008), Avignon, France, October 12-14, 2008.
  • Binay Battacharia, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, and Qiaoshweng Shi. `Optimal movement of mobile sensors for barrier coverage of a planar region'. 2nd International Conference on Combinatorial Optimization and Applications (COCOA 2008), St John's, Newfoundland, Canada, August 21-24, 2008. (pdf version)
  • Mike Burmester, Breno de Medeiros Rossana Motta. `Provably Secure Grouping-proofs for RFID tags'. International Conference, 8th Smart Card Research and Advanced Applications (CARDIS 2008), IFIP WG 8.8/11.2, September 8-11, 2008. (pdf version)
  • Mike Burmester, Breno de Medeiros. `The Security of EPCGen2 Anonymous compliant RFID Protocols'. International Conference on Applied Cryptography and Network Security, ACNS 2008, Columbia University, New York, June 2008. (pdf version)
  • Mike Burmester, Breno de Medeiros Rossana Motta. `Robust Anonymous RFID Authentication with Constant Key Lookup'. ACM Symposium on Information, Computer and Communications Security, ASIACCS 2008, Tokyo, March 2008. (pdf version)
  • Mike Burmester and Breno de Medeiros. `Towards provable security for route discovery protocols in mobile ad hoc networks'. Cryptology ePrint Archive, 2007/324. (pdf version)
  • Mike Burmester and Breno de Medeiros. `Persistent Security for RFID'. Conference on RFID Security, RFIDSec07, Malaga, July, 2007. (pdf version)
  • Mike Burmester and Breno de Medeiros. `RFID Security, Countermeasures and Challenges'. 5th RFID Academic Convocation, The RFID Journal Conference, Orlando, April 30 - May 2, 2007 (pdf version)
  • Tri van Le, Mike Burmester Breno de Medeiros. `Universally Composable and Forward Secure RFID Authentication and Key exchange'. ACM Symposium on Information, Computer and Communications Security, ASIACCS 2007, Singapore, March 2007. (pdf version)
  • Mike Burmester, Tri van Le and Breno de Medeiros. `Provably Secure Ubiquitous Systems: Universally Composable RFID Authentication Protocols'. 2nd Int. Conference on Security and Privacy in Communication Networks (SecureComm), Baltimore, Aug 2006 (pdf version)
  • Mike Burmester, Tri van Le, and Breno de Medeiros. `Towards provable security for ubiquitous applications’. Proc. 11th Australasian Conf. on Information Security and Privacy (ACISP 2006), Melbourne, Australia, July 2006, Lecture Notes in Computer Science #4058, Springer, 2006, pp. 295-312 (pdf version)
  • Christy Chatmon, Tri van Le and Mike Burmester. `Secure Anonymous RFID Protocols'. (pdf version)
  • Mike Burmester and Judy Mulholand. `The Advent of Trusted Computing: Implications for Digital Forensics'. 21st ACM Symposium on Applied Computing, Computer Forensics Track, April 2006, Dijon, France. (pdf version)
  • Mike Burmester, Tri van Le and Alec Yasinsac. `Adaptive gossip protocols: managing security and redundancy in dense ad hoc networks.' Journal of Ad hoc Networks, Elsevier, 4(3), pp. 504-515, 2006. (pdf version)
  • Mike Burmester, Peter Henry and Leo S. Kermes. `Traking Cyberstalkers: a cryptographic approach.' Computer & Society Magazine, ACM SIGCAS, 35(3-4), September 2005. (pdf version)
  • Mike Burmester and Yvo Desmedt. `A secure and scalable group key exchange system' Information Processing Letters, 94(3), pp. 137--143, 2005. (pdf version)
  • Mike Burmester and Yvo Desmedt. `Hierarchical public-key Certification: The Next Target for Hackers?' Communicatuions of the ACM, 47(8), pp. 86--74, August 2004. (cacm version) (pdf version)
  • Yvo Desmedt and Mike Burmester. `Identity based Key Infrastructures'. Procedings of the IFIP World Computer Congress (WCC2004-SEC), Toulouse, France, August 22-27, 2004. (pdf version)
  • Mike Burmester, Tri van Le and Alec Yasinsac. `Weathering the storm: managing redundancy and security in ad hoc networks'. Proceedings of the 3rd International Conference on AD-HOC Networks & Wireless, Vancouver, British Columbia, pp. 96--107, July 22-24, 2004, (pdf version)
  • Mike Burmester and Tri van Le. `Secure Communication in Ad hoc Networks'. Proceedings of the IEEE Workshop on Information Assurance and Security', West Point, NY, pp. 234--241, June 2004. (pdf version)
  • M. Burmester and T. van Le. `Secure Multipath Communication in Mobile Ad hoc Networks'. International Conference on Information Technology: Coding and Computing (ITCC 2004), Las Vegas, April 5-7, 2004 (pdf version)
  • M. Burmester, Y. Desmedt and Y. Wang. `A critical analysis of models for fault-tolerant and secure communication'. Communication, Network and Information Security 2003, Dec 10-12 2003, New York, pp.147-152. (pdf version)
  • M. Burmester T. van Le and M. Weir. `Tracing Byzantine faults in ad hoc networks'. Communication, Network and Information Security 2003, Dec 10-12 2003, New York, pp.43-46. (rtf file)
  • T. Van Le, M. Burmester and J. Hu. `Short c-secure Fingerprinting Codes', Proceedings of the 6th Information Security Conference (ISC'03), October 1-3, 2003, Bristol, UK. pp 422-428. (pdf version)
  • Y. Desmedt, M. Burmester and Y. Wang. `Using economics to model threats and security in distributed computing', Extended Abstract. Workshop on Economics and Information Security, University of California, Berkeley, May 16-17, 2002. (pdf version)
  • Y. Desmedt, M. Burmester and J. Seberry. `Equitability in Retroactive Data Confiscation versus Proactive Key Escrow'. 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001. Lecture Notes in Computer Science #1992, Springer, Berlin, pp 277-286, 2001. (postscript version)
  • A. Beimel, M. Burmester, Y. Desmedt, and E. Kushilevitz. `Computing Functions of a Shared Secret'. SIAM J. on Discrete Mathematics, 13(3), pp. 324-345, 2000. (postscript version)
  • Mike Burmester and Yvo G. Desmedt, `Secure Communication in an Unknown Network Using Certificates', Advances in Cryptology - Asiacrypt '99, Lecture Notes in Computer Science 1716, Springer, Berlin, pp. 274--287, 1999. (postscript version)
  • M. Burmester, Y.G. Desmedt, T. Itoh, K. Sakurai and H. Shizuya. `Divertible and subliminal-free zero-knowledge proofs of languages' The Journal of Cryptology, Springer, Berlin, 12, pp. 197--223, 1999. (postscript version)
  • Mike Burmester, Yvo G. Desmedt, Jennifer Seberry, `Equitable Key Escrow with Limited Time Span (or How to Enforce Time Expiration Cryptographically', Advances in Cryptology - Asiacrypt '98, Lecture Notes in Computer Science 1514, Springer, Berlin, pp. 380--391, 1998. (postscript version)
  • Kaoru Kurosawa, Takuya Yoshida, Yvo G. Desmedt, Mike Burmester, `Some Bounds and a Construction for Secure Broadcast Encryption', Advances in Cryptology - Asiacrypt '98, Lecture Notes in Computer Science 1514, Springer, Berlin, pp. 420--433, 1998.
  • M. Burmester, Y. Desmedt, Y. Wang, `Using Approximation Hardness to Achieve Dependable Computation', Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science 1518, Springer, Berlin, pp. 172--186, 1998.
  • M.V.D. Burmester and Y.G. Desmedt, `Secure Communication in an Unknown Network with Byzantine Faults', in Electronics Letters, Vol 34(8), pp.~741--742, 1998.
  • M. Burmester, Y.G. Desmedt, F.C. Piper, and M. Walker, `A general zero-knowledge scheme', Designs Codes and Cryptography, Vol 12(1), pp. 13--37, 1997.
  • L.A. Bassalygo, M. Burmester, A. Dyachkov and G. Kabatianski, `Hash Codes', Proceedings 1997 IEEE International Symposium on Information Theory, ISIT'1997, IEEE, p.174. (postscript version)
  • M. Burmester, Y. Desmedt and G. Kabatianski, `Trust and Security: A New Look at the Byzantine Generals Problem', Proceedings of the DIMACS Workshop on Network Threats, December 1996, R.R. Wright, P. Neuman (Eds.), American Mathematical Society, DIMACS Series, 1997. (postscript version)
  • N. Alexandris, M. Burmester, V. Chrissikopoulos, `Secure Group Communications: a dynamic approach', Communications and Multimedia Security (CMS'97), S.K. Katsikas (Ed.), Communications and Multimedia Security (CMS'97), Chapman & Hall, Vol 1, pp. 41--51, 1997.
  • M. Burmester, Y. Desmedt, T. Itoh, K. Sakurai, H. Shizuya, and Moti Yung, `A progress report on Subliminal-Free Channels', in Information Hiding, First International Workshop, Cambridge May/June 1996, Lecture Notes in Computer Science 1174, R. Anderson (Ed.), Springer, Berlin, 1996, pp. 157-168.
  • M. Burmester and Y. Desmedt, `Efficient and Secure Conference Key Distribution', in Security Protocols, International Workshop, Cambridge April 1996, Lecture Notes in Computer Science 1189, M. Lomas (Ed.), Springer, Berlin, 1996, pp. 119-129.
  • M. Burmester, N. Alexandris, V. Chrissikopoulos and D. Peppes, `Efficient and provably secure key agreement', in Information Systems Security, Facing the Information Society of the 21st century, IFIP SEC '96, S.K. Katsikas and D. Gritzalis (Eds.), Chapman & Hall, 1996, pp. 227-236.
  • S.R. Blackburn, M. Burmester, Y. Desmedt and P.R. Wild, `Efficient Multiplicative Sharing Schemes', in Advances in Cryptology - Eurocrypt '96, Lecture Notes in Computer Science 1070, U. Maurer (Ed.), Springer, Berlin, 1996, pp. 107-118.
  • M. Burmester, `Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing', in Advances in Cryptology - Eurocrypt '96, Lecture Notes in Computer Science 1070, U. Maurer (Ed.), Springer, Berlin, 1996, pp. 96-106.
  • Y. Desmedt, G. Di Crescenzo and M. Burmester, `Multiplicative Non-Abelian Sharing Schemes and their Application to Threshold Cryptography', in Advances in Cryptology - Asiacrypt '94, Lecture Notes in Computer Science 917, J Pieprzyk and R Safavi-Naini (Eds.), Springer, Berlin, 1995, pp. 21-32.
  • M. Burmester and Y. Desmedt, `A secure and efficient conference key distribution system', in Advances in Cryptology - Pre-Proceedings of Eurocrypt '94 (this version includes the proofs of the protocols in the Eurocrypt '94 paper). (pdf version)
  • M. Burmester and Y. Desmedt, `A secure and efficient conference key distribution system', in Advances in Cryptology - Eurocrypt '94, Lecture Notes in Computer Science 950, A. De Santis (Ed.), Springer, Berlin, 1995, pp. 275-286.
  • M. Burmester, `On the Risk of Opening Distributed Keys', in Advances in Cryptology - Crypto '94, Lecture Notes in Computer Science 839, Y. Desmedt (Ed.), Springer, Berlin, 1994, pp. 308-317.
  • Y. Frankel, Y. Desmedt, and M. Burmester, `Non-existence of homomorphic general sharing schemes for some key spaces', in Advances in Cryptology - Crypto '92, Lecture Notes in Computer Science 740, E. Brickell (Ed.), Springer, Berlin, 1993, pp. 549-557.
  • Y. Desmedt and M. Burmester, `An efficient zero-knowledge scheme for the discrete logarithm based on smooth numbers', in Advances in Cryptology - Asiacrypt '91, Lecture Notes in Computer Science 739, H. Imai, R.L. Rivest, and T. Matsumoto (Eds.), Springer-Verlag, Berlin, 1992, pp. 360-367.
  • Y. Desmedt and M. Burmester, `Towards practical proven secure authenticated key distribution', in Proceedings 1st ACM Conference on Computer and Communication Security, Fairfax, Virginia, ACM Press 1993, pp. 228-231.
  • M. Burmester, Y. Desmedt, and M. Yung, `Canali subliminal-free: Una soluzione verso canali covert-free', in Rivista di Informatica, Vol. XXIII(1), pp. 5-14, 1993.
  • M. Burmester and Y. Desmedt, `Zero-knowledge based identification: from a theoretical concept towards a practical token', in Education and Society, Information Processing 92, Proceedings of the IFIP 12th World Computer Congress, Volume II, R.M. Aiken (Ed.), North Holland, Madrid 1992, pp. 479-485.
  • M. Burmester, V. Chrissikopoulos, and N. Alexandris, `An efficient public key distribution system', in Education and Society, Information Processing 92', Proceedings of the IFIP 12th World Computer Congress, Volume II, R.M. Aiken (Ed.), North Holland, Madrid 1992, pp. 532-539.
  • M. Burmester, `An almost-constant round interactive zero-knowledge proof' in Information Processing Letters , Vol 42(2), pp. 81-87, 1992.
  • M. Burmester, Y. Desmedt, and T. Beth, `Efficient zero-knowledge identification schemes for smart cards', in The Computer Journal, Special issue on Safety and Security, Vol 35(1), pp. 21-29, 1992.
  • M. Burmester and Y. Desmedt, `Broadcast interactive proofs', in Advances in Cryptology - Eurocrypt '91, Lecture Notes in Computer Science 547, D.W. Davies (Ed.), Springer-Verlag, Berlin, 1991, pp. 81-95.
  • M. Burmester, Y. Desmedt, and M. Yung, `Subliminal-free channels: a solution towards covert-free channels', in Symposium on Computer Security, Threats and Countermeasures, W. Wolfowicz (Ed.), Fondazione Ugo Bordoni, Rome, 1991, pp. 188-197.
  • M. Burmester, `A remark on the efficiency of identification schemes', in Advances in Cryptology - Eurocrypt '90, Lecture Notes in Computer Science 473, I. Damgard (Ed.), Springer-Verlag, Berlin, 1991, pp. 493-495.
  • M. Burmester and Y. Desmedt, `All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions', in Advances in Cryptology - Eurocrypt '90, Lecture Notes in Computer Science 473, I. Damgard (Ed.), Springer-Verlag, Berlin, 1991, pp. 1-10.
  • M.V.D. Burmester, Y.G. Desmedt, F.C. Piper, and M. Walker, `A general zero-knowledge scheme', in Advances in Cryptology - Eurocrypt '89, Lecture Notes in Computer Science 434, J.-J. Quisquater and J. Vandewalle (Eds.), Springer-Verlag, Berlin, 1990, pp. 122-133.
  • M.V.D. Burmester and Y.G. Desmedt, `Remarks on the soundness of proofs', in Electronics Letters, Vol 25, pp. 1509-1511, 1989.

Return to home page.

Last edited by Mike Burmester, August 10, 2004