{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:20:03Z","timestamp":1725618003856},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642380037"},{"type":"electronic","value":"9783642380044"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38004-4_15","type":"book-chapter","created":{"date-parts":[[2013,4,22]],"date-time":"2013-04-22T08:24:16Z","timestamp":1366619056000},"page":"225-240","source":"Crossref","is-referenced-by-count":1,"title":["Authenticating Email Search Results"],"prefix":"10.1007","author":[{"given":"Olga","family":"Ohrimenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hobart","family":"Reynolds","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1952982.1952994","volume":"14","author":"G. Ateniese","year":"2011","unstructured":"Ateniese, G., Burns, R., Curtmola, R., Herring, J., Khan, O., Kissner, L., Peterson, Z., Song, D.: Remote data checking using provable data possession. ACM Trans. Inf. Syst. Secur.\u00a014(1), 12:1\u201312:34 (2011)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10462-009-9109-6","volume":"29","author":"E. Blanzieri","year":"2008","unstructured":"Blanzieri, E., Bryl, A.: A survey of learning-based techniques of email spam filtering. Artif. Intell. Rev.\u00a029(1), 63\u201392 (2008)","journal-title":"Artif. Intell. Rev."},{"issue":"2","key":"15_CR3","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. Cryptology\u00a021(2), 149\u2013177 (2008)","journal-title":"J. Cryptology"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/1180405.1180417","volume-title":"Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006","author":"R. Curtmola","year":"2006","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, pp. 79\u201388. ACM, New York (2006)"},{"issue":"3","key":"15_CR5","doi-asserted-by":"crossref","first-page":"291","DOI":"10.3233\/JCS-2003-11302","volume":"11","author":"P. Devanbu","year":"2003","unstructured":"Devanbu, P., Gertz, M., Martel, G., Stubblebine, S.G.: Authentic data publication over the internet. J. Comput. Secur.\u00a011(3), 291\u2013314 (2003)","journal-title":"J. Comput. Secur."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-00457-5_8","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2009","unstructured":"Dodis, Y., Vadhan, S., Wichs, D.: Proofs of retrievability via hardness amplification. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 109\u2013127. Springer, Heidelberg (2009)"},{"unstructured":"Enron Email Dataset, \n                    \n                      http:\/\/www.cs.cmu.edu\/~enron\/\n                    \n                    \n                   (accessed on January 2012)","key":"15_CR7"},{"doi-asserted-by":"crossref","unstructured":"Erway, C., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, CCS 2009, pp. 213\u2013222. ACM, New York (2009)","key":"15_CR8","DOI":"10.1145\/1653662.1653688"},{"doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Oblivious RAM simulation with efficient worst-case access overhead. In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security, CCSW 2011, pp. 95\u2013100 (2011)","key":"15_CR9","DOI":"10.1145\/2046660.2046680"},{"doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Privacy-preserving group data access via stateless oblivious RAM simulation. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 157\u2013167. SIAM (2012)","key":"15_CR10","DOI":"10.1137\/1.9781611973099.14"},{"issue":"10","key":"15_CR11","first-page":"920","volume":"5","author":"M.T. Goodrich","year":"2012","unstructured":"Goodrich, M.T., Nguyen, D., Ohrimenko, O., Papamanthou, C., Tamassia, R., Triandopoulos, N., Lopes, C.V.: Efficient verification of web-content searching through authenticated web crawlers. PVLDB\u00a05(10), 920\u2013931 (2012)","journal-title":"PVLDB"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s00453-009-9355-7","volume":"60","author":"M.T. Goodrich","year":"2011","unstructured":"Goodrich, M.T., Tamassia, R., Triandopoulos, N.: Efficient authenticated data structures for graph connectivity and geometric search problems. Algorithmica\u00a060(3), 505\u2013552 (2011)","journal-title":"Algorithmica"},{"unstructured":"Goodrich, M.T., Tamassia, R., Yao, D.: Accredited DomainKeys: a service architecture for improved email validation. In: Proceedings of the Conference on Email and Anti-Spam, CEAS 2005 (July 2005)","key":"15_CR13"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1145\/1315245.1315317","volume-title":"Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS 2007","author":"A. Juels","year":"2007","unstructured":"Juels, A., Kaliski Jr., B.S.: PORs: proofs of retrievability for large files. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS 2007, pp. 584\u2013597. ACM, New York (2007)"},{"unstructured":"Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Financial Cryptography and Data Security, FC 2013 (to appear, 2013)","key":"15_CR15"},{"unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: CS2: A searchable cryptographic cloud storage system. Technical report, Microsoft Research (2011), \n                    \n                      http:\/\/research.microsoft.com\/pubs\/148632\/CS2.pdf","key":"15_CR16"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/2382196.2382298","volume-title":"Proceedings of the 19th ACM Conference on Computer and Communications Security, CCS 2012","author":"S. Kamara","year":"2012","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 19th ACM Conference on Computer and Communications Security, CCS 2012, pp. 965\u2013976. ACM, New York (2012)"},{"unstructured":"Leiba, B., Fenton, J.: DomainKeys Identified Mail (DKIM): Using digital signatures for domain verification. In: Proceedings of the Conference on Email and Anti-Spam, CEAS 2007 (August 2007)","key":"15_CR18"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R.C. Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 218\u2013238. Springer, Heidelberg (1990)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"L. Nguyen","year":"2005","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 275\u2013292. Springer, Heidelberg (2005)"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-22792-9_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"C. Papamanthou","year":"2011","unstructured":"Papamanthou, C., Tamassia, R., Triandopoulos, N.: Optimal verification of operations on dynamic sets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 91\u2013110. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry - An Introduction. Springer (1985)","key":"15_CR22","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-25385-0_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"E. Shi","year":"2011","unstructured":"Shi, E., Chan, T.H.H., Stefanov, E., Li, M.: Oblivious RAM with o((logn)3) worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 197\u2013214. Springer, Heidelberg (2011)"},{"unstructured":"Stefanov, E., Shi, E., Song, D.: Towards Practical Oblivious RAM. In: Proceedings of the 19th Network and Distributed System Security Symposium, NDSS 2012 (2012)","key":"15_CR24"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-39658-1_2","volume-title":"Algorithms - ESA 2003","author":"R. Tamassia","year":"2003","unstructured":"Tamassia, R.: Authenticated data structures. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 2\u20135. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comput. Surv.\u00a038(2) (2006)","key":"15_CR26","DOI":"10.1145\/1132956.1132959"}],"container-title":["Lecture Notes in Computer Science","Security and Trust Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38004-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T13:37:27Z","timestamp":1557668247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38004-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642380037","9783642380044"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38004-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}