{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:25Z","timestamp":1763467705587},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,6,8]],"date-time":"2005-06-08T00:00:00Z","timestamp":1118188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2006,1]]},"DOI":"10.1007\/s10207-005-0073-0","type":"journal-article","created":{"date-parts":[[2005,6,27]],"date-time":"2005-06-27T17:11:07Z","timestamp":1119892267000},"page":"48-64","source":"Crossref","is-referenced-by-count":22,"title":["Understanding SPKI\/SDSI using first-order logic"],"prefix":"10.1007","volume":"5","author":[{"given":"Ninghui","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"1\u20132","key":"73_CR1","first-page":"3","volume":"6","author":"M. Abadi","year":"1998","unstructured":"Abadi, M.: On SDSI's linked local name spaces. J. Comp. Sec. 6(1\u20132), 3\u201321 (1998)","journal-title":"J. Comp. Sec."},{"issue":"4","key":"73_CR2","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1145\/155183.155225","volume":"15","author":"M. Abadi","year":"1993","unstructured":"Abadi, M., Burrows, M., Lampson, B., Plotkin, G.: A calculus for access control in distributed systems. ACM Trans. Prog. Lang. Syst. 15(4), 706\u2013734 (1993)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"73_CR3","doi-asserted-by":"crossref","unstructured":"Aura, T.: On the structure of delegation networks. In: Proceedings of the 11th IEEE Computer Security Foundations Workshop, pp. 14\u201326. IEEE Computer Society Press (1998)","DOI":"10.1109\/CSFW.1998.683151"},{"key":"73_CR4","unstructured":"Bandmann, O., Dam, M.: A note on SPKI's authorization syntax. In: Pre-Proceedings of 1st Annual PKI Research Workshop (2002) Available from http:\/\/www.cs.dartmouth.edu\/~pki02\/"},{"key":"73_CR5","doi-asserted-by":"crossref","unstructured":"Blaze, M., Feigenbaum, J., Ioannidis, J., Keromytis, A.D.: The KeyNote trust-management system, version 2. IETF RFC 2704, Sept (1999)","DOI":"10.17487\/rfc2704"},{"key":"73_CR6","doi-asserted-by":"crossref","unstructured":"Blaze, M., Feigenbaum, J., Lacy, J.: Decentralized trust management. In: Proceedings of the 1996 IEEE Symposium on Security and Privacy, pp. 164\u2013173. IEEE Computer Society Press (1996)","DOI":"10.1109\/SECPRI.1996.502679"},{"issue":"4","key":"73_CR7","first-page":"285","volume":"9","author":"D. Clarke","year":"2001","unstructured":"Clarke, D., Elien, J.-E., Ellison, C., Fredette, M., Morcos, A., Rivest, R.L.: Certificate chain discovery in SPKI\/SDSI. J. Comp. Sec. 9(4), 285\u2013322 (2001)","journal-title":"J. Comp. Sec."},{"issue":"3","key":"73_CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W.F. Dowling","year":"1984","unstructured":"Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional horn formulae. J. Logic Prog. 1(3), 267\u2013284 (1984)","journal-title":"J. Logic Prog."},{"key":"73_CR9","unstructured":"Ellison, C., Frantz, B., Lampson, B., Rivest, R., Thomas, B., Ylonen, T.: Simple public key certificates. Internet Draft (work in progress), July (1999) Available at http:\/\/world.std.com\/~cme\/spki.txt"},{"key":"73_CR10","doi-asserted-by":"crossref","unstructured":"Ellison, C., Frantz, B., Lampson, B., Rivest, R., Thomas, B., Ylonen, T.: SPKI certificate theory. IETF RFC 2693, Sept. (1999)","DOI":"10.17487\/rfc2693"},{"issue":"1\u20132","key":"73_CR11","first-page":"47","volume":"9","author":"J. Halpern","year":"2001","unstructured":"Halpern, J., van der Meyden, R.: A logic for SDSI's linked local name spaces. J. Comp. Sec. 9(1\u20132), 47\u201374 (2001)","journal-title":"J. Comp. Sec."},{"issue":"4","key":"73_CR12","first-page":"581","volume":"11","author":"J. Halpern","year":"2003","unstructured":"Halpern, J., van der Meyden, R.: A logical reconstruction of SPKI. J. Comp. Sec. 11(4), 581\u2013614 (2003)","journal-title":"J. Comp. Sec."},{"key":"73_CR13","unstructured":"Howell, J.R.: Naming and sharing resources acroos administrative boundaries. PhD thesis, Dartmouth College, May (2000)"},{"key":"73_CR14","doi-asserted-by":"crossref","unstructured":"Howell, J.R., Kotz, D.: A formal semantics for SPKI. In: Proceedings of the Sixth European Symposium on Research in Computer Security (ESORICS 2000), pp. 140\u2013158. Springer, (2000)","DOI":"10.1007\/10722599_9"},{"key":"73_CR15","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. J. Logic Prog. 19\/20, 503\u2013580 (1994)","journal-title":"J. Logic Prog."},{"key":"73_CR16","doi-asserted-by":"crossref","unstructured":"Jha, S., Reps, T.: Analysis of SPKI\/SDSI certificates using model checking. In Proceedings of the 15th IEEE Computer Security Foundations Workshop, pp. 129\u2013144. IEEE Computer Society Press (2002)","DOI":"10.1109\/CSFW.2002.1021812"},{"issue":"1","key":"73_CR17","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/jcss.1995.1051","volume":"51","author":"P.C. Kanellakis","year":"1995","unstructured":"Kanellakis, P.C., Kuper, G.M., Revesz, P.Z.: Constraint query languages. J. Comp. Syst. Sci. 51(1), 26\u201352 (1995)","journal-title":"J. Comp. Syst. Sci."},{"key":"73_CR18","doi-asserted-by":"crossref","unstructured":"Kuper, G., Libkin, L., Paredaens, J. (eds.): constraint Databases. Springer (2000)","DOI":"10.1007\/978-3-662-04031-7"},{"issue":"4","key":"73_CR19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/138873.138874","volume":"10","author":"B. Lampson","year":"1992","unstructured":"Lampson, B., Abadi, M., Burrows, M., Wobber, E.: Authentication in distributed systems: Theory and practice. ACM Trans. Inf. Syst. Sec. 10(4), 265\u2013310 (1992)","journal-title":"ACM Trans. Inf. Syst. Sec."},{"key":"73_CR20","doi-asserted-by":"crossref","unstructured":"Li, N.: Local names in SPKI\/SDSI. In: Proceedings of the 13th IEEE Computer Security Foundations Workshop, pp. 2\u201315. IEEE Computer Society Press (2000)","DOI":"10.1109\/CSFW.2000.856921"},{"issue":"1","key":"73_CR21","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/605434.605438","volume":"6","author":"N. Li","year":"2003","unstructured":"Li, N., Grosof, B.N., Feigenbaum, J.: Delegation logic: A logic-based approach to distributed authorization. ACM Trans. Inf. Syst. Sec. 6(1), 128\u2013171 (2003)","journal-title":"ACM Trans. Inf. Syst. Sec."},{"key":"73_CR22","doi-asserted-by":"crossref","unstructured":"Li, N., Mitchell, J.C.: Datalog with constraints: A foundation for trust management languages. In: Proceedings of the Fifth International Symposium on Practical Aspects of Declarative Languages (PADL 2003), no. 2562 in LNCS, pp. 58\u201373. Springer (2003)","DOI":"10.1007\/3-540-36388-2_6"},{"key":"73_CR23","unstructured":"Li, N., Mitchell, J.C., Qiu, Y., Winsborough, W.H., Seamons, K.E., Halcrow, M., Jacobson, J.: RTML: A Role-based Trust-management Markup Language, Aug. (2002) Unpublished manuscript. Available at http:\/\/www.cs.purdue.edu\/homes\/ninghui\/papers\/rtml.pdf"},{"key":"73_CR24","unstructured":"Li, N., Mitchell, J.C., Winsborough, W.H.: Design of a role-based trust management framework. In: Proceedings of the 2002 IEEE Symposium on Security and Privacy, pp. 114\u2013130. IEEE Computer Society Press (2002)"},{"key":"73_CR25","doi-asserted-by":"crossref","unstructured":"Li, N., Mitchell, J.C., Winsborough, W.H.: Beyond proof-of-compliance: Security analysis in trust management. J. ACM 52(3), (2005)","DOI":"10.1145\/1066100.1066103"},{"issue":"1","key":"73_CR26","first-page":"35","volume":"11","author":"N. Li","year":"2003","unstructured":"Li, N., Winsborough, W.H., Mitchell, J.C.: Distributed credential chain discovery in trust management. J. Comp. Sec. 11(1), 35\u201386 (2003)","journal-title":"J. Comp. Sec."},{"key":"73_CR27","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, Second Edition. Springer (1987)","DOI":"10.1007\/978-3-642-83189-8"},{"key":"73_CR28","doi-asserted-by":"crossref","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform Proofs as a Foundation for Logic Programming, vol. 51 of Annals of Pure and Applied Logic, pp. 125\u2013157. Elsevier Science (1991)","DOI":"10.1016\/0168-0072(91)90068-W"},{"issue":"1\u20132","key":"73_CR29","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0304-3975(99)00177-2","volume":"232","author":"G. Nadathur","year":"2000","unstructured":"Nadathur, G.: Correspondences between classical, intuitionistic and uniform provability. Theoretical Computer Science 232(1\u20132), 273\u2013298 (2000)","journal-title":"Theoretical Computer Science"},{"key":"73_CR30","unstructured":"Rivest, R.L., Lampson, B.: SDSI\u2014a simple distributed security infrastructure, Oct. (1996) Available at http:\/\/theory.lcs. mit.edu\/~rivest\/sdsi11.html"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-005-0073-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-005-0073-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-005-0073-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T23:17:28Z","timestamp":1586301448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-005-0073-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,8]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["73"],"URL":"https:\/\/doi.org\/10.1007\/s10207-005-0073-0","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6,8]]}}}