{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T21:20:59Z","timestamp":1792099259259,"version":"4.4.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T00:00:00Z","timestamp":1567641600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T00:00:00Z","timestamp":1567641600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10207-019-00466-7","type":"journal-article","created":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T05:52:59Z","timestamp":1567662779000},"page":"453-464","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Concise ID-based mercurial functional commitments and applications to zero-knowledge sets"],"prefix":"10.1007","volume":"19","author":[{"given":"Chunhui","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaofeng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1562-5105","authenticated-orcid":false,"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,9,5]]},"reference":[{"issue":"2","key":"466_CR1","doi-asserted-by":"publisher","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. 37(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"466_CR2","doi-asserted-by":"crossref","unstructured":"Chase, M., Healy, A., Lysyanskaya, A., Malkin, T., Reyzin, L.: Mercurial commitments with applications to zero-knowledge sets. In: Advances in Cryptology-EUROCRYPT 2005, no. 3494 in LNCS, pp. 422\u2013439. Springer (2005)","DOI":"10.1007\/11426639_25"},{"key":"466_CR3","doi-asserted-by":"crossref","unstructured":"Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: TCC 2010, no. 5978 in LNCS, pp. 499\u2013517. Springer (2010)","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"466_CR4","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: PKC 2013, no. 7778 in LNCS, pp. 55\u201372. Springer (2013)","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"466_CR5","unstructured":"Libert, B., Ramanna, S., Yung, M.: Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions. In: 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016) (2016)"},{"issue":"6","key":"466_CR6","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1016\/j.compeleceng.2012.06.013","volume":"38","author":"C Wu","year":"2012","unstructured":"Wu, C., Chen, X., Li, Q., Long, D.: Efficient id-based non-malleable trapdoor commitment. Comput. Electr. Eng. 38(6), 1647\u20131657 (2012)","journal-title":"Comput. Electr. Eng."},{"key":"466_CR7","doi-asserted-by":"publisher","DOI":"10.1080\/02533839.2018.1537803","author":"C Wu","year":"2019","unstructured":"Wu, C., Steinbach, B., Sun, Z., Lin, C.: Improved generic construction of chameleon hash to group elements. J. Chin. Inst. Eng. (2019). \nhttps:\/\/doi.org\/10.1080\/02533839.2018.1537803","journal-title":"J. Chin. Inst. Eng."},{"issue":"21","key":"466_CR8","doi-asserted-by":"publisher","first-page":"4192","DOI":"10.1016\/j.ins.2008.06.022","volume":"178","author":"X Chen","year":"2008","unstructured":"Chen, X., Zhang, F., Tian, H., Wei, B., Susilo, W., Mu, Y., Lee, H., Kim, K.: Efficient generic on-line\/off-line (threshold) signatures without key exposure. Inf. Sci. 178(21), 4192\u20134203 (2008)","journal-title":"Inf. Sci."},{"key":"466_CR9","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ins.2013.12.020","volume":"265","author":"X Chen","year":"2014","unstructured":"Chen, X., Zhang, F., Susilo, W., Tian, H., Li, J., Kim, K.: Identity-based chameleon hashing and signatures without key exposure. Inf. Sci. 265, 198\u2013210 (2014)","journal-title":"Inf. Sci."},{"key":"466_CR10","doi-asserted-by":"crossref","unstructured":"Kate, A., Zaverucha, G., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Advances in Cryptology-ASIACRYPT 2010, no. 6477 in LNCS, pp. 177\u2013194. Springer (2010)","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"466_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: TCC 2011, no. 6597 in LNCS, pp. 253\u2013273. Springer (2011)","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"466_CR12","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: STOC 2015, pp. 469\u2013477 (2015)","DOI":"10.1145\/2746539.2746576"},{"key":"466_CR13","unstructured":"Micali, S., Rabin, M.O., Kilian, J.: Zero-knowledge sets. In: FOCS 2003, pp. 80\u201391 (2003)"},{"key":"466_CR14","doi-asserted-by":"crossref","unstructured":"Merkle, R.: A digital signature based on a conventional encryption function. In: Advances in Cryptology-CRYPTO 1988, no. 403 in LNCS, pp. 369\u2013378. Springer (1988)","DOI":"10.1007\/3-540-48184-2_32"},{"key":"466_CR15","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Micali, S.: Independent zero-knowledge sets. In: ICALP 2006, no. 4052 in LNCS, pp. 34\u201345. Springer (2006)","DOI":"10.1007\/11787006_4"},{"key":"466_CR16","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D., Messina, M.: Zero-knowledge sets with short proofs. In: Advances in Cryptology-EUROCRYPT 2008, no. 4965 in LNCS, pp. 433\u2013450. Springer (2008)","DOI":"10.1007\/978-3-540-78967-3_25"},{"key":"466_CR17","doi-asserted-by":"crossref","unstructured":"Katz, J., Ostrovsky, R., Rabin, M.: Identity-based zero-knowledge. In: SCN 2004, no. 3352 in LNCS, pp. 180\u2013192. Springer (2004)","DOI":"10.1007\/978-3-540-30598-9_13"},{"key":"466_CR18","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In: Advances in Cryptology-EUROCRYPT 1996, no. 1070 in LNCS, pp. 143\u2013154. Springer (1996)","DOI":"10.1007\/3-540-68339-9_13"},{"issue":"39","key":"466_CR19","doi-asserted-by":"publisher","first-page":"5498","DOI":"10.1016\/j.tcs.2011.05.031","volume":"412","author":"X Chen","year":"2011","unstructured":"Chen, X., Susilo, W., Zhang, F., Tian, H., Li, J.: Identity-based trapdoor mercurial commitments and applications. Theor. Comput. Sci. 412(39), 5498\u20135512 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"466_CR20","first-page":"69","volume":"10","author":"X Chen","year":"2015","unstructured":"Chen, X., Huang, X., Li, J., Ma, J., Lou, W., Wong, D.S.: New algorithms for secure outsourcing of large-scale systems of linear equations. IEEE Trans. Dependable Secure Comput. 10(1), 69\u201378 (2015)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"9","key":"466_CR21","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TPDS.2013.180","volume":"25","author":"X Chen","year":"2014","unstructured":"Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. IEEE Trans. Parallel Distrib. Syst. 25(9), 2386\u20132396 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"466_CR22","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1016\/j.ins.2017.11.063","volume":"479","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Jiang, T., Li, K., Castiglione, A., Chen, X.: New publicly verifiable computation for batch matrix multiplication. Inf. Sci. 479, 664\u2013678 (2019)","journal-title":"Inf. Sci."},{"key":"466_CR23","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.future.2016.12.016","volume":"78","author":"H Huang","year":"2018","unstructured":"Huang, H., Chen, X., Wu, Q., Huang, X., Shen, J.: Bitcoin-based fair payments for outsourcing computations of fog devices. Future Gener. Comput. Syst. 78, 850\u2013858 (2018)","journal-title":"Future Gener. Comput. Syst."},{"issue":"5","key":"466_CR24","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1109\/TDSC.2014.2366471","volume":"12","author":"X Chen","year":"2015","unstructured":"Chen, X., Li, J., Huang, X., Ma, J., Lou, W.: New publicly verifiable databases with efficient updates. IEEE Trans. Dependable Secure Comput. 12(5), 546\u2013556 (2015)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"10","key":"466_CR25","doi-asserted-by":"publisher","first-page":"3184","DOI":"10.1109\/TC.2015.2512870","volume":"65","author":"X Chen","year":"2016","unstructured":"Chen, X., Li, J., Weng, J., Ma, J., Lou, W.: Verifiable computation over large database with incremental updates. IEEE Trans. Comput. 65(10), 3184\u20133195 (2016)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"466_CR26","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/TIFS.2017.2758746","volume":"13","author":"M Miao","year":"2018","unstructured":"Miao, M., Ma, J., Huang, X., Wang, Q.: Efficient verifiable databases with insertion\/deletion operations from delegating polynomial functions. IEEE Trans. Inf. Forensics Secur. 13(2), 511\u2013520 (2018)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"466_CR27","doi-asserted-by":"crossref","unstructured":"Wang, J., Chen, X., Sun, S., Liu, J., Au, M., Zhan, Z.: Towards efficient verifiable conjunctive keyword search for large encrypted database. In: European Symposium on Research in Computer Security (ESORICS), no. 11099 in LNCS, pp. 83\u2013100. Springer (2018)","DOI":"10.1007\/978-3-319-98989-1_5"},{"key":"466_CR28","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ins.2018.05.024","volume":"456","author":"H Yuan","year":"2018","unstructured":"Yuan, H., Chen, X., Jiang, T., Zhang, X., Yan, Z., Xiang, Y.: Dedupdum: secure and scalable data deduplication with dynamic user management. Inf. Sci. 456, 159\u2013173 (2018)","journal-title":"Inf. Sci."},{"key":"466_CR29","doi-asserted-by":"crossref","unstructured":"Chase, M., Ostrovsky, R., Visconti, I.: Executable proofs, input-size hiding secure computation and a new ideal world. In: Advances in Cryptology-EUROCRYPT 2015, no. 9057 in LNCS, pp. 532\u2013560. Springer (2015)","DOI":"10.1007\/978-3-662-46803-6_18"},{"key":"466_CR30","doi-asserted-by":"crossref","unstructured":"Shinagawa, K., Nuida, K., Nishide, T., Hanaoka, G., Okamoto, E.: Size-hiding computation for multiple parties. In: Advances in Cryptology-ASIACRYPT 2016, no. 10032 in LNCS, pp. 937\u2013966. Springer (2016)","DOI":"10.1007\/978-3-662-53890-6_31"},{"key":"466_CR31","doi-asserted-by":"crossref","unstructured":"Kamara, S., Moataz, T.: Sql on structurally-encrypted databases. In: Advances in Cryptology-ASIACRYPT 2018, no. 11272 in LNCS, pp. 149\u2013180. Springer (2018)","DOI":"10.1007\/978-3-030-03326-2_6"},{"key":"466_CR32","doi-asserted-by":"crossref","unstructured":"Mironov, I., Segev, G., Shahaf, I.: Strengthening the security of encrypted databases: Non-transitive joins. In: TCC 2017, no. 10678 in LNCS, pp. 631\u2013661. Springer (2017)","DOI":"10.1007\/978-3-319-70503-3_21"},{"key":"466_CR33","doi-asserted-by":"crossref","unstructured":"Hofheinz, D., Kiltz, E.: Programmable hash functions and their applications. In: Advances in Cryptology-CRYPTO 2008, no. 5157 in LNCS, pp. 21\u201338. Springer (2008)","DOI":"10.1007\/978-3-540-85174-5_2"},{"key":"466_CR34","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating 2-dnf formulas on ciphertexts. In: TCC 2005, no. 3378 in LNCS, pp. 325\u2013341. Springer (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"466_CR35","doi-asserted-by":"crossref","unstructured":"Lewko, A., Waters, B.: New techniques for dual system encryption and fully secure hibe with short ciphertexts. In: TCC 2010, no. 5978 in LNCS, pp. 455\u2013479. Springer (2010)","DOI":"10.1007\/978-3-642-11799-2_27"},{"key":"466_CR36","doi-asserted-by":"crossref","unstructured":"Catalano, D., Dodis, Y., Visconti, I.: Mercurial commitments: Minimal assumptions and efficient constructions. In: TCC 2006, no. 3876 in LNCS, pp. 120\u2013144. Springer (2006)","DOI":"10.1007\/11681878_7"},{"key":"466_CR37","doi-asserted-by":"crossref","unstructured":"Chase, M., Meiklejohn, S.: D\u00e9j\u00e0 q: Using dual systems to revisit q-type assumptions. In: Advances in Cryptology-EUROCRYPT 2014, no. 8441 in LNCS, pp. 622\u2013639. Springer (2014)","DOI":"10.1007\/978-3-642-55220-5_34"},{"key":"466_CR38","doi-asserted-by":"crossref","unstructured":"Cha, J., Cheon, J.: An identity-based signature from gap diffie-hellman groups. In: PKC 2003, no. 2567 in LNCS, pp. 18\u201330. Springer (2003)","DOI":"10.1007\/3-540-36288-6_2"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-019-00466-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-019-00466-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-019-00466-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T23:29:51Z","timestamp":1599175791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-019-00466-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,5]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["466"],"URL":"https:\/\/doi.org\/10.1007\/s10207-019-00466-7","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,5]]},"assertion":[{"value":"5 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article (IJIS-D-18-00250_R1) does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}