{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T04:47:47Z","timestamp":1748580467069,"version":"3.37.3"},"reference-count":5,"publisher":"Wiley","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"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":["61871430","61971458","20A520012","19zx010"],"award-info":[{"award-number":["61871430","61971458","20A520012","19zx010"]}],"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":["61871430","61971458","20A520012","19zx010"],"award-info":[{"award-number":["61871430","61971458","20A520012","19zx010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Project of Henan Educational Department","award":["61871430","61971458","20A520012","19zx010"],"award-info":[{"award-number":["61871430","61971458","20A520012","19zx010"]}]},{"name":"Special Project of Key Scientific Research Projects of Henan Higher Education Institutions","award":["61871430","61971458","20A520012","19zx010"],"award-info":[{"award-number":["61871430","61971458","20A520012","19zx010"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2019,11,3]]},"abstract":"<jats:p>Constrained verifiable random functions (VRFs) were introduced by Fuchsbauer. In a constrained VRF, one can drive a constrained key <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mrow><mml:mi>s<\/mml:mi><mml:msub><mml:mrow><mml:mi>k<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>S<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math> from the master secret key <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><mml:mrow><mml:mi>s<\/mml:mi><mml:mi>k<\/mml:mi><\/mml:mrow><\/mml:math>, where <jats:italic>S<\/jats:italic> is a subset of the domain. Using the constrained key <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\"><mml:mrow><mml:mi>s<\/mml:mi><mml:msub><mml:mrow><mml:mi>k<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>S<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math>, one can compute function values at points which are not in the set <jats:italic>S<\/jats:italic>. The security of constrained VRFs requires that the VRFs\u2019 output should be indistinguishable from a random value in the range. They showed how to construct constrained VRFs for the bit-fixing class and the circuit constrained class based on multilinear maps. Their construction can only achieve selective security where an attacker must declare which point he will attack at the beginning of experiment. In this work, we propose a novel construction for constrained verifiable random function from bilinear maps and prove that it satisfies a new security definition which is stronger than the selective security. We call it semiadaptive security where the attacker is allowed to make the evaluation queries before it outputs the challenge point. It can immediately get that if a scheme satisfied semiadaptive security, and it must satisfy selective security.<\/jats:p>","DOI":"10.1155\/2019\/4187892","type":"journal-article","created":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T18:31:43Z","timestamp":1572805903000},"page":"1-15","source":"Crossref","is-referenced-by-count":2,"title":["A Novel Construction of Constrained Verifiable Random Functions"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4707-1354","authenticated-orcid":true,"given":"Muhua","family":"Liu","sequence":"first","affiliation":[{"name":"Control Science and Engineering Postdoctoral Mobile Station, Henan University of Science and Technology, Luoyang 471023, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8500-8727","authenticated-orcid":true,"given":"Ping","family":"Zhang","sequence":"additional","affiliation":[{"name":"Control Science and Engineering Postdoctoral Mobile Station, Henan University of Science and Technology, Luoyang 471023, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1572-5293","authenticated-orcid":true,"given":"Qingtao","family":"Wu","sequence":"additional","affiliation":[{"name":"Control Science and Engineering Postdoctoral Mobile Station, Henan University of Science and Technology, Luoyang 471023, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"first-page":"1","volume-title":"On the (Im)possibility of obfuscating programs","year":"2001","key":"10"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-013-9153-x"},{"volume-title":"Adaptive security of constrained PRFs","year":"2014","key":"15"},{"volume-title":"Adaptively secure constrained pseudorandom functions","year":"2019","key":"16"},{"volume-title":"Constrained pseudorandom functions: verifiable and delegatable","year":"2014","key":"19"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2019\/4187892.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2019\/4187892.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2019\/4187892.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T18:31:47Z","timestamp":1572805907000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2019\/4187892\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":5,"alternative-id":["4187892","4187892"],"URL":"https:\/\/doi.org\/10.1155\/2019\/4187892","relation":{},"ISSN":["1939-0114","1939-0122"],"issn-type":[{"type":"print","value":"1939-0114"},{"type":"electronic","value":"1939-0122"}],"subject":[],"published":{"date-parts":[[2019,11,3]]}}}