{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T10:43:35Z","timestamp":1742208215928,"version":"3.38.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,1,2]],"date-time":"2012-01-02T00:00:00Z","timestamp":1325462400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s11432-011-4480-8","type":"journal-article","created":{"date-parts":[[2012,1,2]],"date-time":"2012-01-02T08:54:22Z","timestamp":1325494462000},"page":"1172-1185","source":"Crossref","is-referenced-by-count":4,"title":["Leakproof secret sharing protocols with applications to group identification scheme"],"prefix":"10.1007","volume":"55","author":[{"given":"ChunMing","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ShuHong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,2]]},"reference":[{"key":"4480_CR1","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir A. How to share a secret. Commun ACM, 1979, 22: 616\u2013613","journal-title":"Commun ACM"},{"key":"4480_CR2","doi-asserted-by":"crossref","unstructured":"Blakley G R. Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, New York, USA, 1979. 313\u2013317","DOI":"10.1109\/MARK.1979.8817296"},{"key":"4480_CR3","doi-asserted-by":"crossref","unstructured":"Feldman P. A practical scheme for non-interactive verifiable secret sharing. In: Proceedings of 28th IEEE Symposium on Foundations of Computer Science, Los Angeles, 1987. 427\u2013437","DOI":"10.1109\/SFCS.1987.4"},{"key":"4480_CR4","doi-asserted-by":"crossref","unstructured":"Pedersen T P. Non-interactive and information-theoretic secure verifiable secret sharing. In: Advances in Cryptology-CRYPTO, Santa Barbara, California, USA, 1992. 129\u2013140","DOI":"10.1007\/3-540-46766-1_9"},{"key":"4480_CR5","doi-asserted-by":"crossref","unstructured":"Rabin T, Ben-Or M. Verifiable secret sharing and multiparty protocols with honest majority. In: 21st ACM Symposium on Theory of Computing, Seattle, WA, USA, 1989. 73\u201385","DOI":"10.1145\/73007.73014"},{"key":"4480_CR6","doi-asserted-by":"crossref","unstructured":"Stadler M. Publicly verifiable secret sharing. In: Advances in Crypto-EUROCRYPT, Saragossa, Spain, 1996. 190\u2013199","DOI":"10.1007\/3-540-68339-9_17"},{"key":"4480_CR7","doi-asserted-by":"crossref","unstructured":"Schoenmakers B. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Advances in Cryptology-CRYPTO, Santa Barbara, California, USA, 1999. 148\u2013164","DOI":"10.1007\/3-540-48405-1_10"},{"key":"4480_CR8","first-page":"131","volume":"26","author":"C. M. Tang","year":"2009","unstructured":"Tang C M, Pei D Y, Zhao Y M, et al. A publicly verifiable secret sharing scheme with information-theoretic security. J ShenZhen Univ, 2009, 26: 131\u2013136","journal-title":"J ShenZhen Univ"},{"key":"4480_CR9","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser S, Micali S, Rackoff C. The knowledge complexity of interactive proof systems. SIAM J Comput, 1989, 18: 186\u2013208","journal-title":"SIAM J Comput"},{"key":"4480_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"Goldreich O, Oren Y. Definitions and properties of zero-knowledge proof systems. J Crypt, 1994, 7: 1\u201332","journal-title":"J Crypt"},{"key":"4480_CR11","doi-asserted-by":"crossref","unstructured":"Barak B. How to go beyond the black-box simulation barrier. In: Proceedings of 42nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, 2001. 106\u2013115","DOI":"10.1109\/SFCS.2001.959885"},{"key":"4480_CR12","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard G, Chaum D, Crepeau C. Minimum disclosure proofs of knowledge. J Comput Syst Sci, 1988, 37: 156\u2013189","journal-title":"J Comput Syst Sci"},{"key":"4480_CR13","doi-asserted-by":"crossref","unstructured":"Dwork C, Naor M, Sahai A. Concurrent zero-knowledge. In: 30th ACM Symposium on Theory of Computing, Dallas, Taxas, USA, 1998. 409\u2013418","DOI":"10.1145\/276698.276853"},{"key":"4480_CR14","doi-asserted-by":"crossref","unstructured":"Damgard I. Effcient Concurrent zero-knowledge in the auxiliary string model. In: Advances in Crypto-EUROCRYPT, Bruges, Belgium, 2000. 418\u2013430","DOI":"10.1007\/3-540-45539-6_30"},{"key":"4480_CR15","doi-asserted-by":"crossref","unstructured":"Kilian J, Petrank E, Rackoff C. Lower bounds for zero-knowledge on the Internet. In: Proceedings of 39th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, 1998. 484\u2013492","DOI":"10.1109\/SFCS.1998.743499"},{"key":"4480_CR16","doi-asserted-by":"crossref","unstructured":"Rosen A. A note on the round-complexity of Concurrent Zero-Knowledge. In: Advances in Cryptology-CRYPTO, Santa Barbara, California, USA, 2000. 451\u2013468","DOI":"10.1007\/3-540-44598-6_28"},{"key":"4480_CR17","doi-asserted-by":"crossref","unstructured":"Richardson R, Kilian J. On the concurrent composition of zero-knowledge proofs. In: Advances in Crypto-EUROCRYPT, Prague, Czech Republic, 1999. 415\u2013431","DOI":"10.1007\/3-540-48910-X_29"},{"key":"4480_CR18","doi-asserted-by":"crossref","unstructured":"Canetti R, Goldreich O, Goldwasser S, et al. Resettable zero-knowledge. In: 32nd ACM Symposium on Theory of Computing, Portland, OR, USA, 2000. 235\u2013244","DOI":"10.1145\/335305.335334"},{"key":"4480_CR19","unstructured":"Canetti R. Universally composable security: a new paradigm for cryptographic protocols. In: 34th ACM Symposium on Theory of Computing, Montr\u00e9al, Qu\u00e9bec, Canada, 2002. 494\u2013503"},{"key":"4480_CR20","unstructured":"Ben-Or M, Goldwasser S, Kilian J, et al. Multi-prover interactive proofs: how to remove intractability. In: 20th ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 1988. 113\u2013131"},{"key":"4480_CR21","doi-asserted-by":"crossref","unstructured":"Bellare M, Goldreich O. On defining proofs of knowledge. In: Advances of Cryptology-CRYPTO, Santa Barbara, California, USA, 1992. 390\u2013420","DOI":"10.1007\/3-540-48071-4_28"},{"key":"4480_CR22","unstructured":"Fiat A, Shamir A. How to prove yourself: Practical solutions to identification and signature problems. In: Advances in Cryptology-CRYPTO, Santa Barbara, California, USA, 1987. 186\u2013194"},{"key":"4480_CR23","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Feige U, Fiat A, Shamir A. Zero-knowledge proofs of identity. J Crypt, 1988, 1: 77\u201394","journal-title":"J Crypt"},{"key":"4480_CR24","doi-asserted-by":"crossref","unstructured":"Schnorr C P. Efficient identification and signatures for smart cards. In: Advances in Cryptology-CRYPTO\u201989, Santa Barbara, California, USA, 1990, 239\u2013252","DOI":"10.1007\/0-387-34805-0_22"},{"key":"4480_CR25","doi-asserted-by":"crossref","unstructured":"Chase M, Lysyanskaya A. On signatures of knowledge. In: Advances in Cryptology-CRYPTO, Santa Barbara, California, USA, 2006. 78\u201396","DOI":"10.1007\/11818175_5"},{"key":"4480_CR26","doi-asserted-by":"crossref","unstructured":"Tang C M, Pei D Y, Yao Z A. Efficient zaps and signatures of knowledges. In: Proceeding of IEEE International Conference on Computational Intelligence and Security(CIS\u20192007), IEEE Computer Society, 2007. 637\u2013641","DOI":"10.1109\/CIS.2007.108"},{"key":"4480_CR27","doi-asserted-by":"crossref","unstructured":"De Santis A, Di Crescenzo G, Persiano G, et al. On monotone formula closure of SZK. In: Proceedings of 35th IEEE Symposium on Foundations of Computer Science (FOCS 94), IEEE Computer Society, 1994. 454\u2013465","DOI":"10.1109\/SFCS.1994.365745"},{"key":"4480_CR28","doi-asserted-by":"crossref","unstructured":"Cramer R, Damgard I, Schoenmakers B. Proofs of partial knowledge and simplified design of witness hiding protocols. In: Advances in Cryptology-CRYPTO, Santa Barbara, California, USA, 1994. 174\u2013187","DOI":"10.1007\/3-540-48658-5_19"},{"key":"4480_CR29","first-page":"355","volume":"20","author":"Y. Lee","year":"2007","unstructured":"Lee Y, Choi B. Zero-knowledge group identification and hidden group signature for smart cards using bilinear pairings. J Chungcheong Math Soc, 2007, 20: 355\u2013356","journal-title":"J Chungcheong Math Soc"},{"key":"4480_CR30","unstructured":"Sazena A, Soh B, Priymak S. Zero-knowledge blind identification for smart cards using bilinear pairings. Cryptology e-Print Archive, Report 2005\/343, 2005"},{"key":"4480_CR31","doi-asserted-by":"crossref","unstructured":"Canetti R, Gennaro R, Jarecki S, et al. Adaptive security for threshold cryptosystems. In: Advances in Cryptology-Eurocrypt\u201999, Prague, Czech Repubic, 1999. 98\u2013116","DOI":"10.1007\/3-540-48405-1_7"},{"key":"4480_CR32","doi-asserted-by":"crossref","unstructured":"Desmedt Y, Frankel Y. Threshold cryptosystems. In: Advances in Cryptology-CRYPTO\u201989, Santa Barbara, California, USA, 1990. 307\u2013315","DOI":"10.1007\/0-387-34805-0_28"},{"key":"4480_CR33","doi-asserted-by":"crossref","unstructured":"Gennaro R, Jarecki S, Krawczyk H, et al. Robust Threshold DSS signatures. In: Advances in Cryptology-Eurocrypt, Saragossa, Spain, 1996. 354\u2013371","DOI":"10.1007\/3-540-68339-9_31"},{"key":"4480_CR34","doi-asserted-by":"crossref","unstructured":"Shoup V. Practical threshold signatures. In: Advances in Cryptology-EUROCRYPT, Bruges, Belgium, 2000, 207\u2013220","DOI":"10.1007\/3-540-45539-6_15"},{"key":"4480_CR35","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y. G. Desmedt","year":"1994","unstructured":"Desmedt Y G. Threshold cryptography. Euro Trans Telecommun, 1994, 5: 449\u2013457","journal-title":"Euro Trans Telecommun"},{"key":"4480_CR36","unstructured":"Brassard G, Crepeau C. Non-transitive transfer of confidence: a perfect zero-knowledge interactive protocol for SAT and beyond. In: Proceedings of 27th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, 1986"},{"key":"4480_CR37","unstructured":"Damgard I. On \u03a3-protocols. CPT 2004. Available at http:\/\/www.daimi.au.dk\/ivan\/Sigma.ps , 2002"},{"key":"4480_CR38","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/s11432-008-0003-7","volume":"51","author":"C. M. Tang","year":"2008","unstructured":"Tang C M, Pei D Y, Wang X F, et al. Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs. Sci China Ser F-Inf Sci, 2008, 51: 128\u2013144","journal-title":"Sci China Ser F-Inf Sci"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4480-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-011-4480-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4480-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T10:08:05Z","timestamp":1742206085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-011-4480-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,2]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["4480"],"URL":"https:\/\/doi.org\/10.1007\/s11432-011-4480-8","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"type":"print","value":"1674-733X"},{"type":"electronic","value":"1869-1919"}],"subject":[],"published":{"date-parts":[[2012,1,2]]}}}