Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Garth Heward

dblp:23/8024 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2Software engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Authentication and access control · 77% Cryptographic protocols and secure computation · 23%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%

Topics — the 1 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Services computing and microservices › web services
web service security
0.112010
Protecting data in multi-stakeholder web service system · WWW 2010

Methods — techniques the papers use, named apart from their topics

dynamic protection requirement derivation · 0.2
YearPublicationVenuePosition
2010 Optimizing the Configuration of Web Service Monitors
Garth Heward, Jun Han 0004, Ingo Mueller 0001, Jean-Guy Schneider, Steve Versteeg
ICSOC1
2010 Propagation of Data Protection Requirements in Multi-stakeholder Web Services Systems
Tan Phan, Jun Han 0004, Garth Heward, Steve Versteeg
WISE3
2010 Protecting data in multi-stakeholder web service system
abstract
Current Web Service security standards have inadequate support for end-to-end protection of data when some receivers of the data are unknown to the sender. This paper presents an approach to aid collaborative partner services in properly protecting each other's data. Our approach allows each partner to derive an adequate protection mechanism with minimum performance overhead for each message it sends based on those of the corresponding messages it receives. We modify the message handling mechanisms of Web Service engines to dynamically gather protection requirements for a given outgoing message by aggregating requirements from original owners of message data.
Tan Phan, Jun Han 0004, Garth Heward, Steve Versteeg
WWW3