메뉴 건너뛰기




Volumn , Issue , 2010, Pages 293-304

RunTest: Assuring integrity of dataflow processing in cloud computing infrastructures

Author keywords

cloud computing; secure dataflow processing; service integrity attestation

Indexed keywords

CLOUD COMPUTING; CRITICAL APPLICATIONS; CRITICAL DATA; DATAFLOW; DIFFERENT SERVICES; LIGHT WEIGHT; PERFORMANCE IMPACT; PROCESSING SYSTEMS; RESOURCE SHARING; RUNTIMES; SECURE DATAFLOW PROCESSING; SECURITY PROTECTION; SENSITIVE APPLICATION; SERVICE INTEGRITY; SERVICE PROVIDER; VIRTUAL COMPUTING;

EID: 77954472711     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1755688.1755724     Document Type: Conference Paper
Times cited : (34)

References (45)
  • 4
    • 84873978052 scopus 로고    scopus 로고
    • Software as a Service. http://en.wikipedia.org/wiki/Software as a Service.
    • Software As a Service
  • 5
    • 77954529817 scopus 로고    scopus 로고
    • Virtual Computing Lab. http://vcl.ncsu.edu/.
  • 6
    • 29844449756 scopus 로고    scopus 로고
    • The Design of the Borealis Stream Processing Engine
    • D. J. Abadi and et al. The Design of the Borealis Stream Processing Engine. Proc. of CIDR, 2005.
    • Proc. of CIDR, 2005
    • Abadi, D.J.1
  • 9
    • 74249103090 scopus 로고    scopus 로고
    • Web Services Concepts, Architectures and Applications Series: Data-Centric Systems and Applications
    • G. Alonso amd F. Casati, H. Kuno, and V. Machiraju. Web Services Concepts, Architectures and Applications Series: Data-Centric Systems and Applications. Addison-Wesley Professional, 2002.
    • (2002) Addison-Wesley Professional
    • Alonso, G.1    Casati, F.2    Kuno, H.3    Machiraju, V.4
  • 11
    • 0041848449 scopus 로고    scopus 로고
    • (t,k)-diagnosable system: A generalization of the pmc models
    • T. Araki and Y. Shibata. (t,k)-diagnosable system: A generalization of the pmc models. IEEE Trans. on Computers, 52(7), 2003.
    • (2003) IEEE Trans. on Computers , vol.52 , Issue.7
    • Araki, T.1    Shibata, Y.2
  • 14
    • 84976668743 scopus 로고
    • Algorithm 457: Finding all cliques of an undirected graph
    • C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM, 16(9):575-577, 1973.
    • (1973) Communications of the ACM , vol.16 , Issue.9 , pp. 575-577
    • Bron, C.1    Kerbosch, J.2
  • 15
    • 53249115253 scopus 로고    scopus 로고
    • A note on the problem of reporting maximal cliques
    • F. Cazals and C. Karande. A note on the problem of reporting maximal cliques. Theoretical Computer Science, 407(1-3), 2008.
    • (2008) Theoretical Computer Science , vol.407 , Issue.1-3
    • Cazals, F.1    Karande, C.2
  • 23
    • 1542595336 scopus 로고    scopus 로고
    • STREAM: The Stanford Stream Data Manager
    • The STREAM Group. March
    • The STREAM Group. STREAM: The Stanford Stream Data Manager. IEEE Data Engineering Bulletin, 26(1):19-26, March 2003.
    • (2003) IEEE Data Engineering Bulletin , vol.26 , Issue.1 , pp. 19-26
  • 29
    • 34250621863 scopus 로고    scopus 로고
    • Design, Implementation, and Evaluation of the Linear Road Benchmark on the Stream Processing Core
    • N. Jain and et al. Design, Implementation, and Evaluation of the Linear Road Benchmark on the Stream Processing Core. Proc. of SIGMOD, 2006.
    • Proc. of SIGMOD, 2006
    • Jain, N.1
  • 31
    • 0034909407 scopus 로고    scopus 로고
    • Fundamental study: Enumerating all connected maximal common subgraphs in two graphs
    • I. Koch. Fundamental study: Enumerating all connected maximal common subgraphs in two graphs. Theoretical Computer Science, 250(1-2):1-30, 2001.
    • (2001) Theoretical Computer Science , vol.250 , Issue.1-2 , pp. 1-30
    • Koch, I.1
  • 42
    • 70749106620 scopus 로고    scopus 로고
    • Version 1.2
    • TPM Specifications Version 1.2. https://www.trustedcomputinggroup.org/ downloads/specifications/tpm/tpm.
    • TPM Specifications


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