{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:20:30Z","timestamp":1762341630686,"version":"3.37.3"},"reference-count":34,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T00:00:00Z","timestamp":1615507200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/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","212102210088","202102210169"],"award-info":[{"award-number":["61871430","61971458","212102210088","202102210169"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Technologies R&D Program of Henan Province","award":["61871430","61971458","212102210088","202102210169"],"award-info":[{"award-number":["61871430","61971458","212102210088","202102210169"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2021,3,12]]},"abstract":"<jats:p>We introduce a novel notion of distributed functional signature. In such a signature scheme, the signing key for function <jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                        <a:mi>f<\/a:mi>\n                     <\/a:math>\n                  <\/jats:inline-formula> will be split into <jats:inline-formula>\n                     <c:math xmlns:c=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\">\n                        <c:mi>n<\/c:mi>\n                     <\/c:math>\n                  <\/jats:inline-formula> shares <jats:inline-formula>\n                     <e:math xmlns:e=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\">\n                        <e:msubsup>\n                           <e:mrow>\n                              <e:mtext>sk<\/e:mtext>\n                           <\/e:mrow>\n                           <e:mi>f<\/e:mi>\n                           <e:mi>i<\/e:mi>\n                        <\/e:msubsup>\n                     <\/e:math>\n                  <\/jats:inline-formula> and distributed to different parties. Given a message <jats:inline-formula>\n                     <g:math xmlns:g=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\">\n                        <g:mi>m<\/g:mi>\n                     <\/g:math>\n                  <\/jats:inline-formula> and a share <jats:inline-formula>\n                     <i:math xmlns:i=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M5\">\n                        <i:msubsup>\n                           <i:mrow>\n                              <i:mtext>sk<\/i:mtext>\n                           <\/i:mrow>\n                           <i:mi>f<\/i:mi>\n                           <i:mi>i<\/i:mi>\n                        <\/i:msubsup>\n                     <\/i:math>\n                  <\/jats:inline-formula>, one can compute locally and obtain a pair signature <jats:inline-formula>\n                     <k:math xmlns:k=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M6\">\n                        <k:mfenced open=\"(\" close=\")\" separators=\"|\">\n                           <k:mrow>\n                              <k:msub>\n                                 <k:mrow>\n                                    <k:mi>f<\/k:mi>\n                                 <\/k:mrow>\n                                 <k:mrow>\n                                    <k:mi>i<\/k:mi>\n                                 <\/k:mrow>\n                              <\/k:msub>\n                              <k:mrow>\n                                 <k:mfenced open=\"(\" close=\")\" separators=\"|\">\n                                    <k:mrow>\n                                       <k:mi>m<\/k:mi>\n                                    <\/k:mrow>\n                                 <\/k:mfenced>\n                                 <k:mo>,<\/k:mo>\n                                 <k:msub>\n                                    <k:mrow>\n                                       <k:mi>\u03c3<\/k:mi>\n                                    <\/k:mrow>\n                                    <k:mrow>\n                                       <k:mi>i<\/k:mi>\n                                    <\/k:mrow>\n                                 <\/k:msub>\n                              <\/k:mrow>\n                           <\/k:mrow>\n                        <\/k:mfenced>\n                     <\/k:math>\n                  <\/jats:inline-formula>. When given all of the signature pairs, everyone can recover the actual value <jats:inline-formula>\n                     <s:math xmlns:s=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M7\">\n                        <s:mi>f<\/s:mi>\n                        <s:mfenced open=\"(\" close=\")\" separators=\"|\">\n                           <s:mrow>\n                              <s:mi>m<\/s:mi>\n                           <\/s:mrow>\n                        <\/s:mfenced>\n                     <\/s:math>\n                  <\/jats:inline-formula> and corresponding signature <jats:inline-formula>\n                     <x:math xmlns:x=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M8\">\n                        <x:mi>\u03c3<\/x:mi>\n                     <\/x:math>\n                  <\/jats:inline-formula>. When the number signature pairs are not enough, nobody can recover the signature <jats:inline-formula>\n                     <z:math xmlns:z=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M9\">\n                        <z:mfenced open=\"(\" close=\")\" separators=\"|\">\n                           <z:mrow>\n                              <z:mi>f<\/z:mi>\n                              <z:mrow>\n                                 <z:mfenced open=\"(\" close=\")\" separators=\"|\">\n                                    <z:mrow>\n                                       <z:mi>m<\/z:mi>\n                                    <\/z:mrow>\n                                 <\/z:mfenced>\n                                 <z:mo>,<\/z:mo>\n                                 <z:mi>\u03c3<\/z:mi>\n                              <\/z:mrow>\n                           <\/z:mrow>\n                        <\/z:mfenced>\n                     <\/z:math>\n                  <\/jats:inline-formula>. We formalize the notion of function privacy in this new model which is not possible for the standard functional signature and give a construction from standard functional signature and function secret sharing based on one-way function and learning with error assumption. We then consider the problem of hosting services in multiple untrusted clouds, in which the verifiability and program privacy are considered. The verifiability requires that the returned results from the cloud can be checked. The program privacy requires that the evaluation procedure does not reveal the program for the untrusted cloud. We give a verifiable distributed secure cloud service scheme from distributed functional signature and prove the securities which include untrusted cloud security (program privacy and verifiability) and untrusted client security.<\/jats:p>","DOI":"10.1155\/2021\/6699974","type":"journal-article","created":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T22:50:05Z","timestamp":1615589405000},"page":"1-14","source":"Crossref","is-referenced-by-count":3,"title":["Distributed Functional Signature with Function Privacy and Its Application"],"prefix":"10.1155","volume":"2021","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, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1704-5144","authenticated-orcid":true,"given":"Lin","family":"Wang","sequence":"additional","affiliation":[{"name":"Control Science and Engineering Postdoctoral Mobile Station, Henan University of Science and Technology, Luoyang, 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, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9643-799X","authenticated-orcid":true,"given":"Jianqiang","family":"Song","sequence":"additional","affiliation":[{"name":"Control Science and Engineering Postdoctoral Mobile Station, Henan University of Science and Technology, Luoyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1976.1055638"},{"issue":"2","key":"2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0217017","article-title":"A digital signature scheme secure against adaptive chosen-message attacks","volume":"17","author":"S. Goldwasser","year":"1988","journal-title":"SIAM"},{"key":"3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4684-4730-9_14","article-title":"Blind signature system","volume-title":"Advances in Cryptology, Proc. CRYPTO\u201983","author":"D. Chaum","year":"1984"},{"first-page":"257","article-title":"Group signatures","author":"D. Chaum","key":"4"},{"first-page":"552","article-title":"How to leak a secret","author":"R. L. Rivest","key":"5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.2967904"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2020.3013902"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-020-2997"},{"first-page":"501","article-title":"Functional signatures and pseudorandom functions","author":"E. Boyle","key":"9"},{"first-page":"1292","article-title":"Function secret sharing: improvements and extensions","author":"E. Boyle","key":"10"},{"first-page":"404","article-title":"Hosting services on an untrusted cloud","author":"D. Boneh","key":"11"},{"first-page":"218","article-title":"Making public key functional encryption function private, distributively","author":"X. Fan","key":"12"},{"first-page":"40","article-title":"Candidate indistinguishability obfuscation and functional encryption for all circuits","author":"S. Garg","key":"13"},{"key":"14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-54242-8_1","article-title":"Virtual black-box obfuscation for all circuits via generic graded encoding","volume-title":"Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014 Lecture Notes in Computer Science","author":"Z. Brakerski","year":"2014"},{"key":"15","article-title":"Cryptanalysis of GGH map","volume-title":"Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques Lecture Notes in Computer Science","author":"Y. Hu","year":"2016"},{"key":"16","first-page":"47","article-title":"Identity-based cryptosystems and signature schemes","volume-title":"Advances in Cryptology, Proc. CRYPTO\u2019 84, LNCS 196","author":"A. Shamir","year":"1985"},{"first-page":"520","article-title":"Policy-based signatures","author":"M. Bellare","key":"17"},{"first-page":"357","article-title":"Delegatable functional signatures","author":"M. Backes","key":"18"},{"first-page":"244","article-title":"Homomorphic signature schemes","author":"R. Johnson","key":"19"},{"first-page":"697","article-title":"Improved security for linearly homomorphic signatures: a generic framework","author":"D. M. Freeman","key":"20"},{"first-page":"371","article-title":"Homomorphic signatures with efficient verification for polynomial functions","author":"D. Catalano","key":"21"},{"first-page":"457","article-title":"Fuzzy identity-based encryption","author":"A. Sahai","key":"22"},{"first-page":"253","article-title":"Functional encryption: definitions and challenges","author":"D. Boneh","key":"23"},{"first-page":"555","article-title":"Reusable garbled circuits and succinct functional encryption","author":"S. Goldwasser","key":"24"},{"first-page":"578","article-title":"Multi-input functional encryption","author":"S. Goldwasser","key":"25"},{"first-page":"733","article-title":"Simple functional encryption schemes for inner products","author":"M. Abdalla","key":"26"},{"first-page":"333","article-title":"Fully secure functional encryption for inner products, from standard assumptions","author":"S. Agrawal","key":"27"},{"first-page":"36","article-title":"Cca-secure inner-product functional encryption from projective hash functions","author":"F. Benhamouda","key":"28"},{"key":"29","first-page":"125","article-title":"Decentralized attribute-based signatures","volume-title":"Public-Key Cryptography-PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography Lecture Notes in Computer Science","author":"T. Okamoto","year":"2013"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-018-1149-1"},{"key":"31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-26059-4_15","article-title":"Functional signcryption: notion, construction, and applications","volume-title":"Provable Security-9th International Conference, ProvSec 2015, Proceedings. Lecture Notes in Computer Science","author":"P. Datta","year":"2015"},{"key":"32","first-page":"167","article-title":"Hierarchical functional signcryption: notion and construction","volume-title":"Provable Security-13th International Conference, ProvSec 2019 Lecture Notes in Computer Science","author":"D. Pan","year":"2019"},{"key":"33","article-title":"Private functional signatures: definition and construction","volume-title":"Information Security and Privacy-23rd Australasian Conference, ACISP 2018 Lecture Notes in Computer Science","author":"S. Li","year":"2018"},{"key":"34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-73420-8_37","article-title":"Unrestricted aggregate signatures","volume-title":"Automata, Languages and Programming, 34th International Colloquium, ICALP 2007 Lecture Notes in Computer Science","author":"M. Bellare","year":"2007"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6699974.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6699974.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6699974.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T22:50:14Z","timestamp":1615589414000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2021\/6699974\/"}},"subtitle":[],"editor":[{"given":"Liguo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,3,12]]},"references-count":34,"alternative-id":["6699974","6699974"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6699974","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2021,3,12]]}}}