{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:28:48Z","timestamp":1725575328215},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642179549"},{"type":"electronic","value":"9783642179556"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-17955-6_3","type":"book-chapter","created":{"date-parts":[[2011,1,16]],"date-time":"2011-01-16T20:29:00Z","timestamp":1295209740000},"page":"31-43","source":"Crossref","is-referenced-by-count":1,"title":["A New Efficient Construction for Non-Malleable Zero-Knowledge Sets"],"prefix":"10.1007","author":[{"given":"Wenpan","family":"Jing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haixia","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_7","volume-title":"Theory of Cryptography","author":"D. Catalano","year":"2006","unstructured":"Catalano, D., Dodis, Y., Visconti, I.: Mercurial Commitments: Minimal Assump-tions and Efficient Constructions. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, Springer, Heidelberg (2006)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-540-78967-3_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"D. Catalano","year":"2008","unstructured":"Catalano, D., Fiore, D., Messina, M.: Zero-knowledge Sets with Short Proofs. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 433\u2013450. Springer, Heidelberg (2008)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/11426639_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M. Chase","year":"2005","unstructured":"Chase, M., Healy, A., Lysyanskaya, A., Malkin, T., Reyzin, L.: Mercurial Commitments and Zero-Knowledge Sets based on general assumptions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 422\u2013439. Springer, Heidelberg (2005)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Signature Schemes Based On the Strong RSA Assumption. In: Proc. the 6th ACM Conference on Computer and Communications Security, Singapore, pp. 46\u201351 (November 1999)","DOI":"10.1145\/319709.319716"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"De Santis, A., Persiano, G.: Zero-knowledge Proofs of Knowledge Without Interaction. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pp. 427\u2013436 (1992)","DOI":"10.1109\/SFCS.1992.267809"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-44987-6_4","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"G. Crescenzo Di","year":"2001","unstructured":"Di Crescenzo, G., Katz, J., Ostrovsky, R., Smith, A.: Efficient and Non-interactive Non-malleable Commitment. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 40\u201359. Springer, Heidelberg (2001)"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"1991","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable Cryptography. SIAM J. Comp.\u00a030(2), 391\u2013437 (1991)","journal-title":"SIAM J. Comp."},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/11787006_4","volume-title":"Automata, Languages and Programming","author":"R. Gennaro","year":"2006","unstructured":"Gennaro, R., Micali, S.: Independent zero-knowledge sets. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 34\u201345. Springer, Heidelberg (2006)"},{"key":"3_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001) ISBN 0-521-79172-3"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1080\/03461238.1995.10413946","volume":"1","author":"A. Granville","year":"1995","unstructured":"Granville, A.: Harold Cramer and the Distribution of Prime Numbers. Scandanavian Actuarial Journal\u00a01, 12\u201328 (1995)","journal-title":"Scandanavian Actuarial Journal"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/11593447_10","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"M. Liskov","year":"2005","unstructured":"Liskov, M.: Updatable zero-knowledge databases. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 174\u2013198. Springer, Heidelberg (2005)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Kilian, J.: Zero-Knowledge Sets. In: Proc. of FOCS 2003, pp. 80\u201391 (2003)","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In: 40th FOCS, pp. 543\u2013553 (1999)","DOI":"10.1109\/SFFCS.1999.814628"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"Shamir, A.: On the Generation of Cryptographically Strong Pseudorandom Sequences. ACM Transactions on Computer Systems\u00a01(1), 38 (1983)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/s11390-008-9119-x","volume":"23","author":"R. Xue","year":"2008","unstructured":"Xue, R., Li, N., Li, J.: Algebraic Construction for Zero-knowledge Sets. Journal of Computer Science and Technology\u00a023(2), 166\u2013175 (2008)","journal-title":"Journal of Computer Science and Technology"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17955-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T19:12:19Z","timestamp":1553368339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17955-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642179549","9783642179556"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17955-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}