{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T05:36:36Z","timestamp":1737783396209,"version":"3.33.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1007\/s11432-008-0004-6","type":"journal-article","created":{"date-parts":[[2007,12,31]],"date-time":"2007-12-31T05:15:35Z","timestamp":1199078135000},"page":"40-52","source":"Crossref","is-referenced-by-count":0,"title":["Novel \u03a9-protocols for NP"],"prefix":"10.1007","volume":"51","author":[{"given":"Yi","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DongDai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","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 proofsystems. SIAM J Comp, 1989, 18(1): 186\u2013208","journal-title":"SIAM J Comp"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Dwork C, Naor M, Sahai A. Concurrent zero-knowledge. In: Proc. of 30th ACM Symp. on Theory of Computing (STOC\u201998). 1998. 409\u2013418","DOI":"10.1145\/276698.276853"},{"key":"4_CR3","first-page":"570","volume-title":"Proc. of 33rd ACM Symp. on Theory of Computing (STOC\u201901)","author":"R. Canetti","year":"2001","unstructured":"Canetti R, Kilian J, Petrank E, et al. Concurrent zero-knowledge requires \u03a9 (log n) rounds. In: Proc. of 33rd ACM Symp. on Theory of Computing (STOC\u201901). Heraklion, Crete, Greece: ACM Press, 2001, 570\u2013579"},{"key":"4_CR4","unstructured":"Damgard I. Efficient concurrent zero-knowledge in the auxiliary string model. In: Advance in Cryptology-EUROCYPT\u201900. Springer LNCS 1807, 2000, 174\u2013187"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Barak B. How to go beyond the black-box simulation barrier. In: Proc. of 42nd IEEE Symp. on Foundations of Computer Science (FOCS\u201901). 2001. 106\u2013115","DOI":"10.1109\/SFCS.2001.959885"},{"issue":"2","key":"4_CR6","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev D, Dwork C, Naor M. Non-malleable cryptography. SIAM J Comp, 2000, 30(2): 391\u2013437","journal-title":"SIAM J Comp"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"De Santis A, Di Crescenzo G, Ostrovsky R, et al. Robust non-interactive zero knowledge. In: Advance in Cryptology-CRYPTO\u201901. Springer LNCS 2139, 2001, 566\u2013598","DOI":"10.1007\/3-540-44647-8_33"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Sahai A. Non-malleable non-interactive zero-knowledge and adaptive chosen-ciphertext security. In: Proc. of 40th IEEE Symp. on Foundations of Computer Science (FOC S\u201999). 1999, 543\u2013553","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Barak B. Constant-round coin tossing with a man in the middle or realizing the shared random string model. In: Proc. of 43rd IEEE Symp. on Foundations of Computer Science (FOC S\u201902). 2001. 345\u2013355","DOI":"10.1109\/SFCS.2002.1181957"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Pass R, Rosen A. New and improved constructions of non-malleable cryptographic Protocols. In: 37th ACM Symp. on Theory of Computing(STOC\u201905), 2005","DOI":"10.1145\/1060590.1060670"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Katz J. Efficient and non-malleable proofs of plaintext knowledge and applications. In: Advance in Cryptology-EUROCRYPT\u201903. Springer LNCS 2656, 2003, 211\u2013228","DOI":"10.1007\/3-540-39200-9_13"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Garay J, MacKenzie P, Yang K. Strengthening zero-knowledge protocols using signatures. In: Advance in Cryptology-EUROCRYPT\u201903. Springer LNCS 2656, 2003, 177\u2013194","DOI":"10.1007\/3-540-39200-9_11"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Gennaro R. Multi-trapdoor commitments and their applications to non-malleable protocols. In: Advance in Cryptology-CRYPTO\u201904. Springer LNCS 3152, 2004, 220\u2013236","DOI":"10.1007\/978-3-540-28628-8_14"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Fischlin M. Communication-efficient non-interactive proofs of knowledge with online extractors. In: Advances in Cryptology-Crypto 2005. Springer LNCS 3621, 2005, 152\u2013168","DOI":"10.1007\/11535218_10"},{"key":"4_CR15","first-page":"1444","volume-title":"Proc. of ICM\u201986","author":"M. Blum","year":"1986","unstructured":"Blum M. How to prove a theorem so no one else can claim it. In: Proc. of ICM\u201986. Berkeley: American Mathematical Society, 1986. 1444\u20131451"},{"key":"4_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundation of Cryptography-basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich O. Foundation of Cryptography-basic Tools. Cambridge: Cambridge University Press, 2001"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Bellare M, Goldreich O. On defining proofs of knowledge. Advances in Cryptology-CRYPTO\u201992. Springer LNCS 740, 1992, 390\u2013420","DOI":"10.1007\/3-540-48071-4_28"},{"key":"4_CR18","unstructured":"Fiat A, Shamir A. How to prove yourself: Practical solution to identification and signature problems. In: Advance of Cryptology-CRYPTO\u201986. Springer LNCS 263, 1986, 186\u2013189"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Guillou L C, Quisquater J-J. A practical zero-knowledge protocol fitted to security microprocessors minimizing both transmission and memery. In: Advance in Cryptology-EUROCRYPT\u201988. Springer LNCS 330, 1988, 123\u2013128","DOI":"10.1007\/3-540-45961-8_11"},{"issue":"2","key":"4_CR20","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser S, Micali S. Probabilistic encryption. J Comp Syst Sci, 1984, 28(2): 270\u2013299","journal-title":"J Comp Syst Sci"},{"issue":"2","key":"4_CR21","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1137\/0217025","volume":"17","author":"S. Micali","year":"1988","unstructured":"Micali S, Rackoff C, Sloan R H. The notion of security for probabilistic cryptosystems. SIAM J Comp, 1988, 17(2): 412\u2013426","journal-title":"SIAM J Comp"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Cramer R, Damgard I, Schoenmakers B. Proofs of partial knowledge and simplified design of witness hiding protocols. In: Advance in Cryptology-CRYPTO\u201994. Springer LNCS 839, 1994, 174\u2013187","DOI":"10.1007\/3-540-48658-5_19"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0004-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-008-0004-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0004-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T22:53:48Z","timestamp":1737759228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-008-0004-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s11432-008-0004-6","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"type":"print","value":"1009-2757"},{"type":"electronic","value":"1862-2836"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}