{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T23:40:08Z","timestamp":1746402008767,"version":"3.40.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319124742"},{"type":"electronic","value":"9783319124759"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12475-9_7","type":"book-chapter","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T09:25:19Z","timestamp":1412155519000},"page":"87-102","source":"Crossref","is-referenced-by-count":8,"title":["Forward-Secure Sequential Aggregate Message Authentication Revisited"],"prefix":"10.1007","author":[{"given":"Shoichi","family":"Hirose","sequence":"first","affiliation":[]},{"given":"Hidenori","family":"Kuwakado","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/11818175_36","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M.: New proofs for NMAC and HMAC: Security without collision-resistance. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 602\u2013619. Springer, Heidelberg (2006), The full version is \u201cCryptology ePrint Archive: Report 2006\/043\u201d at http:\/\/eprint.iacr.org\/"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Pseudorandom functions revisited: The cascade construction and its concrete security. In: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pp. 514\u2013523 (1996)","DOI":"10.1109\/SFCS.1996.548510"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-48405-1_28","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Bellare","year":"1999","unstructured":"Bellare, M., Miner, S.K.: A forward-secure digital signature scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 431\u2013448. Springer, Heidelberg (1999)"},{"key":"7_CR4","unstructured":"Bellare, M., Yee, B.S.: Forward integrity for secure audit logs. Technical report, University of California, San Diego (1997)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36563-X_1","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Yee, B.S.: Forward-security in private-key cryptography. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 1\u201318. Springer, Heidelberg (2003), The full version is IACR Cryptology ePrint Archive: Report 2001\/035 at http:\/\/eprint.iacr.org\/"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal of Computing\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM Journal of Computing"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-15317-4_20","volume-title":"Security and Cryptography for Networks","author":"O. Eikemeier","year":"2010","unstructured":"Eikemeier, O., Fischlin, M., G\u00f6tzmann, J.-F., Lehmann, A., Schr\u00f6der, D., Schr\u00f6der, P., Wagner, D.: History-free aggregate message authentication codes. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol.\u00a06280, pp. 309\u2013328. Springer, Heidelberg (2010)"},{"key":"7_CR8","unstructured":"FIPS PUB 198-1. The keyed-hash message authentication code, HMAC (2008)"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"Journal of the ACM"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-46885-4_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"C.G. G\u00fcnther","year":"1990","unstructured":"G\u00fcnther, C.G.: An identity-based key-exchange protocol. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 29\u201337. Springer, Heidelberg (1990)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-39887-5_11","volume-title":"Fast Software Encryption","author":"T. Iwata","year":"2003","unstructured":"Iwata, T., Kurosawa, K.: OMAC: One-key CBC MAC. In: Johansson, T. (ed.) FSE 2003. LNCS, vol.\u00a02887, pp. 129\u2013153. Springer, Heidelberg (2003), An updated version is \u201cCryptology ePrint Archive: Report 2002\/180\u201d at http:\/\/eprint.iacr.org\/"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-79263-5_10","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"J. Katz","year":"2008","unstructured":"Katz, J., Lindell, A.Y.: Aggregate message authentication codes. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 155\u2013169. Springer, Heidelberg (2008)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-24676-3_5","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"A. Lysyanskaya","year":"2004","unstructured":"Lysyanskaya, A., Micali, S., Reyzin, L., Shacham, H.: Sequential aggregate signatures from trapdoor permutations. In: Cachin, C., Camenisch, J. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 74\u201390. Springer, Heidelberg (2004)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Ma, D., Tsudik, G.: Extended abstract: Forward-secure sequential aggregate authentication. In: IEEE Symposium on Security and Privacy, pp. 86\u201391. IEEE Computer Society (2007), Also published as IACR Cryptology ePrint Archive: Report 2007\/052 at http:\/\/eprint.iacr.org\/","DOI":"10.1109\/SP.2007.18"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Ma, D., Tsudik, G.: A new approach to secure logging. ACM Transactions on Storage 5(1), 2:1\u20132:21 (2009)","DOI":"10.1145\/1502777.1502779"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/11523468_39","volume-title":"Automata, Languages and Programming","author":"U.M. Maurer","year":"2005","unstructured":"Maurer, U.M., Sj\u00f6din, J.: Single-key AIL-MACs from any FIL-MAC. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 472\u2013484. Springer, Heidelberg (2005)"},{"key":"7_CR17","unstructured":"NIST Special Publication 800-38B. Recommendation for block cipher modes of operation: The CMAC mode for authentication (2005)"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/317087.317089","volume":"2","author":"B. Schneier","year":"1999","unstructured":"Schneier, B., Kelsey, J.: Secure audit logs to support computer forensics. ACM Transactions on Information and System Security\u00a02(2), 159\u2013176 (1999)","journal-title":"ACM Transactions on Information and System Security"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D.R. Simon","year":"1998","unstructured":"Simon, D.R.: Findings collisions on a one-way street: Can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"key":"7_CR20","unstructured":"Wang, B., Hong, X.: Sequential message authentication code without random oracles. Cryptology ePrint Archive, Report 2013\/444 (2013), http:\/\/eprint.iacr.org\/"},{"key":"7_CR21","unstructured":"Wang, X., Feng, D., Lai, X., Yu, H.: Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD. In: Cryptology ePrint Archive, Report 2004\/199 (2004), http:\/\/eprint.iacr.org\/"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11535218_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12475-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T23:14:04Z","timestamp":1746400444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12475-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319124742","9783319124759"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12475-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}