{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:40:10Z","timestamp":1742985610365,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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_13","type":"book-chapter","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T01:20:09Z","timestamp":1436923209000},"page":"194-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Anonymization of Cocks IBE Scheme"],"prefix":"10.1007","author":[{"given":"Gheorghe A.","family":"Schipor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-00862-7_3","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"G Ateniese","year":"2009","unstructured":"Ateniese, G., Gasti, P.: Universally anonymous IBE based on the quadratic residuosity assumption. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 32\u201347. Springer, Heidelberg (2009)"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. SIAM J. Comput. 32(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Martin, L.: Introduction to Identity-Based Encryption. Artech House, Norwood (2008)","DOI":"10.1109\/MC.2008.299"},{"key":"13_CR4","unstructured":"Tiplea, F.L.: Algebric Foundation of Computer Science. Polirom, Algebric Foundation of Computer Science. Polirom, Romanian (2006)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/0-387-34799-2_13","volume-title":"Advances in Cryptology - CRYPTO 1988","author":"IB Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: On the randomness of legendre and jacobi sequences. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 163\u2013172. Springer, Heidelberg (1990)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-77026-8_21","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"G Di Crescenzo","year":"2007","unstructured":"Di Crescenzo, G., Saraswat, V.: Public key encryption with searchable keywords based on jacobi symbols. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 282\u2013296. Springer, Heidelberg (2007)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A Shamir","year":"1985","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47\u201353. Springer, Heidelberg (1985)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-45325-3_16","volume-title":"Cryptography and Coding","author":"P Benachour","year":"2001","unstructured":"Benachour, P., Farrell, P.G., Honary, B.: A line code construction for the adder channel with rates higher than time-sharing. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, p. 166. Springer, Heidelberg (2001)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45682-1_15","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"A Satoh","year":"2001","unstructured":"Satoh, A., Morioka, S., Takano, K., Munetoh, S.: A compact rijndael hardware architecture with S-Box optimization. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, p. 239. Springer, Heidelberg (2001)"},{"key":"13_CR10","volume-title":"Theory and Problems of Statistics","author":"M Spiegel","year":"1992","unstructured":"Spiegel, M.: Theory and Problems of Statistics. McGraw-Hill, New York (1992)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Gentry, C., Hamburg, M.: Space-Efficient Identity Based Encryption Without Pairings. In: Proceedings FOCS 2007 (2007)","DOI":"10.1109\/FOCS.2007.50"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/11593447_16","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"R Hayashi","year":"2005","unstructured":"Hayashi, R., Tanaka, K.: Universally anonymizable public-key encryption. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 293\u2013312. Springer, Heidelberg (2005)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/11535218_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M Abdalla","year":"2005","unstructured":"Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., Shi, H.: Searchable encryption revisited:\u00a0consistency properties, relation to anonymous IBE, and extensions. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 205\u2013222. Springer, Heidelberg (2005)"},{"key":"13_CR14","unstructured":"Halevi, S.: A Sufficient Condition for Key-Privacy. Cryptology ePrint Archive, Report 2005\/05 (2005)"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T10:42:51Z","timestamp":1676025771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21356-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213552","9783319213569"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21356-9_13","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"}}]}}