{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T06:56:00Z","timestamp":1763535360767},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319268224"},{"type":"electronic","value":"9783319268231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26823-1_1","type":"book-chapter","created":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T03:52:17Z","timestamp":1447905137000},"page":"3-18","source":"Crossref","is-referenced-by-count":25,"title":["PUDA \u2013 Privacy and Unforgeability for Data Aggregation"],"prefix":"10.1007","author":[{"given":"Iraklis","family":"Leontiadis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaoutar","family":"Elkhiyaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Melek","family":"\u00d6nen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Refik","family":"Molva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"key":"1_CR1","unstructured":"Akinyele, J.A., Green, M., Rubin, A.D.: Charm: a tool for rapid cryptographic prototyping. \n                      http:\/\/www.charm-crypto.com\/Main.html"},{"key":"1_CR2","unstructured":"Akinyele, J.A., Green, M., Rubin, A.D.: Charm: a framework for rapidly prototyping cryptosystems. IACR Cryptology ePrint Archive, 2011:617 (2011). \n                      http:\/\/eprint.iacr.org\/2011\/617.pdf"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Backes, M., Fiore, D., Reischuk, R.M.: Verifiable delegation of computation on outsourced data. In: ACM Conference on Computer and Communications Security, pp. 863\u2013874 (2013)","DOI":"10.1145\/2508859.2516681"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: EUROCRYPT, pp. 416\u2013432 (2003)","DOI":"10.1007\/3-540-39200-9_26"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"JL Camenisch","year":"2004","unstructured":"Camenisch, J.L., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56\u201372. Springer, Heidelberg (2004)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-38348-9_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Practical homomorphic MACs for arithmetic circuits. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 336\u2013352. Springer, Heidelberg (2013)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-662-44371-2_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Catalano","year":"2014","unstructured":"Catalano, D., Fiore, D., Warinschi, B.: Homomorphic signatures with efficient verification for polynomial functions. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 371\u2013389. Springer, Heidelberg (2014)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/978-3-662-45608-8_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"D Catalano","year":"2014","unstructured":"Catalano, D., Marcedone, A., Puglisi, O.: Authenticating Computation on Groups: New Homomorphic Primitives and Applications. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part II. LNCS, vol. 8874, pp. 193\u2013212. Springer, Heidelberg (2014)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-36594-2_28","volume-title":"Theory of Cryptography","author":"SG Choi","year":"2013","unstructured":"Choi, S.G., Katz, J., Kumaresan, R., Cid, C.: Multi-client non-interactive verifiable computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 499\u2013518. Springer, Heidelberg (2013)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/978-3-642-30057-8_41","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"DM Freeman","year":"2012","unstructured":"Freeman, D.M.: Improved security for linearly homomorphic signatures: a generic framework. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 697\u2013714. Springer, Heidelberg (2012)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-39884-1_10","volume-title":"Financial Cryptography and Data Security","author":"M Joye","year":"2013","unstructured":"Joye, M., Libert, B.: A scalable scheme for privacy-preserving aggregation of time-series data. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 111\u2013125. Springer, Heidelberg (2013)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-22263-4_10","volume-title":"Privacy Enhancing Technologies","author":"K Kursawe","year":"2011","unstructured":"Kursawe, K., Danezis, G., Kohlweiss, M.: Privacy-friendly aggregation for the smart-grid. In: Fischer-H\u00fcbner, S., Hopper, N. (eds.) PETS 2011. LNCS, vol. 6794, pp. 175\u2013191. Springer, Heidelberg (2011)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-319-12280-9_20","volume-title":"Cryptology and Network Security","author":"I Leontiadis","year":"2014","unstructured":"Leontiadis, I., Elkhiyaoui, K., Molva, R.: Private and dynamic time-series data aggregation with trust relaxation. In: Gritzalis, D., Kiayias, A., Askoxylakis, I. (eds.) CANS 2014. LNCS, vol. 8813, pp. 305\u2013320. Springer, Heidelberg (2014)"},{"key":"1_CR14","unstructured":"Leontiadis, I., Elkhyaoui, K., \u00d6nen, M., Molva, R.: Private and unforgeable data aggregation. IACR Cryptology ePrint Archive (2015). \n                      http:\/\/eprint.iacr.org\/2015\/562.pdf"},{"key":"1_CR15","unstructured":"Lynn, B.: The stanford pairing based crypto library. \n                      http:\/\/crypto.stanford.edu\/pbc"},{"key":"1_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-46513-8_14","volume-title":"Selected Areas in Cryptography","author":"A Lysyanskaya","year":"2000","unstructured":"Lysyanskaya, A., Rivest, R., Sahai, A., Wolf, S.: Pseudonym systems. In: Heys, H., Adams, C. (eds.) Selected Areas in Cryptography. LNCS, vol. 1758, pp. 184\u2013199. Springer, Berlin Heidelberg (2000)"},{"key":"1_CR17","unstructured":"Shi, E., Chan, T.-H.H., Rieffel, E.G., Chow, R., Song, D.: Privacy-preserving aggregation of time-series data. In: NDSS (2011)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Sun, H.-M., Lin, Y.-H., Hsiao, Y.-C., Chen, C.-M.: An efficient and verifiable concealed data aggregation scheme in wireless sensor networks. In: International Conference on Embedded Software and Systems, ICESS 2008, pp. 19\u201326, July 2008","DOI":"10.1109\/ICESS.2008.9"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26823-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:13:49Z","timestamp":1559304829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26823-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319268224","9783319268231"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26823-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}