{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:42Z","timestamp":1725549522913},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540239758"},{"type":"electronic","value":"9783540305392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30539-2_14","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:41:57Z","timestamp":1268401317000},"page":"187-200","source":"Crossref","is-referenced-by-count":3,"title":["Masking Based Domain Extenders for UOWHFs: Bounds and Constructions"],"prefix":"10.1007","author":[{"given":"Palash","family":"Sarkar","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","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":"14_CR2","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)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-40061-5_13","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"W. Lee","year":"2003","unstructured":"Lee, W., Chang, D., Lee, S., Sung, S., Nandi, M.: New Parallel Domain Extenders for UOWHF. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 208\u2013227. Springer, Heidelberg (2003)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Naor, M.: Efficient Cryptographic Schemes provably as secure as subset sum. Journal of Cryptology\u00a09(4) (1996)","DOI":"10.1007\/BF00189260"},{"key":"14_CR5","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.C. Merkle","year":"1990","unstructured":"Merkle, R.C.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 428\u2013446. Springer, Heidelberg (1990)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-44987-6_11","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"I. Mironov","year":"2001","unstructured":"Mironov, I.: Hash functions: From merkle-damg\u00e5rd to shoup. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 166\u2013181. Springer, Heidelberg (2001)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Nandi, M.: Optimal Domain Extension of UOWHF and a Sufficient Condition. In: Proceedings of SAC 2004. LNCS (2004) (to appear)","DOI":"10.1007\/978-3-540-30564-4_24"},{"key":"14_CR8","unstructured":"Nandi, M.: A New Tree based Domain Extension of UOWHF, Cryptology e-print archive, Report No. 2003\/142, http:\/\/eprint.iacr.org"},{"key":"14_CR9","first-page":"33","volume-title":"Proceedings of the 21st Annual Symposium on Theory of Computing","author":"M. Naor","year":"1989","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the 21st Annual Symposium on Theory of Computing, pp. 33\u201343. ACM, New York (1989)"},{"key":"14_CR10","volume-title":"Proceedings of the 22nd Annual Symposium on Theory of Computing","author":"J. Rompel","year":"1990","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for digital signatures. In: Proceedings of the 22nd Annual Symposium on Theory of Computing. ACM, New York (1990)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Sarkar, P.: Masking Based Domain Extenders for UOWHFs: Bounds and Constructions, Cryptology e-print archive, Report No. 2003\/225, http:\/\/eprint.iacr.org","DOI":"10.1007\/978-3-540-30539-2_14"},{"key":"14_CR12","unstructured":"Sarkar, P.: Domain Extenders for UOWHFs: A Finite Binary Tree Algorithm, Cryptology e-print archive, Report No. 2003\/009, http:\/\/eprint.iacr.org"},{"key":"14_CR13","unstructured":"Sarkar, P.: Construction of UOWHF: Tree Hashing Revisited, Cryptology e-print archive, Report No. 2002\/058, http:\/\/eprint.iacr.org"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-45539-6_32","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: A composition theorem for universal one-way hash functions. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 445\u2013452. Springer, Heidelberg (2000)"},{"key":"14_CR15","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. Simon","year":"1998","unstructured":"Simon, D.: Finding collisions on a one-way street: Can secure hash function be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"key":"14_CR16","unstructured":"Stinson, D.R.: Some observations on the theory of cryptographic hash functions, http:\/\/www.cacr.math.uwaterloo.ca\/~dstinson\/papers\/newhash.ps"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30539-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:49:51Z","timestamp":1685490591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30539-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239758","9783540305392"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30539-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}