{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:50:10Z","timestamp":1742961010933,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447901"},{"type":"electronic","value":"9783662447918"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-44791-8_11","type":"book-chapter","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T13:40:31Z","timestamp":1410442831000},"page":"172-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Encryption Schemes Secure Against Profiling Adversaries"],"prefix":"10.1007","author":[{"given":"Sandra","family":"D\u00edaz-Santiago","sequence":"first","affiliation":[]},{"given":"Debrup","family":"Chakraborty","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,12]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-45353-9_12","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M Abdalla","year":"2001","unstructured":"Abdalla, M., Bellare, M., Rogaway, P.: The oracle Diffie-Hellman assumptions and an analysis of DHIES. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, p. 143. Springer, Heidelberg (2001)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-30576-7_2","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Hardness amplification of weakly verifiable puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 17\u201333. Springer, Heidelberg (2005)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"D\u00fcrmuth, M.: Useful password hashing: how to waste computing cycles with style. In: Zurco, M.E., Beznosov, K., Whalen, T., Longstaff, T. (eds.) NSPW, pp. 31\u201340. ACM (2013)","DOI":"10.1145\/2535813.2535817"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-642-15317-4_14","volume-title":"Security and Cryptography for Networks","author":"S Dziembowski","year":"2010","unstructured":"Dziembowski, S.: How to pair with a human. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 200\u2013218. Springer, Heidelberg (2010)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Golle, P., Farahat, A.: Defending email communication against profiling attacks. In: Atluri, V., Syverson, P.F., di Vimercati, S.D.C. (eds.) WPES, pp. 39\u201340. ACM (2004)","DOI":"10.1145\/1029179.1029192"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00145-008-9029-7","volume":"22","author":"R Impagliazzo","year":"2009","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V.: Chernoff-type direct product theorems. J. Cryptol. 22(1), 75\u201392 (2009)","journal-title":"J. Cryptol."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: FOCS, pp. 248\u2013253. IEEE (1989)","DOI":"10.1109\/SFCS.1989.63486"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-11799-2_3","volume-title":"Theory of Cryptography","author":"CS Jutla","year":"2010","unstructured":"Jutla, C.S.: Almost optimal bounds for direct product threshold theorem. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 37\u201351. Springer, Heidelberg (2010)"},{"key":"11_CR10","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2008","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall\/CRC, Boca Raton (2008)"},{"key":"11_CR11","unstructured":"Naor, M.: Verification of a human in the loop or identification via the Turing test (1997). http:\/\/www.wisdom.weizmann.ac.il\/~naor\/PAPERS\/human.pdf"},{"key":"11_CR12","unstructured":"NYT. Congress begins deep packet inspection of internet providers (2009). http:\/\/bits.blogs.nytimes.com\/2009\/04\/24\/congress-begins-deep-packet-inspection-of-internet-providers\/"},{"key":"11_CR13","unstructured":"Percival, C.: Stronger key derivation via sequential memory-hard functions. In: BSDCan\u201909 (2009)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Sander, T.: Securing passwords against dictionary attacks. In: Atluri, V. (ed.) ACM Conference on Computer and Communications Security, pp. 161\u2013170. ACM (2002)","DOI":"10.1145\/586110.586133"},{"key":"11_CR15","unstructured":"Provos, N., Mazieres, D.: A future-adaptable password scheme. In: Proceedings of 1999 USENIX Annual Technical Conference, pp. 81\u201392 (1999)"},{"issue":"11","key":"11_CR16","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"11_CR17","unstructured":"Toubiana, V., Narayanan, A., Boneh, D., Nissenbaum, H., Barocas, S.: Privacy preserving targeted advertising. In: Proceedings of Annual Network and Distributed Systems Security Symposium (2010). http:\/\/www.isoc.org\/isoc\/conferences\/ndss\/10\/pdf\/05.pdf"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/3-540-39200-9_18","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"L von Ahn","year":"2003","unstructured":"von Ahn, L., Blum, M., Hopper, N.J., Langford, J.: CAPTCHA: using hard AI problems for security. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 294\u2013311. Springer, Heidelberg (2003)"}],"container-title":["Communications in Computer and Information Science","E-Business and Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44791-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T11:43:45Z","timestamp":1720784625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44791-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447901","9783662447918"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44791-8_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"12 September 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}