Computer Science – Cryptography and Security
Scientific paper
2010-09-01
Computer Science
Cryptography and Security
17 pages, 2 figures; draft
Scientific paper
A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting $n$ rounds, with no error correction. This requires assigning an acceptable threshold for the number of detected errors. This paper describes a framework enabling an expected loss analysis for all the protocols in this family. Furthermore, computationally simple methods to obtain nearly optimal value of the threshold, as well as for the number of rounds is suggested. Finally, a method to adaptively select both the number of rounds and the threshold is proposed.
Dimitrakakis Christos
Mitrokotsa Aikaterini
Vaudenay Serge
No associations
LandOfFree
Expected loss analysis of thresholded authentication protocols in noisy conditions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Expected loss analysis of thresholded authentication protocols in noisy conditions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Expected loss analysis of thresholded authentication protocols in noisy conditions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-374901