{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:26Z","timestamp":1772283686562,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":72,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642284953","type":"print"},{"value":"9783642284960","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28496-0_18","type":"book-chapter","created":{"date-parts":[[2012,2,20]],"date-time":"2012-02-20T02:17:48Z","timestamp":1329704268000},"page":"293-319","source":"Crossref","is-referenced-by-count":36,"title":["Another Look at Tightness"],"prefix":"10.1007","author":[{"given":"Sanjit","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred","family":"Menezes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Palash","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi, W., Chor, B., Goldreich, O., Schnorr, C.P.: RSA and Rabin functions: Certain parts are as hard as the whole. SIAM J. Computing\u00a017, 194\u2013209 (1988)","journal-title":"SIAM J. Computing"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45539-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Boldyreva, A., Micali, S.: Public-Key Encryption in a Multi-User Setting: Security Proofs and Improvements. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 259\u2013274. Springer, Heidelberg (2000)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying Hash Functions for Message Authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 1\u201315. Springer, Heidelberg (1996)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-48329-2_21","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Rogaway, P.: Entity Authentication and Key Distribution. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 232\u2013249. Springer, Heidelberg (1994)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11502760_3","volume-title":"Fast Software Encryption","author":"D. Bernstein","year":"2005","unstructured":"Bernstein, D.: The Poly1305-AES Message-Authentication Code. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol.\u00a03557, pp. 32\u201349. Springer, Heidelberg (2005)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-78967-3_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"D. Bernstein","year":"2008","unstructured":"Bernstein, D.: Proving Tight Security for Rabin-Williams Signatures. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 70\u201387. Springer, Heidelberg (2008)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1504\/IJSN.2007.013173","volume":"2","author":"R. Bhaskar","year":"2007","unstructured":"Bhaskar, R., Herranz, J., Laguillaumie, F.: Aggregate designated verifier signatures and application to secure routing. Int. J. Security and Networks\u00a02, 192\u2013201 (2007)","journal-title":"Int. J. Security and Networks"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0020-0190(02)00269-7","volume":"84","author":"E. Biham","year":"2002","unstructured":"Biham, E.: How to decrypt or even substitute DES-encrypted messages in 228 steps. Information Processing Letters\u00a084, 117\u2013124 (2002)","journal-title":"Information Processing Letters"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11693383_8","volume-title":"Selected Areas in Cryptography","author":"A. Biryukov","year":"2006","unstructured":"Biryukov, A., Mukhopadhyay, S., Sarkar, P.: Improved Time-Memory Trade-Offs with Multiple Data. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 110\u2013127. Springer, Heidelberg (2006)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44448-3_1","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"A. Biryukov","year":"2000","unstructured":"Biryukov, A., Shamir, A.: Cryptanalytic Time\/Memory\/Data Tradeoffs for Stream Ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 1\u201313. Springer, Heidelberg (2000)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44598-6_12","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J.A. Black","year":"2000","unstructured":"Black, J.A., Rogaway, P.: CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 197\u2013215. Springer, Heidelberg (2000)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BFb0024447","volume-title":"Cryptography and Coding","author":"S. Blake-Wilson","year":"1997","unstructured":"Blake-Wilson, S., Johnson, D., Menezes, A.: Key Agreement Protocols and Their Security Analysis. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol.\u00a01355, pp. 30\u201345. Springer, Heidelberg (1997), http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/1997\/corr97-17.ps"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM J. Computing\u00a015, 364\u2013383 (1986)","journal-title":"SIAM J. Computing"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity-Based Encryption without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. SIAM J. Computing\u00a032, 586\u2013615 (2003)","journal-title":"SIAM J. Computing"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 416\u2013432. Springer, Heidelberg (2003)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1504\/IJACT.2008.017047","volume":"1","author":"X. Boyen","year":"2008","unstructured":"Boyen, X.: A tapestry of identity-based encryption: practical frameworks compared. Int. J. Applied Cryptography\u00a01, 3\u201321 (2008)","journal-title":"Int. J. Applied Cryptography"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Boyen, X., Martin, L.: Identity-based cryptography standard (IBCS) #1: Supersingular curve implementations of the BF and BB1 cryptosystems. IETF RFC 5091 (2007)","DOI":"10.17487\/rfc5091"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44987-6_28","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Krawczyk, H.: Analysis of Key-Exchange Protocols and their Use for Building Secure Channels. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 453\u2013474. Springer, Heidelberg (2001), Full version at http:\/\/eprint.iacr.org\/2001\/040"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Chan, H., Perrig, A., Song, D.: Secure hierarchical in-network aggregation in sensor networks. In: CCS 2006, pp. 278\u2013287 (2006)","DOI":"10.1145\/1180405.1180440"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/11586821_29","volume-title":"Cryptography and Coding","author":"L. Chen","year":"2005","unstructured":"Chen, L., Cheng, Z.: Security Proof of Sakai-Kasahara\u2019s Identity-Based Encryption Scheme. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 442\u2013459. Springer, Heidelberg (2005)"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J.-S. Coron","year":"2000","unstructured":"Coron, J.-S.: On the Exact Security of Full Domain Hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 229\u2013235. Springer, Heidelberg (2000)"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-46035-7_18","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"J.-S. Coron","year":"2002","unstructured":"Coron, J.-S.: Optimal Security Proofs for PSS and Other Signature Schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 272\u2013287. Springer, Heidelberg (2002)"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-73420-8_2","volume-title":"Automata, Languages and Programming","author":"I. Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I.: A \u201cProof-Reading\u201d of Some Issues in Cryptography. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 2\u201311. Springer, Heidelberg (2007)"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Dang, Q.: Recommendation for applications using approved hash algorithms. NIST Special Publication 800-107 (2009)","DOI":"10.6028\/NIST.SP.800-107"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Dworkin, M.: Recommendation for block cipher modes of operation: Methods and techniques. NIST Special Publication 800-38A (2001)","DOI":"10.6028\/NIST.SP.800-38a"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Dworkin, M.: Recommendation for block cipher modes of operation: The CMAC mode for authentication. NIST Special Publication 800-38B (2005)","DOI":"10.6028\/NIST.SP.800-38b-2005"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Eastlake, D., Crocker, S., Schiller, J.: Randomness recommendations for security. IETF RFC 1750 (1994)","DOI":"10.17487\/rfc1750"},{"key":"18_CR30","unstructured":"The eSTREAM project, http:\/\/www.ecrypt.eu.org\/stream\/"},{"key":"18_CR31","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":"18_CR32","unstructured":"FIPS\u00a0180-3, Secure Hash Standard (SHS), Federal Information Processing Standards Publication 180-3, National Institute of Standards and Technology (2008)"},{"key":"18_CR33","unstructured":"FIPS\u00a0198-1, The Keyed-Hash Message Authentication Code (HMAC), Federal Information Processing Standards Publication 198, National Institute of Standards and Technology (2008)"},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/11523468_64","volume-title":"Automata, Languages and Programming","author":"D. Galindo","year":"2005","unstructured":"Galindo, D.: Boneh-Franklin Identity Based Encryption Revisited. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 791\u2013802. Springer, Heidelberg (2005)"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-00457-5_26","volume-title":"Theory of Cryptography","author":"C. Gentry","year":"2009","unstructured":"Gentry, C., Halevi, S.: Hierarchical Identity Based Encryption with Polynomially Many Levels. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 437\u2013456. Springer, Heidelberg (2009)"},{"key":"18_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BFb0052227","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O.: On the Foundations of Modern Cryptography. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 46\u201374. Springer, Heidelberg (1997)"},{"key":"18_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-45146-4_28","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"S. Halevi","year":"2003","unstructured":"Halevi, S., Rogaway, P.: A Tweakable Enciphering Mode. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 482\u2013499. Springer, Heidelberg (2003)"},{"key":"18_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-24660-2_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"S. Halevi","year":"2004","unstructured":"Halevi, S., Rogaway, P.: A Parallelizable Enciphering Mode. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 292\u2013304. Springer, Heidelberg (2004)"},{"key":"18_CR39","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"M. Hellman","year":"1980","unstructured":"Hellman, M.: A cryptanalytic time-memory trade-off. IEEE Trans. Info. Th.\u00a026, 401\u2013406 (1980)","journal-title":"IEEE Trans. Info. Th."},{"key":"18_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/11593447_19","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"J. Hong","year":"2005","unstructured":"Hong, J., Sarkar, P.: New Applications of Time Memory Data Tradeoffs. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 353\u2013372. Springer, Heidelberg (2005)"},{"key":"18_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Jakobsson","year":"1996","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated Verifier Proofs and their Applications. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 143\u2013154. Springer, Heidelberg (1996)"},{"key":"18_CR42","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.: Aggregate Message Authentication Codes. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 155\u2013169. Springer, Heidelberg (2008)"},{"key":"18_CR43","doi-asserted-by":"crossref","unstructured":"Katz, J., Wang, N.: Efficiency improvements for signature schemes with tight security reductions. In: CCS 2003, pp. 155\u2013164 (2003)","DOI":"10.1145\/948109.948132"},{"key":"18_CR44","doi-asserted-by":"crossref","unstructured":"Kelly, S., Frankel, S.: Using HMAC-SHA-256, HMAC-SHA-384, and HMAC-SHA-512 with IPsec. IETF RFC 4868 (2007)","DOI":"10.17487\/rfc4868"},{"key":"18_CR45","doi-asserted-by":"crossref","unstructured":"Kent, S., Atkinson, R.: IP authentication header. IETF RFC 4302 (2005)","DOI":"10.17487\/rfc4302"},{"key":"18_CR46","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00145-005-0432-z","volume":"20","author":"N. Koblitz","year":"2007","unstructured":"Koblitz, N., Menezes, A.: Another look at \u201cprovable security\u201d. J. Cryptology\u00a020, 3\u201337 (2007)","journal-title":"J. Cryptology"},{"key":"18_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/11941378_12","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"N. Koblitz","year":"2006","unstructured":"Koblitz, N., Menezes, A.: Another Look at \u201cProvable Security\u201d. II. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 148\u2013175. Springer, Heidelberg (2006)"},{"key":"18_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/11535218_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"H. Krawczyk","year":"2005","unstructured":"Krawczyk, H.: HMQV: A High-Performance Secure Diffie-Hellman Protocol. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 546\u2013566. Springer, Heidelberg (2005), Full version at http:\/\/eprint.iacr.org\/2005\/176"},{"key":"18_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-36563-X_3","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"K. Kurosawa","year":"2003","unstructured":"Kurosawa, K., Iwata, T.: TMAC: Two-Key CBC MAC. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 33\u201349. Springer, Heidelberg (2003)"},{"key":"18_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-75670-5_1","volume-title":"Provable Security","author":"B. LaMacchia","year":"2007","unstructured":"LaMacchia, B., Lauter, K., Mityagin, A.: Stronger Security of Authenticated Key Exchange. In: Susilo, W., Liu, J.K., Mu, Y. (eds.) ProvSec 2007. LNCS, vol.\u00a04784, pp. 1\u201316. Springer, Heidelberg (2007)"},{"key":"18_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/11761679_28","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"S. Lu","year":"2006","unstructured":"Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., Waters, B.: Sequential Aggregate Signatures and Multisignatures without Random Oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 465\u2013485. Springer, Heidelberg (2006)"},{"key":"18_CR52","doi-asserted-by":"crossref","unstructured":"Luby, M.: Pseudorandomness and Cryptographic Applications. Princeton University Press (1996)","DOI":"10.1515\/9780691206844"},{"key":"18_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-30556-9_27","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"D.A. McGrew","year":"2004","unstructured":"McGrew, D.A., Viega, J.: The Security and Performance of the Galois\/Counter Mode (GCM) of Operation. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol.\u00a03348, pp. 343\u2013355. Springer, Heidelberg (2004)"},{"key":"18_CR54","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/B:DESI.0000036250.18062.3f","volume":"33","author":"A. Menezes","year":"2004","unstructured":"Menezes, A., Smart, N.: Security of signature schemes in the multi-user setting. Designs, Codes and Cryptography\u00a033, 261\u2013274 (2004)","journal-title":"Designs, Codes and Cryptography"},{"key":"18_CR55","doi-asserted-by":"crossref","unstructured":"Menezes, A., Ustaoglu, B.: Security arguments for the UM key agreement protocol in the NIST SP\u00a0800-56A standard. In: ASIACCS 2008, pp. 261\u2013270 (2008)","DOI":"10.1145\/1368310.1368348"},{"key":"18_CR56","unstructured":"National Security Agency, SKIPJACK and KEA algorithm specification, Version 2.0 (May 29, 1998)"},{"key":"18_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11593447_1","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"P. Paillier","year":"2005","unstructured":"Paillier, P., Vergnaud, D.: Discrete-Log-Based Signatures May Not Be Equivalent\u00a0to\u00a0Discrete\u00a0Log. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 1\u201320. Springer, Heidelberg (2005)"},{"key":"18_CR58","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptology\u00a013, 361\u2013396 (2000)","journal-title":"J. Cryptology"},{"key":"18_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30539-2_2","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"P. Rogaway","year":"2004","unstructured":"Rogaway, P.: Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 16\u201331. Springer, Heidelberg (2004)"},{"key":"18_CR60","unstructured":"Rogaway, P.: OCB: Background, http:\/\/www.cs.ucdavis.edu\/~rogaway\/ocb\/ocb-faq.htm"},{"key":"18_CR61","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1145\/937527.937529","volume":"6","author":"P. Rogaway","year":"2003","unstructured":"Rogaway, P., Bellare, M., Black, J.: OCB: A block-cipher mode of operation for efficient authenticated encryption. ACM Trans. Information and System Security\u00a06, 365\u2013403 (2003)","journal-title":"ACM Trans. Information and System Security"},{"key":"18_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11761679_23","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"P. Rogaway","year":"2006","unstructured":"Rogaway, P., Shrimpton, T.: A Provable-Security Treatment of the Key-Wrap Problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 373\u2013390. Springer, Heidelberg (2006), Full version at http:\/\/eprint.iacr.org\/2006\/221"},{"key":"18_CR63","doi-asserted-by":"publisher","first-page":"4025","DOI":"10.1109\/TIT.2010.2050921","volume":"56","author":"P. Sarkar","year":"2010","unstructured":"Sarkar, P.: Pseudo-random functions and parallelizable modes of operations of a block cipher. IEEE Trans. Info. Th.\u00a056, 4025\u20134037 (2010)","journal-title":"IEEE Trans. Info. Th."},{"key":"18_CR64","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.ipl.2011.06.014","volume":"111","author":"P. Sarkar","year":"2011","unstructured":"Sarkar, P.: Tweakable enciphering schemes using only the encryption function of a block cipher. Inf. Process. Lett.\u00a0111, 945\u2013955 (2011)","journal-title":"Inf. Process. Lett."},{"key":"18_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-20465-4_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"S. Sch\u00e4ge","year":"2011","unstructured":"Sch\u00e4ge, S.: Tight Proofs for Signature Schemes without Random Oracles. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 189\u2013206. Springer, Heidelberg (2011)"},{"key":"18_CR66","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. Schnorr","year":"1991","unstructured":"Schnorr, C.: Efficient signature generation for smart cards. J. Cryptology\u00a04, 161\u2013174 (1991)","journal-title":"J. Cryptology"},{"key":"18_CR67","unstructured":"Shin, J.: Enhancing privacy in cryptographic protocols, Ph.D. thesis, University of Maryland (2009)"},{"key":"18_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/11586821_24","volume-title":"Cryptography and Coding","author":"A. Sidorenko","year":"2005","unstructured":"Sidorenko, A., Schoenmakers, B.: Concrete Security of the Blum-Blum-Shub Pseudorandom Generator. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 355\u2013375. Springer, Heidelberg (2005)"},{"key":"18_CR69","unstructured":"Song, J.H., Poovendran, R., Lee, J., Iwata, T.: The AES-CMAC algorithm. IETF RFC 4493 (2006)"},{"key":"18_CR70","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10623-007-9159-1","volume":"46","author":"B. Ustaoglu","year":"2008","unstructured":"Ustaoglu, B.: Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS. Designs, Codes and Cryptography\u00a046, 329\u2013342 (2008)","journal-title":"Designs, Codes and Cryptography"},{"key":"18_CR71","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P. Oorschot van","year":"1999","unstructured":"van Oorschot, P., Wiener, M.: Parallel collision search with cryptanalytic applications. J. Cryptology\u00a012, 1\u201328 (1999)","journal-title":"J. Cryptology"},{"key":"18_CR72","doi-asserted-by":"crossref","unstructured":"Young, A., Yung, M.: Malicious Cryptography: Exposing Cryptovirology. Wiley (2004)","DOI":"10.1016\/S0267-3649(04)00079-2"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28496-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T18:14:06Z","timestamp":1593713646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28496-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642284953","9783642284960"],"references-count":72,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28496-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}