@article {15118,
	title = {Parallel and concurrent security of the HB and HB+ protocols},
	journal = {Journal of cryptology},
	volume = {23},
	year = {2010},
	month = {2010///},
	pages = {402 - 421},
	abstract = {Hopper and Blum (Asiacrypt 2001) and Juels and Weis (Crypto 2005) recently proposed two shared-key authentication protocols{\textemdash}HB and HB+, respectively{\textemdash}whose extremely low computational cost makes them attractive for low-cost devices such as radio-frequency identification (RFID) tags. The security of these protocols is based on the conjectured hardness of the {\textquotedblleft}learning parity with noise{\textquotedblright} (LPN) problem, which is equivalent to the problem of decoding random binary linear codes. The HB protocol is proven secure against a passive (eavesdropping) adversary, while the HB+ protocol is proven secure against active attacks.},
	doi = {10.1007/s00145-010-9061-2},
	author = {Katz, Jonathan and Shin,J. S and Smith,A.}
}
