{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:15:04Z","timestamp":1770538504261,"version":"3.49.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319580678","type":"print"},{"value":"9783319580685","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-58068-5_37","type":"book-chapter","created":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T06:53:04Z","timestamp":1494831184000},"page":"607-622","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Self-Enforcing Access Control for Encrypted RDF"],"prefix":"10.1007","author":[{"given":"Javier D.","family":"Fern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabrina","family":"Kirrane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Polleres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Steyskal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,16]]},"reference":[{"key":"37_CR1","unstructured":"Abadi, D.J., Marcus, A., Madden, S.R., Hollenbach, K.: Scalable semantic web data management using vertical partitioning. In: Proceedings of Very Large Data Bases, pp. 411\u2013422 (2007)"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-662-46447-2_33","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"M Abdalla","year":"2015","unstructured":"Abdalla, M., Bourse, F., Caro, A., Pointcheval, D.: Simple functional encryption schemes for inner products. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 733\u2013751. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46447-2_33"},{"key":"37_CR3","unstructured":"Arias, M., Fern\u00e1ndez, J.D., Mart\u00ednez-Prieto, M.A., de la Fuente, P.: An empirical study of real-world SPARQL queries. arXiv preprint arXiv:1103.5043 (2011)"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Cash, D., Jaeger, J., Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M.-C., Steiner, M.: Dynamic searchable encryption in very-large databases: data structures and implementation. IACR Cryptology ePrint Archive, 2014:853 (2014)","DOI":"10.14722\/ndss.2014.23264"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-40041-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Cash","year":"2013","unstructured":"Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Ro\u015fu, M.-C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 353\u2013373. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40041-4_20"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/11496137_30","volume-title":"Applied Cryptography and Network Security","author":"Y-C Chang","year":"2005","unstructured":"Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442\u2013455. Springer, Heidelberg (2005). doi:10.1007\/11496137_30"},{"key":"37_CR7","unstructured":"Chase, M., Shen, E.: Pattern matching encryption. IACR Cryptology ePrint Archive, 2014:638 (2014)"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-41338-4_20","volume-title":"The Semantic Web \u2013 ISWC 2013","author":"P Cudr\u00e9-Mauroux","year":"2013","unstructured":"Cudr\u00e9-Mauroux, P., et al.: NoSQL databases for RDF: an empirical evaluation. In: Alani, H., et al. (eds.) ISWC 2013. LNCS, vol. 8219, pp. 310\u2013325. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-41338-4_20"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of Computer and Communications Security, pp. 79\u201388 (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"da Rocha Pinto, P., Dinsdale-Young, T., Dodds, M., Gardner, P., Wheelhouse, M.J.: A simple abstraction for complex concurrent indexes. In: Proceedings of Object-Oriented Programming, Systems, Languages, and Applications, pp. 845\u2013864 (2011)","DOI":"10.1145\/2076021.2048131"},{"key":"37_CR11","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael: AES - The Advanced Encryption Standard","author":"J Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael: AES - The Advanced Encryption Standard. Information Security and Cryptography. Springer, Heidelberg (2002)"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"De Caro, A., Iovino, V.: JPBC: Java pairing based cryptography. In: Proceedings of IEEE Symposium on Computers and Communications, pp. 850\u2013855 (2011)","DOI":"10.1109\/ISCC.2011.5983948"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-662-49301-4_15","volume-title":"The New Codebreakers - Essays Dedicated to David Kahn on the Occasion of His 85th Birthday","author":"S De Capitani di Vimercati","year":"2016","unstructured":"De Capitani di Vimercati, S., Foresti, S., Livraga, G., Samarati, P.: Practical techniques building on encryption for protecting and managing data in the cloud. In: Ryan, P.Y.A., Naccache, D., Quisquater, J.-J. (eds.) The New Codebreakers - Essays Dedicated to David Kahn on the Occasion of His 85th Birthday. LNCS, vol. 9100, pp. 205\u2013239. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49301-4_15"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.websem.2013.01.002","volume":"19","author":"JD Fern\u00e1ndez","year":"2013","unstructured":"Fern\u00e1ndez, J.D., Mart\u00ednez-Prieto, M.A., Guti\u00e9rrez, C., Polleres, A., Arias, M.: Binary RDF representation for publication and exchange (HDT). J. Web Seman. 19, 22\u201341 (2013)","journal-title":"J. Web Seman."},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Gentry, C., et al.: Fully homomorphic encryption using ideal lattices. In: Proceedings of ACM Symposium on Theory of Computing, vol. 9, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Gerbracht, S.: Possibilities to encrypt an RDF-Graph. In: Proceedings of Information and Communication Technologies: From Theory to Applications, pp. 1\u20136 (2008)","DOI":"10.1109\/ICTTA.2008.4530288"},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11574620_24","volume-title":"The Semantic Web \u2013 ISWC 2005","author":"M Giereth","year":"2005","unstructured":"Giereth, M.: On partial encryption of RDF-Graphs. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 308\u2013322. Springer, Heidelberg (2005). doi:10.1007\/11574620_24"},{"issue":"2","key":"37_CR18","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","volume":"3","author":"Y Guo","year":"2005","unstructured":"Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for OWL knowledge base systems. J. Web Seman. 3(2), 158\u2013182 (2005)","journal-title":"J. Web Seman."},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Kaliski, B.: PKCS #5: Password-Based Cryptography Specification Version 2.0. RFC 2898 (Informational), September 2000","DOI":"10.17487\/rfc2898"},{"key":"37_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-39884-1_22","volume-title":"Financial Cryptography and Data Security","author":"S Kamara","year":"2013","unstructured":"Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 258\u2013274. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39884-1_22"},{"key":"37_CR21","unstructured":"Kasten, A., Scherp, A., Armknecht, F., Krause, M.: Towards search on encrypted graph data. In: Proceedings of the International Conference on Society, Privacy and the Semantic Web-Policy and Technology, pp. 46\u201357 (2013)"},{"issue":"2","key":"37_CR22","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00145-012-9119-4","volume":"26","author":"J Katz","year":"2013","unstructured":"Katz, J., Sahai, A., Waters, B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. J. Cryptology 26(2), 191\u2013224 (2013)","journal-title":"J. Cryptology"},{"issue":"2","key":"37_CR23","doi-asserted-by":"publisher","first-page":"311","DOI":"10.3233\/SW-160236","volume":"8","author":"S Kirrane","year":"2017","unstructured":"Kirrane, S., Mileo, A., Decker, S.: Access control and the resource description framework: a survey. Seman. Web 8(2), 311\u2013352 (2017). doi:10.3233\/SW-160236. http:\/\/dx.doi.org\/10.3233\/SW-160236","journal-title":"Seman. Web"},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Phong, L.T.: Kurosawa-desmedt key encapsulation mechanism, revisited. IACR Cryptology ePrint Archive, 2013:765 (2013)","DOI":"10.1007\/978-3-319-06734-6_4"},{"key":"37_CR25","unstructured":"Ladwig, G., Harth, A.: CumulusRDF: linked data management on nested key-value stores. In: Proceedings of Scalable Semantic Web Knowledge Base Systems, p. 30 (2011)"},{"key":"37_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-13190-5_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"A Lewko","year":"2010","unstructured":"Lewko, A., Okamoto, T., Sahai, A., Takashima, K., Waters, B.: Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 62\u201391. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-13190-5_4"},{"key":"37_CR27","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 \u2014 EUROCRYPT 1999","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. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). doi:10.1007\/3-540-48910-X_16"},{"key":"37_CR28","doi-asserted-by":"crossref","unstructured":"Popa, R., Zeldovich, N., Balakrishnan, H.: Cryptdb: a practical encrypted relational dbms. Technical report, MIT-CSAIL-TR\u2013005 (2011)","DOI":"10.1145\/2043556.2043566"},{"issue":"2","key":"37_CR29","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0022-0000(86)90021-8","volume":"33","author":"Y Sagiv","year":"1986","unstructured":"Sagiv, Y.: Concurrent operations on B*-trees with overtaking. J. Comput. Syst. Sci. 33(2), 275\u2013296 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"37_CR30","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: Proceedings of Network and Distributed System Security, vol. 14, pp. 23\u201326 (2014)","DOI":"10.14722\/ndss.2014.23298"},{"key":"37_CR31","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.websem.2016.03.003","volume":"37\u201338","author":"R Verborgh","year":"2016","unstructured":"Verborgh, R., Vander Sande, M., Hartig, O., Van Herwegen, J., De Vocht, L., De Meester, B., Haesendonck, G., Colpaert, P.: Triple pattern fragments: a low-cost knowledge graph interface for the Web. J. Web Seman. 37\u201338, 184\u2013206 (2016)","journal-title":"J. Web Seman."},{"key":"37_CR32","doi-asserted-by":"crossref","unstructured":"Zheleva, E., Getoor, L.: To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles. In: Proceedings of World Wide Web, pp. 531\u2013540 (2009)","DOI":"10.1145\/1526709.1526781"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58068-5_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:59:02Z","timestamp":1750262342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58068-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319580678","9783319580685"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58068-5_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portoro\u017e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esws2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2017.eswc-conferences.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}