MétaCan
Menu
Back to cohort
Record W2782565858 · doi:10.1109/glocom.2017.8253982

Achieving Privacy-Preserving Multi Dot-Product Query in Fog Computing-Enhanced IoT

2017· article· en· W2782565858 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
FieldComputer Science
TopicCryptography and Data Security
Canadian institutionsUniversity of New Brunswick
Fundersnot available
KeywordsComputer scienceHomomorphic encryptionScheme (mathematics)Enhanced Data Rates for GSM EvolutionEdge computingEncryptionComputer networkProduct (mathematics)Internet of ThingsDot productDistributed computingComputer securityArtificial intelligence

Abstract

fetched live from OpenAlex

Fog computing-enhanced IoT (Internet of Things), as it can provide better IoT services at the network edge, has received considerable attention in recent years. In this paper, for this new paradigm, we present a new privacy-preserving multi dot-product query scheme, called PMQ, which enables the control center to gain k dot-product results simultaneously in one query. Specifically, in the proposed PMQ scheme, the BGN homomorphic encryption is employed for encrypting query request and response, and a fog device is deployed at the network edge to assist the privacy- preserving k dot-product query. Detailed security analysis shows that the proposed PMQ can achieve better privacy preservation, i.e., no information in query request and response will be disclosed. In addition, extensive simulations are conducted, and the results demonstrate that the proposed PMQ scheme can achieve acceptable efficiency in terms of communication overheads and computational costs.

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.001
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: none
Teacher disagreement score0.480
Threshold uncertainty score0.862

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0050.004
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.037
GPT teacher head0.304
Teacher spread0.267 · 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

Citations14
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicCryptography and Data SecurityFrench-language works237,207