Concrete Security for Entity Recognition: The Jane Doe Protocol

Stefan Lucks; Erik Zenner; Andre Weimerskirch; Dirk Westhoff

Concrete Security for Entity Recognition: The Jane Doe Protocol

Stefan Lucks
, Erik Zenner
, Andre Weimerskirch
, Dirk Westhoff

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

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 language	English
Title of host publication	Progress in Cryptology - INDOCRYPT 2008
Editors	Dipanwita Roy Chowdhury, Vincent Rijmen, Abhijit Das
Number of pages	437
Publisher	Springer
Publication date	2008
Pages	158-171
ISBN (Print)	978-3-540-89753-8
Publication status	Published - 2008
Event	9th International Conference on Cryptology in India - Kharagpur, India Duration: 14 Dec 2008 → 17 Dec 2008 Conference number: 9 http://www.informatik.uni-trier.de/~ley/db/conf/indocrypt/indocrypt2008.html

Conference

Conference	9th International Conference on Cryptology in India
Number	9
Country/Territory	India
City	Kharagpur
Period	14/12/2008 → 17/12/2008
Internet address	http://www.informatik.uni-trier.de/~ley/db/conf/indocrypt/indocrypt2008.html

Series	Lecture Notes in Computer Science
Number	5365

OpenUrl availability

Check availability in DTU Findit

Cite this

@inproceedings{a2c081a4b1844d0aa4f4bed155e8147f,

title = "Concrete Security for Entity Recognition: The Jane Doe Protocol",

abstract = "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 {\textendash} the {\textquotedblleft}Jane Doe Protocol{\textquotedblright} {\textendash}, 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.",

author = "Stefan Lucks and Erik Zenner and Andre Weimerskirch and Dirk Westhoff",

year = "2008",

language = "English",

isbn = "978-3-540-89753-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "5365",

pages = "158--171",

editor = "Chowdhury, \{Dipanwita Roy\} and Vincent Rijmen and Abhijit Das",

booktitle = "Progress in Cryptology - INDOCRYPT 2008",

note = "9th International Conference on Cryptology in India, INDOCRYPT 2008 ; Conference date: 14-12-2008 Through 17-12-2008",

url = "http://www.informatik.uni-trier.de/\textasciitilde{}ley/db/conf/indocrypt/indocrypt2008.html",

}

Concrete Security for Entity Recognition: The Jane Doe Protocol. / Lucks, Stefan; Zenner, Erik; Weimerskirch, Andre et al.
Progress in Cryptology - INDOCRYPT 2008. ed. / Dipanwita Roy Chowdhury; Vincent Rijmen; Abhijit Das. Springer, 2008. p. 158-171 (Lecture Notes in Computer Science; No. 5365).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Concrete Security for Entity Recognition: The Jane Doe Protocol

AU - Lucks, Stefan

AU - Zenner, Erik

AU - Weimerskirch, Andre

AU - Westhoff, Dirk

N1 - Conference code: 9

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

M3 - Article in proceedings

SN - 978-3-540-89753-8

T3 - Lecture Notes in Computer Science

SP - 158

EP - 171

BT - Progress in Cryptology - INDOCRYPT 2008

A2 - Chowdhury, Dipanwita Roy

A2 - Rijmen, Vincent

A2 - Das, Abhijit

PB - Springer

T2 - 9th International Conference on Cryptology in India

Y2 - 14 December 2008 through 17 December 2008

ER -

Concrete Security for Entity Recognition: The Jane Doe Protocol

Abstract

Conference

OpenUrl availability

Fingerprint

Cite this