메뉴 건너뛰기




Volumn 2003-January, Issue , 2003, Pages 202-216

On generalized authorization problems

Author keywords

Access control; Authentication; Authorization; Contracts; Government; Privacy; Public key; Resource management; Security; Specification languages

Indexed keywords

ACCESS CONTROL; ALGORITHMS; CONTRACTS; DATA PRIVACY; PROBLEM SOLVING; SECURITY OF DATA; SECURITY SYSTEMS; SPECIFICATION LANGUAGES;

EID: 84942241879     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2003.1212714     Document Type: Conference Paper
Times cited : (30)

References (50)
  • 6
  • 7
    • 0002863367 scopus 로고
    • Valuation of trust in open networks
    • Computer Security - ESORICS '94, Springer-Verlag
    • T. Beth, M. Borcherding, and B. Klein. Valuation of trust in open networks. In Computer Security - ESORICS '94, volume 875 of Lec. Notes in Comp. Sci., pages 3-18. Springer-Verlag, 1994.
    • (1994) Lec. Notes in Comp. Sci. , vol.875 , pp. 3-18
    • Beth, T.1    Borcherding, M.2    Klein, B.3
  • 9
    • 84982899264 scopus 로고    scopus 로고
    • The role of trust management in distributed systems security
    • Vitek and Jensen, editors, Secure Internet Programming: Security Issues for Mobile and Distributed Objects
    • M. Blaze, J. Feigenbaum, J. Ioannidis, and A. Keromytis. The role of trust management in distributed systems security. In Vitek and Jensen, editors, Secure Internet Programming: Security Issues for Mobile and Distributed Objects, pages 185-210, 1999. LNCS 1603.
    • (1999) LNCS , vol.1603 , pp. 185-210
    • Blaze, M.1    Feigenbaum, J.2    Ioannidis, J.3    Keromytis, A.4
  • 11
    • 84944409047 scopus 로고    scopus 로고
    • Reachability analysis of pushdown automata: Application to model checking
    • Proc. CONCUR, Springer-Verlag
    • A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. In Proc. CONCUR, volume 1243 of Lec. Notes in Comp. Sci., pages 135-150. Springer-Verlag, 1997.
    • (1997) Lec. Notes in Comp. Sci. , vol.1243 , pp. 135-150
    • Bouajjani, A.1    Esparza, J.2    Maler, O.3
  • 13
  • 17
    • 0016949746 scopus 로고
    • A lattice model of secure information flow
    • D. Denning. A lattice model of secure information flow. Communications of the ACM, 19(5), 1976.
    • (1976) Communications of the ACM , vol.19 , Issue.5
    • Denning, D.1
  • 20
    • 84944409009 scopus 로고    scopus 로고
    • Efficient algorithms for model checking pushdown systems
    • Proc. Computer-Aided Verif., July
    • J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Proc. Computer-Aided Verif., volume 1855 of Lec. Notes in Comp. Sci., pages 232-247, July 2000.
    • (2000) Lec. Notes in Comp. Sci. , vol.1855 , pp. 232-247
    • Esparza, J.1    Hansel, D.2    Rossmanith, P.3    Schwoon, S.4
  • 21
    • 84978974912 scopus 로고    scopus 로고
    • Model-checking LTL with regular valuations for pushdown systems
    • Proceedings of TACAS'01, Springer
    • J. Esparza, A. Kučera, and S. Schwoon. Model-checking LTL with regular valuations for pushdown systems. In Proceedings of TACAS'01, volume 2031 of LNCS, pages 306-339. Springer, 2001.
    • (2001) LNCS , vol.2031 , pp. 306-339
    • Esparza, J.1    Kučera, A.2    Schwoon, S.3
  • 24
    • 77955202238 scopus 로고    scopus 로고
    • Analysis of SPKI/SDSI certificates using model checking
    • IEEE Computer Society Press
    • S. Jha and T. Reps. Analysis of SPKI/SDSI certificates using model checking. In IEEE Comp. Sec. Found. Workshop (CSFW). IEEE Computer Society Press, 2002.
    • (2002) IEEE Comp. Sec. Found. Workshop (CSFW)
    • Jha, S.1    Reps, T.2
  • 27
    • 0002210838 scopus 로고
    • A generalization of Dijkstra's algorithm
    • D. Knuth. A generalization of Dijkstra's algorithm. Inf. Proc. Let., 5(1):1-5, 1977.
    • (1977) Inf. Proc. Let. , vol.5 , Issue.1 , pp. 1-5
    • Knuth, D.1
  • 28
    • 84957803553 scopus 로고    scopus 로고
    • Confidence valuation in a public-key infrastructure based on uncertain evidence
    • R. Kohlas and U. Maurer. Confidence valuation in a public-key infrastructure based on uncertain evidence. In Public Key Cryptography, pages 93-112, 2000.
    • (2000) Public Key Cryptography , pp. 93-112
    • Kohlas, R.1    Maurer, U.2
  • 29
    • 0026684778 scopus 로고
    • Authentication in distributed systems: Theory and practice
    • B. Lampson, M. Abadi, M. Burrows, and E. Wobber. Authentication in distributed systems: Theory and practice. Trans. on Comp. Syst,, 10(4):265-310, 1992.
    • (1992) Trans. on Comp. Syst , vol.10 , Issue.4 , pp. 265-310
    • Lampson, B.1    Abadi, M.2    Burrows, M.3    Wobber, E.4
  • 30
    • 84942417001 scopus 로고    scopus 로고
    • Distributed credential chain discovery in trust management
    • To appear in
    • N. Li, W. Winsborough, and J. Mitchell. Distributed credential chain discovery in trust management. To appear in J. Comp. Sec..
    • J. Comp. Sec.
    • Li, N.1    Winsborough, W.2    Mitchell, J.3
  • 31
    • 84947294004 scopus 로고    scopus 로고
    • Modeling a public-key infrastructure
    • Computer Security - ESORICS '96, Springer-Verlag
    • U. Maurer. Modeling a public-key infrastructure. In Computer Security - ESORICS '96, volume 1146 of Lec. Notes in Comp. Sci. Springer-Verlag, 1996.
    • (1996) Lec. Notes in Comp. Sci. , vol.1146
    • Maurer, U.1
  • 32
    • 0021691733 scopus 로고
    • Heuristics for finding a maximum number of disjoint bounded paths
    • Y. Perl and D. Ronen. Heuristics for finding a maximum number of disjoint bounded paths. Networks, 14:531-544, 1984.
    • (1984) Networks , vol.14 , pp. 531-544
    • Perl, Y.1    Ronen, D.2
  • 33
    • 35448990873 scopus 로고    scopus 로고
    • System description: Twelf - A meta-logical framework for deductive systems
    • H. Ganzinger, editor, Int. Conf. on Auto. Deduc., Springer-Verlag, July
    • F. Pfenning and C. Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In H. Ganzinger, editor, Int. Conf. on Auto. Deduc., pages 202-206. Springer-Verlag, LNAI 1632, July 1999.
    • (1999) LNAI , vol.1632 , pp. 202-206
    • Pfenning, F.1    Schürmann, C.2
  • 34
    • 21344434504 scopus 로고    scopus 로고
    • Bounded Incremental Computation
    • Springer-Verlag
    • G. Ramalingam. Bounded Incremental Computation, volume 1089 of Lec. Notes in Comp. Sci. Springer-Verlag, 1996.
    • (1996) Lec. Notes in Comp. Sci. , vol.1089
    • Ramalingam, G.1
  • 35
    • 0032290722 scopus 로고    scopus 로고
    • Resilient authentication using path independence
    • Dec.
    • M. Reiter and S. Stubblebine. Resilient authentication using path independence. Trans. on Computers, 47(12):1351-1362, Dec. 1998.
    • (1998) Trans. on Computers , vol.47 , Issue.12 , pp. 1351-1362
    • Reiter, M.1    Stubblebine, S.2
  • 37
    • 0029180939 scopus 로고
    • Precise interprocedural dataflow analysis via graph reachability
    • New York, NY, ACM Press
    • T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Symp. on Princ. of Prog. Lang., pages 49-61, New York, NY, 1995. ACM Press.
    • (1995) Symp. on Princ. of Prog. Lang. , pp. 49-61
    • Reps, T.1    Horwitz, S.2    Sagiv, M.3
  • 39
    • 84958042111 scopus 로고    scopus 로고
    • Can we eliminate certificate revocation lists?
    • R. Hirschfeld, editor, Feb.
    • R. Rivest. Can we eliminate certificate revocation lists? In R. Hirschfeld, editor, Financial Cryptography, pages 178-183, Feb. 1998.
    • (1998) Financial Cryptography , pp. 178-183
    • Rivest, R.1
  • 40
    • 0005874223 scopus 로고
    • Path problems in graphs
    • G. Tinhofer, E. Mayr, H. Noltemeier, and M.M. Syslo (eds.) in cooperation with R. Albrecht, Springer-Verlag Computing Supplementum 7
    • G. Rote. Path problems in graphs. In G. Tinhofer, E. Mayr, H. Noltemeier, and M.M. Syslo (eds.) in cooperation with R. Albrecht, Computational Graphs Theory, Springer-Verlag Computing Supplementum 7. 1990.
    • (1990) Computational Graphs Theory
    • Rote, G.1
  • 41
    • 0030263395 scopus 로고    scopus 로고
    • Precise interprocedural dataflow analysis with applications to constant propagation
    • M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comp. Sci., 167:131-170, 1996.
    • (1996) Theor. Comp. Sci. , vol.167 , pp. 131-170
    • Sagiv, M.1    Reps, T.2    Horwitz, S.3
  • 43
    • 0002823436 scopus 로고
    • Two approaches to interprocedural data flow analysis
    • S. Muchnick and N. Jones, editors, chapter 7, Prentice-Hall, Englewood Cliffs, NJ
    • M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189-234. Prentice-Hall, Englewood Cliffs, NJ, 1981.
    • (1981) Program Flow Analysis: Theory and Applications , pp. 189-234
    • Sharir, M.1    Pnueli, A.2
  • 44
    • 0029210673 scopus 로고
    • Recent-secure authentication: Enforcing revocation in distributed systems
    • May
    • S. Stubblebine. Recent-secure authentication: Enforcing revocation in distributed systems. In Symp. on Research in Sec. and Privacy, pages 224-234, May 1995.
    • (1995) Symp. on Research in Sec. and Privacy , pp. 224-234
    • Stubblebine, S.1
  • 45
    • 0036504654 scopus 로고    scopus 로고
    • An authentication logic with formal semantics supporting synchronization, revocation, and recency
    • Mar.
    • S. Stubblebine and R. Wright. An authentication logic with formal semantics supporting synchronization, revocation, and recency. Trans. on Softw. Eng., 28(3), Mar. 2002.
    • (2002) Trans. on Softw. Eng. , vol.28 , Issue.3
    • Stubblebine, S.1    Wright, R.2
  • 46
    • 85030836096 scopus 로고
    • Grammar flow analysis
    • H. Alblas and B. Melichar, editors, Attribute Grammars, Applications and Systems, Prague, Czechoslovakia, June Springer-Verlag
    • U. Möencke and R. Wilhelm. Grammar flow analysis. In H. Alblas and B. Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lec. Notes in Comp. Sci., pages 151-186, Prague, Czechoslovakia, June 1991. Springer-Verlag.
    • (1991) Lec. Notes in Comp. Sci. , vol.545 , pp. 151-186
    • Möencke, U.1    Wilhelm, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.