MétaCan
Menu
Back to cohort
Record W2109871184 · doi:10.1109/hicss.2007.207

Enabling Web Services Policy Negotiation with Privacy preserved using XACML

2007· article· en· W2109871184 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldSocial Sciences
TopicAccess Control and Trust
Canadian institutionsOntario Tech University
FundersNational Natural Science Foundation of China
KeywordsXACMLNegotiationComputer sciencePrivacy policyEnforcementWeb serviceContext (archaeology)Information privacyMarkup languageAccess controlKnowledge managementWorld Wide WebComputer securityXMLPolitical science

Abstract

fetched live from OpenAlex

In recent Web services research, there are increasing demands and discussions about negotiation technologies for different Web services applications. One of the important topics is the policy negotiation. As many business activities become automated, policy compliance negotiation between human agents can be a bottleneck. In this paper, we focus on the policy negotiation research issues in privacy policy. We adopt the extensible Access Control Markup Language (XACML) as a policy description language and explore its potential in privacy policy negotiation. We first formalize the negotiation process in the context of Web services. Then, we illustrate the policy negotiation model by introducing a policy negotiation point (PNP) between the policy enforcement point (PEP) and policy decision point (PDP) in the XACML policy management architecture. We discuss different phases in a privacy policy negotiation and finally we illustrate how PNP can help on negotiating policies through an example scenario

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.297
Threshold uncertainty score0.986

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.029
GPT teacher head0.338
Teacher spread0.310 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations24
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicAccess Control and TrustFrench-language works237,207