| 2008 |
|---|
| 67 | EE | Mike Burmester,
Breno de Medeiros:
The Security of EPC Gen2 Compliant RFID Protocols.
ACNS 2008: 490-506 |
| 66 | EE | Mike Burmester,
Breno de Medeiros,
Rossana Motta:
Robust, anonymous RFID authentication with constant key-lookup.
ASIACCS 2008: 283-291 |
| 65 | EE | Mike Burmester,
Breno de Medeiros,
Rossana Motta:
Provably Secure Grouping-Proofs for RFID Tags.
CARDIS 2008: 176-190 |
| 64 | EE | Gene Tsudik,
Mike Burmester,
Ari Juels,
Alfred Kobsa,
David Molnar,
Roberto Di Pietro,
Melanie R. Rieback:
RFID security and privacy: long-term research or short-term tinkering?
WISEC 2008: 160 |
| 63 | EE | Mike Burmester,
Emmanouil Magkos,
Vassilios Chrissikopoulos:
Strengthening Privacy Protection in VANETs.
WiMob 2008: 508-513 |
| 62 | EE | Mike Burmester,
Breno de Medeiros,
Rossana Motta:
Anonymous RFID authentication supporting constant-cost key-lookup against active adversaries.
IJACT 1(2): 79-90 (2008) |
| 2007 |
|---|
| 61 | EE | Tri Van Le,
Mike Burmester,
Breno de Medeiros:
Universally composable and forward-secure RFID authentication and authenticated key exchange.
ASIACCS 2007: 242-252 |
| 60 | EE | Yvo Desmedt,
Tanja Lange,
Mike Burmester:
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups.
Financial Cryptography 2007: 104-118 |
| 59 | EE | Mike Burmester,
Tri Van Le,
Alec Yasinsac:
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks.
Ad Hoc Networks 5(3): 313-323 (2007) |
| 2006 |
|---|
| 58 | | Mike Burmester,
Alec Yasinsac:
Secure Mobile Ad-hoc Networks and Sensors, First International Workshop, MADNES 2005, Singapore, September 20-22, 2005, Revised Selected Papers
Springer 2006 |
| 57 | EE | Mike Burmester,
Tri Van Le,
Breno de Medeiros:
Towards Provable Security for Ubiquitous Applications.
ACISP 2006: 295-312 |
| 56 | EE | Jiangyi Hu,
Mike Burmester:
LARS: a locally aware reputation system for mobile ad hoc networks.
ACM Southeast Regional Conference 2006: 119-123 |
| 55 | EE | Yvo Desmedt,
Yongge Wang,
Mike Burmester:
Revisiting Colored Networks and Privacy Preserving Censorship.
CRITIS 2006: 140-150 |
| 54 | EE | Mike Burmester,
Judie Mulholland:
The advent of trusted computing: implications for digital forensics.
SAC 2006: 283-287 |
| 2005 |
|---|
| 53 | EE | Yvo Desmedt,
Yongge Wang,
Mike Burmester:
A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback.
ISAAC 2005: 277-287 |
| 52 | EE | Mike Burmester,
Virgil D. Gligor,
Evangelos Kranakis,
J. D. Tygar,
Yuliang Zheng:
Panel: Authentication in Constrained Environments.
MADNES 2005: 186-191 |
| 51 | EE | Sudhir Aggarwal,
Mike Burmester,
Peter Henry,
Leo Kermes,
Judie Mulholland:
Anti-Cyberstalking: The Predator and Prey Alert (PAPA) System.
SADFE 2005: 195-205 |
| 50 | EE | Mike Burmester,
Breno de Medeiros,
Alec Yasinsac:
Community-Centric Vanilla-Rollback Access, or: How I Stopped Worrying and Learned to Love My Computer.
Security Protocols Workshop 2005: 228-237 |
| 49 | EE | Mike Burmester:
Group Key Agreement.
Encyclopedia of Cryptography and Security 2005 |
| 48 | EE | Alec Yasinsac,
Mike Burmester:
Centers of Academic Excellence: A Case Study.
IEEE Security & Privacy 3(1): 62-65 (2005) |
| 47 | EE | Mike Burmester,
Yvo Desmedt:
A secure and scalable Group Key Exchange system.
Inf. Process. Lett. 94(3): 137-143 (2005) |
| 2004 |
|---|
| 46 | EE | Mike Burmester,
Tri Van Le,
Alec Yasinsac:
Weathering the Storm: Managing Redundancy and Security in Ad Hoc Networks.
ADHOC-NOW 2004: 96-107 |
| 45 | EE | Mike Burmester,
Tri Van Le:
Secure Multipath Communication in Mobile Ad hoc Networks.
ITCC (2) 2004: 405-409 |
| 44 | | Yvo Desmedt,
Mike Burmester:
Identity-based Key Infrastructures (IKI).
SEC 2004: 167-176 |
| 43 | EE | Mike Burmester,
Yvo Desmedt,
Rebecca N. Wright,
Alec Yasinsac:
Accountable Privacy.
Security Protocols Workshop 2004: 83-95 |
| 42 | EE | Mike Burmester,
Yvo Desmedt:
Is hierarchical public-key certification the next target for hackers?
Commun. ACM 47(8): 68-74 (2004) |
| 41 | EE | Mike Burmester,
Emmanouil Magkos,
Vassilios Chrissikopoulos:
Uncoercible e-Bidding Games.
Electronic Commerce Research 4(1-2): 113-125 (2004) |
| 2003 |
|---|
| 40 | EE | Tri Van Le,
Mike Burmester,
Jiangyi Hu:
Short c-Secure Fingerprinting Codes.
ISC 2003: 422-427 |
| 39 | EE | Mike Burmester,
Alec Yasinsac:
Protocols for Supporting a Public Key Infrastructure in Ad Hoc Networks.
Security Protocols Workshop 2003: 274-282 |
| 2001 |
|---|
| 38 | | Panayiotis Kotzanikolaou,
Mike Burmester,
Vassilios Chrissikopoulos:
Dynamic Multi-signatures for Secure Autonomous Agents.
DEXA Workshop 2001: 587-591 |
| 37 | | Emmanouil Magkos,
Mike Burmester,
Vassilios Chrissikopoulos:
Receipt-Freeness in Large-Scale Elections without Untappable Channels.
I3E 2001: 683-694 |
| 36 | EE | Yvo Desmedt,
Mike Burmester,
Jennifer Seberry:
Equitability in Retroactive Data Confiscation versus Proactive Key Escrow.
Public Key Cryptography 2001: 277-286 |
| 35 | | Mike Burmester,
Vassilios Chrissikopoulos,
Panayiotis Kotzanikolaou,
Emmanouil Magkos:
Strong Forward Security.
SEC 2001: 109-122 |
| 2000 |
|---|
| 34 | | Panayiotis Kotzanikolaou,
Mike Burmester,
Vassilios Chrissikopoulos:
Secure Transactions with Mobile Agents in Hostile Environments.
ACISP 2000: 289-297 |
| 33 | EE | Carlisle M. Adams,
Mike Burmester,
Yvo Desmedt,
Michael K. Reiter,
Philip Zimmermann:
Which PKI (public key infrastructure) is the right one? (panel session).
ACM Conference on Computer and Communications Security 2000: 98-101 |
| 32 | EE | Emmanouil Magkos,
Mike Burmester,
Vassilios Chrissikopoulos:
An Equitably Fair On-line Auction Scheme.
EC-Web 2000: 72-83 |
| 31 | | Mike Burmester,
Yvo Desmedt,
Hiroshi Doi,
Masahiro Mambo,
Eiji Okamoto,
Mitsuru Tada,
Yuko Yoshifuji:
A Structured ElGamal-Type Multisignature Scheme.
Public Key Cryptography 2000: 466-483 |
| 30 | | Yongge Wang,
Yvo Desmedt,
Mike Burmester:
Models For Dependable Computation with Multiple Inputs and Some Hardness Results.
Fundam. Inform. 42(1): 61-73 (2000) |
| 29 | EE | Nikos Alexandris,
Mike Burmester,
Vassilios Chrissikopoulos,
Yvo Desmedt:
Secure linking of customers, merchants and banks in electronic commerce.
Future Generation Comp. Syst. 16(4): 393-401 (2000) |
| 28 | EE | Amos Beimel,
Mike Burmester,
Yvo Desmedt,
Eyal Kushilevitz:
Computing Functions of a Shared Secret.
SIAM J. Discrete Math. 13(3): 324-345 (2000) |
| 1999 |
|---|
| 27 | | Mike Burmester,
Yvo Desmedt:
Secure Communication in an Unknown Network Using Certificates.
ASIACRYPT 1999: 274-287 |
| 26 | EE | Simon R. Blackburn,
Simon Blake-Wilson,
Mike Burmester,
Steven D. Galbraith:
Weaknesses in Shared RSA Key Generation Protocols.
IMA Int. Conf. 1999: 300-306 |
| 25 | EE | Mike Burmester,
Yvo Desmedt,
Toshiya Itoh,
Kouichi Sakurai,
Hiroki Shizuya:
Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages.
J. Cryptology 12(3): 197-223 (1999) |
| 1998 |
|---|
| 24 | EE | Mike Burmester,
Yvo Desmedt,
Jennifer Seberry:
Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically).
ASIACRYPT 1998: 380-391 |
| 23 | EE | Kaoru Kurosawa,
Takuya Yoshida,
Yvo Desmedt,
Mike Burmester:
Some Bounds and a Construction for Secure Broadcast Encryption.
ASIACRYPT 1998: 420-433 |
| 22 | EE | Mike Burmester,
Yvo Desmedt,
Yongge Wang:
Using Approximation Hardness to Achieve Dependable Computation.
RANDOM 1998: 172-186 |
| 1997 |
|---|
| 21 | | Mike Burmester,
Yvo Desmedt,
Fred Piper,
Michael Walker:
A General Zero-Knowledge Scheme.
Des. Codes Cryptography 12(1): 13-37 (1997) |
| 1996 |
|---|
| 20 | EE | Simon R. Blackburn,
Mike Burmester,
Yvo Desmedt,
Peter R. Wild:
Efficient Multiplicative Sharing Schemes.
EUROCRYPT 1996: 107-118 |
| 19 | EE | Mike Burmester:
Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing.
EUROCRYPT 1996: 96-106 |
| 18 | | Mike Burmester,
Yvo Desmedt,
Toshiya Itoh,
Kouichi Sakurai,
Hiroki Shizuya,
Moti Yung:
A Progress Report on Subliminal-Free Channels.
Information Hiding 1996: 157-168 |
| 17 | | Nikos Alexandris,
Mike Burmester,
Vassilios Chrissikopoulos,
D. Peppes:
Efficient and provably secure key agreement.
SEC 1996: 227-236 |
| 16 | | Mike Burmester,
Yvo Desmedt:
Efficient and Secure Conference-Key Distribution.
Security Protocols Workshop 1996: 119-129 |
| 1994 |
|---|
| 15 | | Yvo Desmedt,
Giovanni Di Crescenzo,
Mike Burmester:
Multiplicative Non-abelian Sharing Schemes and their Application to Threshold Cryptography.
ASIACRYPT 1994: 21-32 |
| 14 | EE | Mike Burmester:
On the Risk of Opening Distributed Keys.
CRYPTO 1994: 308-317 |
| 13 | EE | Mike Burmester,
Yvo Desmedt:
A Secure and Efficient Conference Key Distribution System (Extended Abstract).
EUROCRYPT 1994: 275-286 |
| 1993 |
|---|
| 12 | EE | Yvo Desmedt,
Mike Burmester:
Towards Practical ``Proven Secure'' Authenticated Key Distribution.
ACM Conference on Computer and Communications Security 1993: 228-231 |
| 11 | EE | Mike Burmester:
Cryptoanalysis of the Chang-Wu-Chen Key Distribution System.
EUROCRYPT 1993: 440-442 |
| 1992 |
|---|
| 10 | EE | Yair Frankel,
Yvo Desmedt,
Mike Burmester:
Non-Existence of Homomorphic General Sharing Schemes for Some Key Spaces (Extended Abstract).
CRYPTO 1992: 549-557 |
| 9 | | Mike Burmester,
Yvo Desmedt:
Zero-Knowledge Based Identification: From a Theoretical Concept Towards a Practical Token.
IFIP Congress (2) 1992: 479-485 |
| 8 | | Nikos Alexandris,
Mike Burmester,
Vassilios Chrissikopoulos:
An Efficient Public Key Distribution System.
IFIP Congress (2) 1992: 532-539 |
| 7 | | Mike Burmester,
Yvo Desmedt,
Thomas Beth:
Efficient Zero-Knowledge Identification Schemes for Smart Cards.
Comput. J. 35(1): 21-29 (1992) |
| 6 | | Mike Burmester:
An Almost-Constant Round Interactive Zero-Knowledge Proof.
Inf. Process. Lett. 42(2): 81-87 (1992) |
| 1991 |
|---|
| 5 | | Yvo Desmedt,
Mike Burmester:
An Efficient Zero-Knowledge Scheme for the Discrete Logarithm Based on Smooth Numbers.
ASIACRYPT 1991: 360-367 |
| 4 | EE | Mike Burmester,
Yvo Desmedt:
Broadcast Interactive Proofs (Extended Abstract).
EUROCRYPT 1991: 81-95 |
| 1990 |
|---|
| 3 | EE | Mike Burmester:
Yvo Desmedt: All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions.
EUROCRYPT 1990: 1-10 |
| 2 | EE | Mike Burmester:
A Remark on the Efficiency of Identification Schemes.
EUROCRYPT 1990: 493-495 |
| 1989 |
|---|
| 1 | EE | Mike Burmester,
Yvo Desmedt,
Fred Piper,
Michael Walker:
A General Zero-Knowledge Scheme (Extended Abstract).
EUROCRYPT 1989: 122-133 |
