Back to search

University of North Texas

Conditional Disclosure of Secrets and Storage over Graphs

Abstract

dc:description

In the era of big data, it is essential to implement practical security and privacy measures to ensure the lawful use of data and provide users with trust and assurance. In the dissertation, I address this issue through several key steps. Firstly, I delve into the problem of conditional secret disclosure, representing it using graphs to determine the most efficient approach for storing and disclosing secrets. Secondly, I extend the conditional disclosure of secrets problem from a single secret to multiple secrets and from a bipartite graph to an arbitrary graph. Thirdly, I remove security constraints to observe how they affect the efficiency of storage and recovery. In our final paper, I explore the secure summation problem, aiming to determine the capacity of total noise. Throughout the dissertation, I leverage information-theoretic tools to address security and privacy concerns.

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
2023

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Li, Zhou
Contributors dc:contributor
  • Sun, Hua
  • Derryberry, R. Thomas
  • Si, Hongbo
  • Fu, Shengli

Subjects

dc:subject × 5

Rights

dc:rights
Statement dc:rights
  • Public
  • Li, Zhou
  • Copyright
  • Copyright is held by the author, unless otherwise noted. All rights Reserved.
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
local-cont-no: submission_3607
https://digital.library.unt.edu/ark:/67531/metadc2257455/
ark: ark:/67531/metadc2257455

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Li, Zhou. Conditional Disclosure of Secrets and Storage over Graphs. University of North Texas, 2023. https://doi.org/10.12794/metadc2257455