乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:01:04Z","timestamp":1725861664669},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662530146"},{"type":"electronic","value":"9783662530153"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53015-3_14","type":"book-chapter","created":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T10:10:25Z","timestamp":1469009425000},"page":"387-415","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Abe","sequence":"first","affiliation":[]},{"given":"Fumitaka","family":"Hoshino","sequence":"additional","affiliation":[]},{"given":"Miyako","family":"Ohkubo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-34961-4_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"M Abe","year":"2012","unstructured":"Abe, M., Chase, M., David, B., Kohlweiss, M., Nishimaki, R., Ohkubo, M.: Constant-size structure-preserving signatures: generic constructions and simple assumptions. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 4\u201324. Springer, Heidelberg (2012)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-36362-7_20","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"M Abe","year":"2013","unstructured":"Abe, M., David, B., Kohlweiss, M., Nishimaki, R., Ohkubo, M.: Tagged one-time signatures: tight security and optimal tag size. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 312\u2013331. Springer, Heidelberg (2013)"},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00145-014-9196-7","volume":"29","author":"M Abe","year":"2016","unstructured":"Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. J. Cryptol. 29(2), 363\u2013421 (2016)","journal-title":"J. Cryptol."},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-662-44371-2_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"M Abe","year":"2014","unstructured":"Abe, M., Groth, J., Ohkubo, M., Tango, T.: Converting cryptographic schemes from symmetric to asymmetric bilinear groups. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 241\u2013260. Springer, Heidelberg (2014)"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: CIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009). \n http:\/\/mpc.zib.de\/index.php\/MPC\/article\/view\/4","journal-title":"Math. Program. Comput."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Akinyele, J.A., Garman, C., Hohenberger, S.: Automating fast and secure translations from type-I to type-III pairing schemes. In: ACM CCS 2015, pp. 1370\u20131381. ACM (2015)","DOI":"10.1145\/2810103.2813601"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Akinyele, J.A., Green, M., Hohenberger, S.: Using SMT solvers to automate design tasks for encryption and signature schemes. In: ACM CCS 2013, pp. 399\u2013410. ACM (2013)","DOI":"10.1145\/2508859.2516718"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Backes, M., Fiore, D., Reischuk, R.M.: Verifiable delegation of computation on outsourced data. In: ACM CCS 2013, pp. 863\u2013874. ACM (2013)","DOI":"10.1145\/2508859.2516681"},{"key":"14_CR9","unstructured":"Barbulescu, R., Gaudry, P., Joux, A., Thom\u00e9, E.: A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. IACR ePrint Archive, report 2013\/400 (2013). \n http:\/\/eprint.iacr.org"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-44371-2_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"G Barthe","year":"2014","unstructured":"Barthe, G., Fagerholm, E., Fiore, D., Mitchell, J., Scedrov, A., Schmidt, B.: Automated analysis of cryptographic assumptions in generic group models. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 95\u2013112. Springer, Heidelberg (2014)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-662-46447-2_16","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"G Barthe","year":"2015","unstructured":"Barthe, G., Fagerholm, E., Fiore, D., Scedrov, A., Schmidt, B., Tibouchi, M.: Strongly-optimal structure preserving signatures from type II pairings: synthesis and lower bounds. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 355\u2013376. Springer, Heidelberg (2015)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: Cryptoverif: A computationally sound mechanized prover for cryptographic protocols. In: Dagstuhl seminar Formal Protocol Verification Applied, vol. 10 (2007)","DOI":"10.1109\/SP.2006.1"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-13708-2_14","volume-title":"Applied Cryptography and Network Security","author":"O Blazy","year":"2010","unstructured":"Blazy, O., Fuchsbauer, G., Izabach\u00e8ne, M., Jambert, A., Sibert, H., Vergnaud, D.: Batch Groth\u2013Sahai. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol. 6123, pp. 218\u2013235. Springer, Heidelberg (2010)"},{"key":"14_CR14","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. 3027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: ACM CCS 2004, pp. 168\u2013177. ACM (2004)","DOI":"10.1145\/1030083.1030106"},{"issue":"2\u20133","key":"14_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10623-009-9334-7","volume":"55","author":"S Chatterjee","year":"2010","unstructured":"Chatterjee, S., Hankerson, D., Knapp, E., Menezes, A.: Comparing two pairing-based aggregate signature schemes. Des. Codes Crypt. 55(2\u20133), 141\u2013167 (2010)","journal-title":"Des. Codes Crypt."},{"key":"14_CR18","unstructured":"Chatterjee, S., Menezes, A.: On cryptographic protocols employing asymmetric pairings - the role of psi revisited. IACR ePrint Archive, Report 2009\/480 (2009). \n http:\/\/eprint.iacr.org"},{"issue":"13","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1016\/j.dam.2011.04.021","volume":"159","author":"S Chatterjee","year":"2011","unstructured":"Chatterjee, S., Menezes, A.: On cryptographic protocols employing asymmetric pairings - the role of revisited. Discrete Appl. Math. 159(13), 1311\u20131322 (2011)","journal-title":"Discrete Appl. Math."},{"key":"14_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/9781118166000","volume-title":"Applied Integer Programming: Modeling and Solution","author":"D-S Chen","year":"2009","unstructured":"Chen, D.-S., Batson, R.G., Dang, Y.: Applied Integer Programming: Modeling and Solution. Wiley, Hoboken (2009)"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-642-54631-0_36","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"A Escala","year":"2014","unstructured":"Escala, A., Groth, J.: Fine-tuning Groth-Sahai proofs. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 630\u2013649. Springer, Heidelberg (2014)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-40084-1_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Escala","year":"2013","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.: An algebraic framework for Diffie-Hellman assumptions. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 129\u2013147. Springer, Heidelberg (2013)"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-13193-6_21","volume-title":"Experimental Algorithms","author":"G Gamrath","year":"2010","unstructured":"Gamrath, G., L\u00fcbbecke, M.E.: Experiments with a generic Dantzig-Wolfe decomposition for integer programs. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 239\u2013252. Springer, Heidelberg (2010)"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-13013-7_11","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"E Ghadafi","year":"2010","unstructured":"Ghadafi, E., Smart, N.P., Warinschi, B.: Groth\u2013Sahai proofs revisited. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 177\u2013192. Springer, Heidelberg (2010)"},{"key":"14_CR26","unstructured":"G\u00f6loglu, F., Granger, R., McGuire, G., Zumbr\u00e4gel, J.: On the function field sieve and the impact of higher splitting probabilities: Application to discrete logarithms in f$$_{2}^{1971}$$. IACR ePrint Archive, Report 2013\/074 (2013). \n http:\/\/eprint.iacr.org"},{"issue":"5","key":"14_CR27","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1137\/080725386","volume":"41","author":"J Groth","year":"2012","unstructured":"Groth, J., Sahai, A.: Efficient noninteractive proof systems for bilinear groups. SIAM J. Comput. 41(5), 1193\u20131232 (2012)","journal-title":"SIAM J. Comput."},{"key":"14_CR28","unstructured":"Gurobi Optimization, Inc., Gurobi optimizer reference manual. \n https:\/\/www.gurobi.com\/documentation\/6.5\/refman.pdf\n \n . \n http:\/\/www.gurobi.com\/"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-662-44371-2_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"G Herold","year":"2014","unstructured":"Herold, G., Hesse, J., Hofheinz, D., R\u00e0fols, C., Rupp, A.: Polynomial spaces: a new framework for composite-to-prime-order transformations. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 261\u2013279. Springer, Heidelberg (2014)"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-38348-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"A Joux","year":"2013","unstructured":"Joux, A.: Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 177\u2013193. Springer, Heidelberg (2013)"},{"key":"14_CR31","unstructured":"Joux, A.: A new index calculus algorithm with complexity l(1\/4+o(1)) in very small characteristic. IACR ePrint Archive, Report 2013\/095 (2013). \n http:\/\/eprint.iacr.org"},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/11681878_30","volume-title":"Theory of Cryptography","author":"E Kiltz","year":"2006","unstructured":"Kiltz, E.: Chosen-ciphertext security from tag-based encryption. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 581\u2013600. Springer, Heidelberg (2006)"},{"key":"14_CR33","unstructured":"Koch, T.: Rapid mathematical prototyping. Ph.D. thesis, Technische Universit\u00e4t Berlin (2004)"},{"key":"14_CR34","unstructured":"LINDO Systems. LINDO. \n http:\/\/www.lindo.com\/"},{"key":"14_CR35","unstructured":"Melnick, M.: LiPS. \n http:\/\/lipside.sourceforge.net\/"},{"key":"14_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-04852-9_15","volume-title":"Topics in Cryptology \u2013 CT-RSA 2014","author":"B Libert","year":"2014","unstructured":"Libert, B., Joye, M.: Group signatures with message-dependent opening in the standard model. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 286\u2013306. Springer, Heidelberg (2014)"},{"key":"14_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/978-3-662-46447-2_20","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"B Libert","year":"2015","unstructured":"Libert, B., Joye, M., Yung, M., Peters, T.: Secure efficient history-hiding append-only signatures in the standard model. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 450\u2013473. Springer, Heidelberg (2015)"},{"key":"14_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-642-54631-0_34","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"B Libert","year":"2014","unstructured":"Libert, B., Yung, M., Joye, M., Peters, T.: Traceable group encryption. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 592\u2013610. Springer, Heidelberg (2014)"},{"issue":"4","key":"14_CR39","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.dam.2006.07.004","volume":"155","author":"NP Smart","year":"2007","unstructured":"Smart, N.P., Vercauteren, F.: On computable isomorphisms in efficient asymmetric pairing-based systems. Discrete Appl. Math. 155(4), 538\u2013547 (2007)","journal-title":"Discrete Appl. Math."},{"key":"14_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114\u2013127. Springer, Heidelberg (2005)"},{"key":"14_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-642-03356-8_36","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Waters","year":"2009","unstructured":"Waters, B.: Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 619\u2013636. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53015-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T00:07:33Z","timestamp":1595203653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53015-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662530146","9783662530153"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53015-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}