{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:43:33Z","timestamp":1743155013367,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213552"},{"type":"electronic","value":"9783319213569"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21356-9_10","type":"book-chapter","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T01:20:09Z","timestamp":1436923209000},"page":"141-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Anonymous Data Collection System with Mediators"],"prefix":"10.1007","author":[{"given":"Hiromi","family":"Arai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keita","family":"Emura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahiro","family":"Matsuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"10_CR1","unstructured":"ISO\/IES 20732. http:\/\/www.iso.org\/iso\/catalogue_detail?csnumber=44375"},{"key":"10_CR2","unstructured":"The PBC (pairing-based cryptography) library. http:\/\/crypto.stanford.edu\/pbc\/"},{"key":"10_CR3","unstructured":"Tor Project. https:\/\/www.torproject.org\/"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Ashrafi, M.Z., Ng, S.K.: Collusion-resistant anonymous data collection method. In: KDD, pp. 69\u201378 (2009)","DOI":"10.1145\/1557019.1557034"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-642-00887-0_41","volume-title":"Database Systems for Advanced Applications","author":"MZ Ashrafi","year":"2009","unstructured":"Ashrafi, M.Z., Ng, S.K.: Efficient and anonymous online data collection. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds.) DASFAA 2009. LNCS, vol. 5463, pp. 471\u2013485. Springer, Heidelberg (2009)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/978-3-319-07536-5_25","volume-title":"Applied Cryptography and Network Security","author":"N Attrapadung","year":"2014","unstructured":"Attrapadung, N., Emura, K., Hanaoka, G., Sakai, Y.: A revocable group signature scheme from identity-based revocation techniques: achieving constant-size revocation list. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 419\u2013437. Springer, Heidelberg (2014). http:\/\/dx.doi.org\/10.1007\/"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21, 149\u2013177 (2008)","journal-title":"J. Cryptol."},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Golle, P.: Almost entirely correct mixing with applications to voting. In: ACM Conference on Computer and Communications Security, pp. 68\u201377 (2002)","DOI":"10.1145\/586110.586121"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: ACM Conference on Computer and Communications Security, pp. 168\u2013177 (2004)","DOI":"10.1145\/1030083.1030106"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Brickell, J., Shmatikov, V.: Efficient anonymity-preserving data collection. In: KDD, pp. 76\u201385 (2006)","DOI":"10.1145\/1150402.1150415"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"issue":"A(5)","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1093\/ietfec\/e89-a.5.1328","volume":"89","author":"J Furukawa","year":"2006","unstructured":"Furukawa, J., Imai, H.: An efficient group signature scheme from bilinear maps. IEICE Trans. 89(A(5)), 1328\u20131338 (2006)","journal-title":"IEICE Trans."},{"key":"10_CR16","unstructured":"Jakobsson, M., Juels, A., Rivest, R.L.: Making mix nets robust for electronic voting by randomized partial checking. In: USENIX Security Symposium, pp. 339\u2013353 (2002)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-24861-0_18","volume-title":"Information Security","author":"S Laur","year":"2011","unstructured":"Laur, S., Willemson, J., Zhang, B.: Round-efficient oblivious database manipulation. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol. 7001, pp. 262\u2013277. Springer, Heidelberg (2011). http:\/\/dx.doi.org\/10.1007\/"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., Venkatasubramanian, S.: $$t$$-closeness: Privacy beyond $$k$$-anonymity and $$\\ell $$-diversity. In: ICDE, pp. 106\u2013115 (2007). http:\/\/dx.doi.org\/10.1109\/ICDE.2007.367856","DOI":"10.1109\/ICDE.2007.367856"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-642-32009-5_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"B Libert","year":"2012","unstructured":"Libert, B., Peters, T., Yung, M.: Group signatures with almost-for-free revocation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 571\u2013589. Springer, Heidelberg (2012)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-642-29011-4_36","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"B Libert","year":"2012","unstructured":"Libert, B., Peters, T., Yung, M.: Scalable group signatures with revocation. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 609\u2013627. Springer, Heidelberg (2012)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-642-10433-6_34","volume-title":"Cryptology and Network Security","author":"B Libert","year":"2009","unstructured":"Libert, B., Vergnaud, D.: Group signatures with verifier-local revocation and backward unlinkability in the standard model. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 498\u2013517. Springer, Heidelberg (2009)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: $$\\ell $$-diversity: privacy beyond $$k$$-anonymity. In: ICDE, p. 24 (2006). http:\/\/dx.doi.org\/10.1109\/ICDE.2006.1","DOI":"10.1109\/ICDE.2006.1"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-00468-1_26","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"T Nakanishi","year":"2009","unstructured":"Nakanishi, T., Fujii, H., Hira, Y., Funabiki, N.: Revocable group signature schemes with constant costs for signing and verifying. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 463\u2013480. Springer, Heidelberg (2009)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/11593447_29","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"T Nakanishi","year":"2005","unstructured":"Nakanishi, T., Funabiki, N.: Verifier-local revocation group signature schemes with backward unlinkability from bilinear maps. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 533\u2013548. Springer, Heidelberg (2005)"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11908739_2","volume-title":"Advances in Information and Computer Security","author":"T Nakanishi","year":"2006","unstructured":"Nakanishi, T., Funabiki, N.: A short verifier-local revocation group signature scheme with backward unlinkability. In: Yoshiura, H., Sakurai, K., Rannenberg, K., Murayama, Y., Kawamura, S. (eds.) IWSEC 2006. LNCS, vol. 4266, pp. 17\u201332. Springer, Heidelberg (2006)"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/978-3-319-12160-4_26","volume-title":"Information Security and Cryptology \u2013 ICISC 2013","author":"T Nakanishi","year":"2014","unstructured":"Nakanishi, T., Funabiki, N.: Revocable group signatures with compact revocation list using accumulators. In: Lee, H.-S., Han, D.-G. (eds.) ICISC 2013. LNCS, vol. 8565, pp. 435\u2013451. Springer, Heidelberg (2014). http:\/\/dx.doi.org\/10."},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-25141-2_13","volume-title":"Advances in Information and Computer Security","author":"Y Sakai","year":"2011","unstructured":"Sakai, Y., Emura, K., Hanaoka, G., Kawai, Y., Omote, K.: Towards restricting plaintext space in public key encryption. In: Iwata, T., Nishigaki, M. (eds.) IWSEC 2011. LNCS, vol. 7038, pp. 193\u2013209. Springer, Heidelberg (2011)"},{"issue":"A(6)","key":"10_CR28","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1587\/transfun.E96.A.1156","volume":"96","author":"Y Sakai","year":"2013","unstructured":"Sakai, Y., Emura, K., Hanaoka, G., Kawai, Y., Omote, K.: Methods for restricting message space in public-key encryption. IEICE Trans. 96(A(6)), 1156\u20131168 (2013)","journal-title":"IEICE Trans."},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-33627-0_26","volume-title":"Privacy in Statistical Databases","author":"K Stokes","year":"2012","unstructured":"Stokes, K.: On computational anonymity. In: Domingo-Ferrer, J., Tinnirello, I. (eds.) PSD 2012. LNCS, vol. 7556, pp. 336\u2013347. Springer, Heidelberg (2012)"},{"issue":"5","key":"10_CR30","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: Achieving $$k$$-anonymity privacy protection using generalization and suppression. Int. J. Uncertainty, Fuzziness Knowl.-Based Syst. 10(5), 571\u2013588 (2002)","journal-title":"Int. J. Uncertainty, Fuzziness Knowl.-Based Syst."},{"issue":"5","key":"10_CR31","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: $$k$$-anonymity: A model for protecting privacy. Int. J. Uncertainty Fuzziness Knowl.-Based Syst. 10(5), 557\u2013570 (2002)","journal-title":"Int. J. Uncertainty Fuzziness Knowl.-Based Syst."},{"issue":"1","key":"10_CR32","first-page":"189","volume":"5","author":"T Tassa","year":"2012","unstructured":"Tassa, T., Mazza, A., Gionis, A.: $$k$$-concealment: an alternative model of $$k$$-type anonymity. Trans. Data Priv. 5(1), 189\u2013222 (2012)","journal-title":"Trans. Data Priv."},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-75248-6_9","volume-title":"Secure Data Management","author":"TM Truta","year":"2007","unstructured":"Truta, T.M., Campan, A., Meyer, P.: Generating microdata with p-sensitive k-anonymity property. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2007. LNCS, vol. 4721, pp. 124\u2013141. Springer, Heidelberg (2007). http:\/\/dx.doi.org\/10.1007\/978-3-540-75248-6_9"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-20149-3_9","volume-title":"Database Systems for Advanced Applications","author":"M Xue","year":"2011","unstructured":"Xue, M., Papadimitriou, P., Ra\u00efssi, C., Kalnis, P., Pung, H.K.: Distributed privacy preserving data collection. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part I. LNCS, vol. 6587, pp. 93\u2013107. Springer, Heidelberg (2011)"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Yang, Z., Zhong, S., Wright, R.N.: Anonymity-preserving data collection. In: KDD, pp. 334\u2013343 (2005)","DOI":"10.1145\/1081870.1081909"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: FOCS 1982, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"issue":"17","key":"10_CR37","doi-asserted-by":"publisher","first-page":"2948","DOI":"10.1016\/j.ins.2009.05.004","volume":"179","author":"S Zhong","year":"2009","unstructured":"Zhong, S., Yang, Z., Chen, T.: k-anonymous data collection. Inf. Sci. 179(17), 2948\u20132963 (2009)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Cryptography and Information Security in the Balkans"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21356-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:09:35Z","timestamp":1676466575000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21356-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213552","9783319213569"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21356-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}