乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:09Z","timestamp":1725543429737},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354581"},{"type":"electronic","value":"9783540354598"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780656_30","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:08:16Z","timestamp":1151071696000},"page":"360-370","source":"Crossref","is-referenced-by-count":4,"title":["Tag-KEM from Set Partial Domain One-Way Permutations"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Abe","sequence":"first","affiliation":[]},{"given":"Yang","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11426639_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M. Abe","year":"2005","unstructured":"Abe, M., Gennaro, R., Kurosawa, K., Shoup, V.: Tag-KEM\/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 128\u2013146. Springer, Heidelberg (2005)"},{"key":"30_CR2","unstructured":"Abe, M., Cui, Y., Imai, H., Kurosawa, K.: Tag-KEM from Set Partial Domain One-Way Permutations (full version) see: \n \n http:\/\/eprint.iacr.org\/"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: First ACM Conference on Computer and Communication Security, Association for Computing Machinery, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal Asymmetric Encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-44647-8_17","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D.: Simplified OAEP for the RSA and Rabin Functions. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 275\u2013291. Springer, Heidelberg (2001)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerablities. Journal of Cryptology\u00a010, 233\u2013260 (1997)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R. Cramer","year":"2003","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing\u00a033(1), 167\u2013226 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 537\u2013554. Springer, Heidelberg (1999)"},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00145-002-0204-y","volume":"17","author":"E. Fujisaki","year":"2004","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP Is Secure under the RSA Assumption. J. Cryptology\u00a017(2), 81\u2013104 (2004)","journal-title":"J. Cryptology"},{"key":"30_CR10","unstructured":"Gennaro, R., Shoup, V.: A note on an encryption scheme of Kurosawa and Desmedt. Technical Report 2004\/194, IACR ePrint archive (2004)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/978-3-540-28628-8_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K. Kurosawa","year":"2004","unstructured":"Kurosawa, K., Desmedt, Y.G.: A new paradigm of hybrid encryption scheme. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 426\u2013442. Springer, Heidelberg (2004)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Itoh, T., Takeuchi, M.: Public Key Cryptosystem using a Reciprocal Number with the Same Intractability as Factoring a Large Number. In: CRYPTOLOGIA, vol.\u00a0XII, pp. 225\u2013233 (1988)","DOI":"10.1080\/0161-118891862972"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44586-2_3","volume-title":"Public Key Cryptography","author":"K. Kurosawa","year":"2001","unstructured":"Kurosawa, K., Ogata, W., Matsuo, T., Makishima, S.: IND-CCA Public Key Schemes Equivalent to Factoring n=pq. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 36\u201347. Springer, Heidelberg (2001)"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 433\u2013444. Springer, Heidelberg (1992)"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-44647-8_15","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"V. Shoup","year":"2001","unstructured":"Shoup, V.: OAEP reconsidered. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 239\u2013259. Springer, Heidelberg (2001)"},{"key":"30_CR16","unstructured":"Shoup, V.: ISO 18033-2: An emerging standard for public-key encryption (committee draft) (June 3, 2004), Available at: \n \n http:\/\/shoup.net\/iso\/"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780656_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:00Z","timestamp":1619507820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780656_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354581","9783540354598"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11780656_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}