{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:41:17Z","timestamp":1725806477419},"publisher-location":"Cham","reference-count":24,"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_12","type":"book-chapter","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T09:25:19Z","timestamp":1412155519000},"page":"162-177","source":"Crossref","is-referenced-by-count":2,"title":["Lossy Trapdoor Relation and Its Applications to Lossy Encryption and Adaptive Trapdoor Relation"],"prefix":"10.1007","author":[{"given":"Haiyang","family":"Xue","sequence":"first","affiliation":[]},{"given":"Xianhui","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Bao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yamin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-01001-9_1","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"M. Bellare","year":"2009","unstructured":"Bellare, M., Hofheinz, D., Yilek, S.: Possibility and impossibility results for encryption and commitment secure under selective opening. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 1\u201335. Springer, Heidelberg (2009)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-85174-5_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A. Boldyreva","year":"2008","unstructured":"Boldyreva, A., Fehr, S., O\u2019Neill, A.: On notions of security for deterministic encryption, and efficient constructions without random oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 335\u2013359. Springer, Heidelberg (2008)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-13708-2_3","volume-title":"Applied Cryptography and Network Security","author":"X. Boyen","year":"2010","unstructured":"Boyen, X., Waters, B.: Shrinking the keys of discrete-log-type lossy trapdoor functions. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol.\u00a06123, pp. 35\u201352. Springer, Heidelberg (2010)"},{"issue":"6","key":"12_CR4","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. on Information Theory"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13013-7_17","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"D.M. Freeman","year":"2010","unstructured":"Freeman, D.M., Goldreich, O., Kiltz, E., Rosen, A., Segev, G.: More constructions of lossy and correlation-secure trapdoor functions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 279\u2013295. Springer, Heidelberg (2010)"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00145-011-9112-3","volume":"26","author":"D.M. Freeman","year":"2013","unstructured":"Freeman, D.M., Goldreich, O., Kiltz, E., Rosen, A., Segev, G.: More constructions of lossy and correlation-secure trapdoor functions. J. Cryptology\u00a026(1), 39\u201374 (2013)","journal-title":"J. Cryptology"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-30580-4_8","volume-title":"Public Key Cryptography - PKC 2005","author":"K. Gj\u00f8steen","year":"2005","unstructured":"Gj\u00f8steen, K.: Symmetric subgroup membership problems. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 104\u2013119. Springer, Heidelberg (2005)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography. Basic Techniques, vol.\u00a01. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-25385-0_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"B. Hemenway","year":"2011","unstructured":"Hemenway, B., Libert, B., Ostrovsky, R., Vergnaud, D.: Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 70\u201388. Springer, Heidelberg (2011)"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/s00145-010-9066-x","volume":"24","author":"D. Hofheinz","year":"2011","unstructured":"Hofheinz, D.: Possibility and impossibility results for selective decommitments. J. Cryptology\u00a024(3), 470\u2013516 (2011)","journal-title":"J. Cryptology"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-13190-5_34","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"E. Kiltz","year":"2010","unstructured":"Kiltz, E., Mohassel, P., O\u2019Neill, A.: Adaptive trapdoor functions and chosen-ciphertext security. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 673\u2013692. Springer, Heidelberg (2010)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-14623-7_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"E. Kiltz","year":"2010","unstructured":"Kiltz, E., O\u2019Neill, A., Smith, A.: Instantiability of RSA-OAEP under chosen-plaintext attack. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 295\u2013313. Springer, Heidelberg (2010)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-78524-8_18","volume-title":"Theory of Cryptography","author":"G. Kol","year":"2008","unstructured":"Kol, G., Naor, M.: Cryptography and game theory: Designing protocols for exchanging information. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 320\u2013339. Springer, Heidelberg (2008)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: ACM Conference on Computer and Communications Security, pp. 59\u201366 (1998)","DOI":"10.1145\/288090.288106"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03356-8_2","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M. Naor","year":"2009","unstructured":"Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 18\u201335. Springer, Heidelberg (2009)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/3-540-45600-7_38","volume-title":"Information and Communications Security","author":"J.M. Gonz\u00e1lez Nieto","year":"2001","unstructured":"Gonz\u00e1lez Nieto, J.M., Boyd, C., Dawson, E.: A public key cryptosystem based on the subgroup membership problem. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol.\u00a02229, pp. 352\u2013363. Springer, Heidelberg (2001)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: STOC, pp. 187\u2013196 (2008)","DOI":"10.1145\/1374376.1374406"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-54631-0_22","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"Y. Seurin","year":"2014","unstructured":"Seurin, Y.: On the lossiness of the rabin trapdoor function. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol.\u00a08383, pp. 380\u2013398. Springer, Heidelberg (2014)"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-14623-7_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"H. Wee","year":"2010","unstructured":"Wee, H.: Efficient chosen-ciphertext security via extractable hash proofs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 314\u2013332. Springer, Heidelberg (2010)"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-30057-8_16","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"H. Wee","year":"2012","unstructured":"Wee, H.: Public key encryption against related key attacks. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol.\u00a07293, pp. 262\u2013279. Springer, Heidelberg (2012)"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-02937-5_13","volume-title":"Cryptology and Network Security","author":"H. Xue","year":"2013","unstructured":"Xue, H., Li, B., Lu, X., Jia, D., Liu, Y.: Efficient lossy trapdoor functions based on subgroup membership assumptions. In: Abdalla, M., Nita-Rotaru, C., Dahab, R. (eds.) CANS 2013. LNCS, vol.\u00a08257, pp. 235\u2013250. Springer, Heidelberg (2013)"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T06:31:49Z","timestamp":1598337109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12475-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319124742","9783319124759"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12475-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}