skip to main content
10.1145/1341771.1341775acmotherconferencesArticle/Chapter ViewAbstractPublication PagescomputeConference Proceedingsconference-collections
research-article

SPKI/SDSI certificate chain discovery with generic constraints

Published:18 January 2008Publication History

ABSTRACT

The SPKI/SDSI is a security infrastructure whose principal goal is to facilitate the building of secure, scalable, distributed computing systems. Given a set of SPKI/SDSI certificates, the decision on granting access to a resource by a user is taken by using a certificate chain discovery process. SPKI/SDSI infrastructure allows validity specification. The validity specification is a time period during which a certificate is valid. This validity specification, as defined in the specification RFC-2693, allows for limited constraints on the certificate. But the specification also allows for more powerful constraints specification. In this paper we demonstrate how weak Monadic Second Order (WS1S) logic can be used for specification of general validity constraint, with specific example provided for time constraints which is represented as interval on an abstract domain, and manipulated as WS1S formula. We also show this logic can be combined with Weighted Pushdown System (WPDS) to formally answer most of authorization questions based on the given validity period.

References

  1. J. R. Büchi. Weak second order arithmetic and finite automata. Z. Math. Logik Grundlag. Math., 6:66--92, 1960.Google ScholarGoogle ScholarCross RefCross Ref
  2. D. E. Clarke. Spki/sdsi http server/certificate chain discovery in spki/sdsi, September 2001. Supervisor-Frank Thomson Leighton.Google ScholarGoogle Scholar
  3. J. Elgaard, N. Klarlund, and A. Møller. MONA 1.x: new techniques for WS1S and WS2S.Google ScholarGoogle Scholar
  4. C. M. Ellison, B. Frantz, B. Lampson, R. Rivest, B. Thomas, and T. Ylonen. Spki certificate theory (rfc 2693), September 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In CAV '00: Proceedings of the 12th International Conference on Computer Aided Verification, pages 232--247, London, UK, 2000. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Howell and D. Kotz. A formal semantics for spki. Technical report, Hanover, NH, USA, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. N. Klarlund and A. Møller. MONA Version 1.4 User Manual. BRICS, Department of Computer Science, University of Aarhus, January 2001.Google ScholarGoogle Scholar
  8. N. Klarlund, A. Møller, and M. I. Schwartzbach. MONA implementation secrets. International Journal of Foundations of Computer Science, 13(4):571--586, 2002.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. T. Reps, S. Schwoon, S. Jha, and D. Melski. Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program., 58(1--2):206--263, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. S. Schwoon. Moped: A model-checker for pushdown systems. Technical report, Computer Sciences Department, University of Wisconsin, 2002.Google ScholarGoogle Scholar
  11. S. Schwoon. Wpds: A library for weighted pushdown systems. Technical report, Computer Sciences Department, University of Wisconsin, 2003.Google ScholarGoogle Scholar
  12. S. Schwoon, S. Jha, T. Reps, and S. Stubblebine. On generalized authorization problems. Computer Security Foundations Workshop, 00:202, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  13. S. Schwoon, H. Wang, S. Jha, and T. Reps. Distributed certificate-chain discovery in SPKI/SDSI. Technical Report TR-1526, Computer Sciences Department, University of Wisconsin, August 2005.Google ScholarGoogle Scholar

Index Terms

  1. SPKI/SDSI certificate chain discovery with generic constraints

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Other conferences
            COMPUTE '08: Proceedings of the 1st Bangalore Annual Compute Conference
            January 2008
            195 pages
            ISBN:9781595939500
            DOI:10.1145/1341771

            Copyright © 2008 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 18 January 2008

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            Overall Acceptance Rate114of622submissions,18%
          • Article Metrics

            • Downloads (Last 12 months)1
            • Downloads (Last 6 weeks)0

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader