{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:27Z","timestamp":1725487107130},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73458-1_28","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:09:27Z","timestamp":1183561767000},"page":"385-399","source":"Crossref","is-referenced-by-count":2,"title":["Non-interactive Manual Channel Message Authentication Based on eTCR Hash Functions"],"prefix":"10.1007","author":[{"given":"Mohammad Reza","family":"Reyhanitabar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuhong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reihaneh","family":"Safavi-Naini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Balfanz, D., Smetters, D.K., Stewart, P., Wong, H.C.: Talking to Strangers: Authentication in ad-hoc Wireless Networks. In: Network and Distributed Sytem Security Symposium, San Diego, California, USA (February 2002)","key":"28_CR1"},{"unstructured":"Bellare, M., Rogaway, P.: Introduction to Modern Cryptography (Page 3 of) Chapter 5: Hash Functions. Available at Bellare\u2019s homepage via: http:\/\/www-cse.ucsd.edu\/users\/mihir\/cse207\/index.html","key":"28_CR2"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/BFb0052256","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Rogaway, P.: Collision-Resistant Hashing: Towards Making UOWHFs Practical. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 470\u2013484. Springer, Heidelberg (1997)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10623-003-6154-z","volume":"35","author":"D. Brown","year":"2005","unstructured":"Brown, D.: Generic Groups, Collision Resistance and ECDSA. Journal of Designs, Codes and Cryptography\u00a035, 119\u2013152 (2005)","journal-title":"Journal of Designs, Codes and Cryptography"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-39118-5_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201987","author":"I.B. Damg\u00e5rd","year":"1988","unstructured":"Damg\u00e5rd, I.B.: Collision Free Hash Functions and Public Key Signature Schemes. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0304, pp. 203\u2013216. Springer, Heidelberg (1988)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I.B. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A Design Principle for Hash Functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"issue":"1","key":"28_CR7","first-page":"29","volume":"7","author":"C. Gehrmann","year":"2004","unstructured":"Gehrmann, C., Mitchell, C.J., Nyberg, K.: Manual Authentication for Wireless Devices. RSA Cryptobytes\u00a07(1), 29\u201337 (2004)","journal-title":"RSA Cryptobytes"},{"doi-asserted-by":"crossref","unstructured":"Gehrmann, C., Nyberg, K.: Security in Personal Area Networks. Security for Mobility, IEE, London, pp. 191\u2013230 (2004)","key":"28_CR8","DOI":"10.1049\/PBTE051E_ch9"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11818175_3","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"S. Halevi","year":"2006","unstructured":"Halevi, S., Krawczyk, H.: Strengthening Digital Signatures Via Randomized Hashing. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 41\u201359. Springer, Heidelberg (2006)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-3-540-30539-2_15","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"D. Hong","year":"2004","unstructured":"Hong, D., Preneel, B., Lee, S.: Higher Order Universal One-Way Hash Functions. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 201\u2013213. Springer, Heidelberg (2004)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/11426639_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J. Kelsey","year":"2005","unstructured":"Kelsey, J., Schneier, B.: Second Preimages on n-Bit Hash Functions for Much Less than 2n Work. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 474\u2013490. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Mashatan, A., Stinson, D.R.: Noninteractive Two-Channel Message Authentication Based on Hybrid-Collision Resistant Hash Functions. Cryptology ePrint Archive, Report 2006\/302","key":"28_CR12","DOI":"10.1049\/iet-ifs:20060131"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R. Merkle","year":"1990","unstructured":"Merkle, R.: One Way Hash Functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 428\u2013446. Springer, Heidelberg (1990)"},{"doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal One-Way Hash Functions and Their Cryptographic Applications. In: Proc. of 21st ACM Symposium on the Theory of Computing, pp. 387\u2013394 (1990)","key":"28_CR14","DOI":"10.1145\/73007.73011"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/11818175_13","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M. Naor","year":"2006","unstructured":"Naor, M., Segev, G., Smith, A.: Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 214\u2013231. Springer, Heidelberg (2006)"},{"unstructured":"Preneel, B.: Analysis and Design of Cryptographic Hash Functions. Doctoral dissertation, K. U. Leuven (1993)","key":"28_CR16"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11605805_18","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"S. Pasini","year":"2006","unstructured":"Pasini, S., Vaudenay, S.: An Optimal Non-interactive Message Authentication Protocol. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol.\u00a03860, pp. 280\u2013294. Springer, Heidelberg (2006)"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-540-25937-4_24","volume-title":"Fast Software Encryption","author":"P. Rogaway","year":"2004","unstructured":"Rogaway, P., Shrimpton, T.: Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol.\u00a03017, pp. 371\u2013388. Springer, Heidelberg (2004)"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11958239_14","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"P. Rogaway","year":"2006","unstructured":"Rogaway, P.: Formalizing Human Ignorance: Collision-Resistant Hashing without the Keys. In: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 221\u2013228. Springer, Heidelberg (2006)"},{"unstructured":"Rivest, R.: Abelian Square-Free Dithering for Iterated Hash Functions. Presented at ECRYPT Hash Function Workshop, Cracow (June 21, 2005)","key":"28_CR20"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10623-005-6344-y","volume":"38","author":"D.R. Stinson","year":"2006","unstructured":"Stinson, D.R.: Some Observation on the Theory of Cryptographic Hash Functions. Journal of Design, Codes and Cryptography\u00a038, 259\u2013277 (2006)","journal-title":"Journal of Design, Codes and Cryptography"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/11535218_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"S. Vaudenay","year":"2005","unstructured":"Vaudenay, S.: Secure Communications over Insecure Channels Based on Short Authenticated Strings. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 309\u2013326. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73458-1_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:15:33Z","timestamp":1605762933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73458-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734574"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73458-1_28","relation":{},"subject":[]}}