{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T15:01:49Z","timestamp":1725721309169},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642376818"},{"type":"electronic","value":"9783642376825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37682-5_33","type":"book-chapter","created":{"date-parts":[[2013,4,2]],"date-time":"2013-04-02T21:48:15Z","timestamp":1364939295000},"page":"472-486","source":"Crossref","is-referenced-by-count":3,"title":["Private Over-Threshold Aggregation Protocols"],"prefix":"10.1007","author":[{"given":"Myungsun","family":"Kim","sequence":"first","affiliation":[]},{"given":"Abedelaziz","family":"Mohaisen","sequence":"additional","affiliation":[]},{"given":"Jung Hee","family":"Cheon","sequence":"additional","affiliation":[]},{"given":"Yongdae","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24676-3_3","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Mishra, N., Pinkas, B.: Secure computation of the k\n                  \n                    th\n                  -ranked element. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 40\u201355. Springer, Heidelberg (2004)"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 417\u2013432. Springer, Heidelberg (2002)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-14527-8_4","volume-title":"Privacy Enhancing Technologies","author":"B. Applebaum","year":"2010","unstructured":"Applebaum, B., Ringberg, H., Freedman, M.J., Caesar, M., Rexford, J.: Collaborative, privacy-preserving data aggregation at scale. In: Atallah, M.J., Hopper, N.J. (eds.) PETS 2010. LNCS, vol.\u00a06205, pp. 56\u201374. Springer, Heidelberg (2010)"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Burkhart, M., Dimitropoulos, X.: Fast privacy-preserving top-k queries using secret sharing. In: IEEE ICCCN (2010)","DOI":"10.1109\/ICCCN.2010.5560086"},{"key":"33_CR5","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: Privacy-preserving aggregation of multi-domain network events and statistics. In: USENIX Security (2010)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 285\u2013304. Springer, Heidelberg (2006)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"J. Furukawa","year":"2001","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 368\u2013387. Springer, Heidelberg (2001)"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The foundations of cryptography. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. (1984)","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. J. of Cryptology (2010)","DOI":"10.1007\/s00145-010-9067-9"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-71677-8_25","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"J. Groth","year":"2007","unstructured":"Groth, J., Lu, S.: Verifiable shuffle of large size ciphertexts. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 377\u2013392. Springer, Heidelberg (2007)"},{"key":"33_CR13","unstructured":"Hong, J., Kim, J.W., Kim, J., Park, K., Cheon, J.H.: Constant-round privacy preserving multiset union. In: Cryptology ePrint Archive, 2011\/138 (2011)"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L. Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Mohaisen, A., Hong, D., Nyang, D.: Privacy in location based services: Primitives toward the solution. In: NCM (2008)","DOI":"10.1109\/NCM.2008.137"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-48405-1_36","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 573\u2013590. Springer, Heidelberg (1999)"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Neff, C.: A verifiable secret shuffle and its application to e-voting. In: ACM Conference on Computer and Communications Security, pp. 116\u2013125 (2001)","DOI":"10.1145\/501997.502000"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-24852-1_5","volume-title":"Applied Cryptography and Network Security","author":"L. Nguyen","year":"2004","unstructured":"Nguyen, L., Safavi-Naini, R., Kurosawa, K.: Verifiable shuffles: A formal model and a paillier-based efficient construction with provable security. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 61\u201375. Springer, Heidelberg (2004)"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-71677-8_23","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"T. Nishide","year":"2007","unstructured":"Nishide, T., Ohta, K.: Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 343\u2013360. Springer, Heidelberg (2007)"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"issue":"1","key":"33_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1609956.1609965","volume":"13","author":"Y. Sang","year":"2009","unstructured":"Sang, Y., Shen, H.: Efficient and secure protocols for privacy-preserving set operations. ACM Transactions on Information and System Security (TISSEC) 13(1), 9:1\u20139:35 (2009)","journal-title":"ACM Transactions on Information and System Security (TISSEC)"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving top-k queries. In: ICDE (2005)","DOI":"10.1007\/11362197_11"},{"key":"33_CR23","unstructured":"Xiong, L., Chitti, S., Liu, L.: Topk queries across multiple private databases. In: International Conference on Distributed Computing Systems (ICDCS), pp. 145\u2013154 (2005)"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.: Protocols for secure computations. In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, R., Shi, J., Liu, Y., Zhang, Y.: Verifiable fine-grained top-k queries in tiered sensor networks. In: INFOCOM, pp. 2633\u20132641 (2010)","DOI":"10.1109\/INFCOM.2010.5461927"},{"key":"33_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, R., Zhang, Y., Zhang, C.: Secure top-k query processing via untrusted location-based service providers. In: INFOCOM, pp. 1170\u20131178 (2012)","DOI":"10.1109\/INFCOM.2012.6195476"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37682-5_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T23:12:22Z","timestamp":1557616342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37682-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642376818","9783642376825"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37682-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}