{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:16:38Z","timestamp":1649146598646},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Sci Technol"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s11390-005-0270-3","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T08:09:59Z","timestamp":1113898199000},"page":"270-275","source":"Crossref","is-referenced-by-count":1,"title":["Extended Methodology of RS Design and Instances Based on GIP"],"prefix":"10.1007","volume":"20","author":[{"given":"Qian-Hong","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Min","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Rivest R L, Shamir A, Tauman Y. How to leak a secret. In Proc. Asiacrypt?01, Gold Coast, Australia, December 9?13, 2001, pp.552?565.","DOI":"10.1007\/3-540-45682-1_32"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Abe M, Ohkubo M, Suzuki K. 1-out-of-n signatures from a variety of keys. In Proc. Asiacrypt?02, Queenstown, New Zealand, December 1?5, 2002, pp.415?432.","DOI":"10.1007\/3-540-36178-2_26"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Zhang F, Kim K. ID-based blind signature and ring signature from pairings. In Proc. Asiacrypt?02, Queenstown, New Zealand, December 1?5, 2002, pp.533?547.","DOI":"10.1007\/3-540-36178-2_33"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Wong D S, Fung K, Liu J K, Wei V K. On the RS-code construction of ring signature schemes and a threshold setting of RST. In Proc. ICICS?03, Inner-Mongolia, October 10?13, 2003, pp.34?46.","DOI":"10.1007\/978-3-540-39927-8_4"},{"issue":"1","key":"CR5","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I S Reed","year":"1960","unstructured":"Reed I S, Solomon G. Polynomial codes over finite field. SIAM J. Applied Math., 1960, 8(1): 300?304.","journal-title":"SIAM J. Applied Math."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Bresson E, Stern J, Szydlo M. Threshold ring signature for ad hoc groups. In Proc. Crypto?02, Santa Barbara, California, August 18?22, 2002, pp.465?480.","DOI":"10.1007\/3-540-45708-9_30"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Camenisch J. Efficient and generalized group signatures. In Proc. Eurocrypt?97, Konstanz, Germany, May 11?15, 1997, pp.465?479.","DOI":"10.1007\/3-540-69053-0_32"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Abe M, Hoshino F. Remarks on mix-network based on permutation network. In Proc. PKC?01, Cheju Island, South Korea. February 13?15, 2001, pp.317?324.","DOI":"10.1007\/3-540-44586-2_23"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Cramer R, Gennarro R, Schoenmakers B. A secure and optimally efficient multi-authority election scheme. In Proc. Eurocrypt?97, Konstanz, Germany, May 11?15, 1997, pp.103?118.","DOI":"10.1007\/3-540-69053-0_9"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Cramer R, Damg\u00e5rd I, Schoenmakers B. Proofs of partial knowledge and simplified design of witness hiding protocols. In Proc. Crypto?95, Santa Barbara, California, August 27?31, 1995, pp.174?187.","DOI":"10.1007\/3-540-48658-5_19"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Chaum D, Heyst E. Group signatures. In Proc. Eurocrypt?91, Brighton, UK, April 8?11, 1991, pp.257?265.","DOI":"10.1007\/3-540-46416-6_22"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Fiat A, Shamir A. How to prove yourself: Practical solutions of identification and signature problems. In Proc. Crypto?86, Santa Barbara, California, August 13?17, 1986, pp.186?194.","DOI":"10.1007\/3-540-47721-7_12"},{"issue":"2","key":"CR13","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"W P Shor","year":"1997","unstructured":"Shor P W. Polynomial-time algorithm for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing, 1997, 26(2): 1484?1509.","journal-title":"SIAM Journal of Computing"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A. How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design. In Proc. Crypto?86, Santa Barbara, California, August 13?17, 1986, pp.171?185.","DOI":"10.1007\/3-540-47721-7_11"},{"issue":"3","key":"CR15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00196725","volume":"4","author":"P C Schnorr","year":"1991","unstructured":"Schnorr C P. Efficient signature generation for smart cards. J. Cryptology, 1991, 4(3): 239?252.","journal-title":"J. Cryptology"},{"key":"CR16","unstructured":"Blum M. How to prove a theorem so no one else can claim it. In Proc. International Congress of Mathematicians, Berkeley, CA, October 22?27, 1986, pp.1444?1451."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-005-0270-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-005-0270-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-005-0270-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:12:10Z","timestamp":1586218330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-005-0270-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["270"],"URL":"https:\/\/doi.org\/10.1007\/s11390-005-0270-3","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}