{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T16:02:50Z","timestamp":1760889770719,"version":"3.37.3"},"reference-count":16,"publisher":"Wiley","license":[{"start":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T00:00:00Z","timestamp":1547596800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502400","61872292","2018JQ6007","16ZB0140"],"award-info":[{"award-number":["61502400","61872292","2018JQ6007","16ZB0140"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502400","61872292","2018JQ6007","16ZB0140"],"award-info":[{"award-number":["61502400","61872292","2018JQ6007","16ZB0140"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Basic Research Plan in Shaanxi Province of China","award":["61502400","61872292","2018JQ6007","16ZB0140"],"award-info":[{"award-number":["61502400","61872292","2018JQ6007","16ZB0140"]}]},{"name":"Foundation of Sichuan Educational Committee","award":["61502400","61872292","2018JQ6007","16ZB0140"],"award-info":[{"award-number":["61502400","61872292","2018JQ6007","16ZB0140"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2019,1,16]]},"abstract":"<jats:p>Lossy trapdoor functions (LTFs), introduced by Peiker and Waters in STOC\u201908, are functions that may be working in another injective mode or a lossy mode. Given such a function key, it is impossible to distinguish an injective key from a lossy key for any (probabilistic) polynomial-time adversary. This paper studies lossy trapdoor functions with<jats:italic> tight security<\/jats:italic>. First, we give a formal definition for tightly secure LTFs. Loosely speaking, a collection of LTFs is tightly secure if the advantage to distinguish a tuple of injective keys from a tuple of lossy keys does not degrade in the number of function keys. Then, we show that tightly secure LTFs can be used to construct public-key encryption schemes with tight CPA security in a multiuser, multichallenge setting, and with tight CCA security in a multiuser, one-challenge setting. Finally, we present a construction of tightly secure LTFs from the decisional Diffie-Hellman assumption.<\/jats:p>","DOI":"10.1155\/2019\/3636759","type":"journal-article","created":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T18:30:58Z","timestamp":1547663458000},"page":"1-13","source":"Crossref","is-referenced-by-count":3,"title":["Tightly Secure Lossy Trapdoor Functions: Constructions and Applications"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7617-5462","authenticated-orcid":true,"given":"Baodong","family":"Qin","sequence":"first","affiliation":[{"name":"National Engineering Laboratory for Wireless Security, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710121, China"},{"name":"State Key Laboratory of Cryptology, P.O. Box 5159, Beijing 100878, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1137\/100782929"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47422-9_18"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2864163"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.04.043"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89500-0_13"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.3390\/info8020038"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1002"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.4108\/eai.28-12-2017.153517"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-017-1444-9"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30057-8_16"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_18"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_35"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055717"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_17"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63697-9_11"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2019\/3636759.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2019\/3636759.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2019\/3636759.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T18:31:01Z","timestamp":1547663461000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2019\/3636759\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,16]]},"references-count":16,"alternative-id":["3636759","3636759"],"URL":"https:\/\/doi.org\/10.1155\/2019\/3636759","relation":{},"ISSN":["1939-0114","1939-0122"],"issn-type":[{"type":"print","value":"1939-0114"},{"type":"electronic","value":"1939-0122"}],"subject":[],"published":{"date-parts":[[2019,1,16]]}}}