MétaCan
Menu
Back to cohort
Record W1927997230 · doi:10.1002/sec.533

DEFF: a new architecture for private online social networks

2012· article· en· W1927997230 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

VenueSecurity and Communication Networks · 2012
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Data Security
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceExploitArchitecturePopularityPrivate information retrievalLimitingEncryptionInformation leakageProxy (statistics)ComputationComputer securityInformation flowComputer network

Abstract

fetched live from OpenAlex

ABSTRACT In recent years, online social networks (OSNs) have had explosive growth in numbers and popularity. In an OSN, users communicate with each other and share information about themselves. However, limiting the flow of private information across OSNs is very important especially because most OSNs provide insufficient privacy settings to control information leakage. In this paper, we propose a mediated architecture for OSNs that protects users' information from both the OSN provider and unauthorized OSN users. Our proposed approach delegates most of the computation tasks to a semi‐trusted proxy server. We exploit a simplified broadcast encryption method in order to design a dynamic, efficient, flexible, and fine‐grained (DEFF) control system. In the proposed DEFF system, users are allowed to cryptographically categorize their friends into different relations and to share data with arbitrary groups of them. The results of our analysis indicate that the DEFF system fully protects users' privacy and is very efficient in terms of communication and computation complexities. Copyright © 2012 John Wiley & Sons, Ltd.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.932
Threshold uncertainty score0.737

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.000
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0000.001
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.018
GPT teacher head0.262
Teacher spread0.244 · 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