Concrete Security for Entity Recognition: The Jane Doe Protocol

Stefan Lucks, Erik Zenner, Andre Weimerskirch, Dirk Westhoff

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


    Entity recognition does not ask whether the message is from some entity X, just whether a message is from the same entity as a previous message. This turns turns out to be very useful for low-end devices. The current paper proposes a new protocol – the “Jane Doe Protocol” –, and provides a formal proof of its concrete security. The protocol neither employs asymmetric cryptography, nor a trusted third party, nor any key pre-distribution. It is suitable for light-weight cryptographic devices such as sensor network motes and RFID tags.
    Original languageEnglish
    Title of host publicationProgress in Cryptology - INDOCRYPT 2008
    EditorsDipanwita Roy Chowdhury, Vincent Rijmen, Abhijit Das
    Number of pages437
    Publication date2008
    ISBN (Print)978-3-540-89753-8
    Publication statusPublished - 2008
    Event9th International Conference on Cryptology in India - Kharagpur, India
    Duration: 14 Dec 200817 Dec 2008
    Conference number: 9


    Conference9th International Conference on Cryptology in India
    Internet address
    SeriesLecture Notes in Computer Science


    Dive into the research topics of 'Concrete Security for Entity Recognition: The Jane Doe Protocol'. Together they form a unique fingerprint.

    Cite this