메뉴 건너뛰기




Volumn , Issue , 2006, Pages 257-266

Access control enforcement for conversation-based web services

Author keywords

Access control; Conversations; Transition systems; Web services

Indexed keywords

ACCESS CONTROL; CLIENT SERVER COMPUTER SYSTEMS; DATA PRIVACY; MAXIMUM LIKELIHOOD ESTIMATION; NETWORK SECURITY; INTERNET; SECURITY SYSTEMS; WEB SERVICES;

EID: 34250616363     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1135777.1135818     Document Type: Conference Paper
Times cited : (46)

References (19)
  • 3
    • 0742268963 scopus 로고    scopus 로고
    • Web service conversation modeling: A cornerstone for e-business automation
    • B. Benatallah, F. Casati, and F. Toumani. Web service conversation modeling: A cornerstone for e-business automation. IEEE Internet Computing, 8(1):46-54, 2004.
    • (2004) IEEE Internet Computing , vol.8 , Issue.1 , pp. 46-54
    • Benatallah, B.1    Casati, F.2    Toumani, F.3
  • 9
    • 84964853055 scopus 로고    scopus 로고
    • Access control: Policies, models and mechanisms
    • R. Focardi and F. Guerrieri, editors, Foundations of Security Analysis and Design, Tutorial Lectures, of, Springer Verlag
    • S. De Capitani di Vimercati and P. Samarati. Access control: policies, models and mechanisms. In R. Focardi and F. Guerrieri, editors, Foundations of Security Analysis and Design - Tutorial Lectures, volume 2171 of LNCS. Springer Verlag, 2001.
    • (2001) LNCS , vol.2171
    • De Capitani di Vimercati, S.1    Samarati, P.2
  • 10
    • 0346969678 scopus 로고    scopus 로고
    • An efficient algorithm for computing bisimulation equivalence
    • A. Dovier, C. Piazza, and A. Policriti. An efficient algorithm for computing bisimulation equivalence. Theoretical Computer Science, 311(1-3):221-256, 2004.
    • (2004) Theoretical Computer Science , vol.311 , Issue.1-3 , pp. 221-256
    • Dovier, A.1    Piazza, C.2    Policriti, A.3
  • 11
    • 34250683800 scopus 로고    scopus 로고
    • Interactive credential negotiation for stateful business processes
    • H. Koshutanski and F. Massacci. Interactive credential negotiation for stateful business processes. In Proc. iTrust 2005, 2005.
    • (2005) Proc. iTrust 2005
    • Koshutanski, H.1    Massacci, F.2
  • 12
    • 0028198016 scopus 로고
    • On finding the strongly connected components in a directed graph
    • E. Nuutila and E. Soisalon-Soininen. On finding the strongly connected components in a directed graph. Information Processing Letters, 49:9-14, 1993.
    • (1993) Information Processing Letters , vol.49 , pp. 9-14
    • Nuutila, E.1    Soisalon-Soininen, E.2
  • 17
    • 84947744871 scopus 로고    scopus 로고
    • Modal and temporal logics for processes
    • F. Moller and G.M. Birtwistle, editors, Logics for Concurrency. Structure versus Automata 8th Banff Higher Order Workshop, 1995, Proceedings, of, Springer Verlag
    • C. Stirling. Modal and temporal logics for processes. In F. Moller and G.M. Birtwistle, editors, Logics for Concurrency. Structure versus Automata (8th Banff Higher Order Workshop, 1995, Proceedings), volume 1043 of LNCS. Springer Verlag, 1996.
    • (1996) LNCS , vol.1043
    • Stirling, C.1
  • 18
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • R.E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146-160, 1972.
    • (1972) SIAM Journal on Computing , vol.1 , pp. 146-160
    • Tarjan, R.E.1


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