{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T21:29:30Z","timestamp":1778707770523,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1016\/s0140-3664(99)00029-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:53:54Z","timestamp":1027608834000},"page":"717-722","source":"Crossref","is-referenced-by-count":94,"title":["An efficient nonrepudiable threshold proxy signature scheme with known signers"],"prefix":"10.1016","volume":"22","author":[{"given":"Hung-Min","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/S0140-3664(99)00029-8_BIB1","first-page":"1338","article-title":"Proxy signatures: delegation of the power to sign messages","volume":"E79-A","author":"Mambo","year":"1996","journal-title":"IEICE Trans. Fundamentals"},{"key":"10.1016\/S0140-3664(99)00029-8_BIB2","series-title":"Proc. 3rd ACM Conference on Computer and Communications Security","first-page":"48","article-title":"Proxy signatures for delegating signing operation","author":"Mambo","year":"1996"},{"issue":"1","key":"10.1016\/S0140-3664(99)00029-8_BIB3","first-page":"94","article-title":"Proposal of an automatic signature scheme using a complier","volume":"E79-A","author":"Usuda","year":"1996","journal-title":"IEICE Trans. Fundamentals"},{"key":"10.1016\/S0140-3664(99)00029-8_BIB4","doi-asserted-by":"crossref","unstructured":"V. Varadharajan, P. Allen, S. Black, An analysis of the proxy problem in distributed systems, Proc. 1991 IEEE Computer Society Symposium on Research in Security and Privacy, 1991, pp. 225\u2013275.","DOI":"10.1109\/RISP.1991.130793"},{"key":"10.1016\/S0140-3664(99)00029-8_BIB5","doi-asserted-by":"crossref","unstructured":"B.C. Neuman, Proxy-based authorization and accounting for distributed systems, Proc. 13th International Conference on Distributed Systems, 1993, pp. 283\u2013291.","DOI":"10.1109\/ICDCS.1993.287698"},{"key":"10.1016\/S0140-3664(99)00029-8_BIB6","article-title":"Proxy signatures, revisited. ICICS\u201997","volume":"1334","author":"Kim","year":"1997"},{"key":"10.1016\/S0140-3664(99)00029-8_BIB7","unstructured":"K. Zhang, Threshold proxy signature schemes. 1997 Information Security Workshop, Japan, September, 1997, pp. 191\u2013197."},{"key":"10.1016\/S0140-3664(99)00029-8_BIB8","article-title":"On Zhang\u2019s nonrepudiable proxy signature schemes\u2019 ACISP\u201998","volume":"1438","author":"Lee","year":"1998"},{"key":"10.1016\/S0140-3664(99)00029-8_BIB9","unstructured":"H.M. Sun, N.Y. Lee, T. Hwang, On threshold proxy signatures, manuscript, IEE Proc. Computers and Digital Techn. (submitted)."},{"key":"10.1016\/S0140-3664(99)00029-8_BIB10","article-title":"Distributed provers with applications to undeniable signatures. Proc. EUROCRYPT\u201991","volume":"547","author":"Pedersen","year":"1991"},{"key":"10.1016\/S0140-3664(99)00029-8_BIB11","unstructured":"G.R. Blakley, Safeguarding cryptographic keys, Proc. AFIPs 1979 National Computer Conference, New York, 48 (1979) 313\u2013317."},{"issue":"11","key":"10.1016\/S0140-3664(99)00029-8_BIB12","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. of the ACM"},{"key":"10.1016\/S0140-3664(99)00029-8_BIB13","series-title":"Cryptography and data security","author":"Denning","year":"1983"},{"key":"10.1016\/S0140-3664(99)00029-8_BIB14","doi-asserted-by":"crossref","unstructured":"R.L. Rivest, The MD5 message digest algorithm. RFC 1321, April 1992.","DOI":"10.17487\/rfc1321"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366499000298?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366499000298?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T21:21:07Z","timestamp":1556400067000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366499000298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":14,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0140366499000298"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(99)00029-8","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}