Survey on cyberspace security
H Zhang, W Han, X Lai, D Lin, J Ma, JH Li - Science China Information …, 2015 - Springer
Along with the rapid development and wide application of information technology, human
society has entered the information era. In this era, people live and work in cyberspace …
society has entered the information era. In this era, people live and work in cyberspace …
Universal adaptive construction of verifiable secret sharing and its application to verifiable secure distributed data storage
Secret sharing is a useful method for secure distributed data storage. Such a distributed data
storage can avoid the information leakage under an attack to a limited number of distributed …
storage can avoid the information leakage under an attack to a limited number of distributed …
On the information ratio of non-perfect secret sharing schemes
A secret sharing scheme is non-perfect if some subsets of players that cannot recover the
secret value have partial information about it. The information ratio of a secret sharing …
secret value have partial information about it. The information ratio of a secret sharing …
Visual secret sharing schemes encrypting multiple images
M Sasaki, Y Watanabe - IEEE Transactions on Information …, 2017 - ieeexplore.ieee.org
The aim of this paper is to maximize the range of the access control of visual secret sharing
(VSS) schemes encrypting multiple images. First, the formulation of access structures for a …
(VSS) schemes encrypting multiple images. First, the formulation of access structures for a …
Secure distributed storage: Optimal trade-off between storage rate and privacy leakage
Consider the problem of storing data in a distributed manner over T servers. Specifically, the
data needs to (i) be recoverable from any servers, and (ii) remain private from any z …
data needs to (i) be recoverable from any servers, and (ii) remain private from any z …
Secret-sharing schemes for high slices
In a secret-sharing scheme, a secret is shared among n parties such that the secret can be
recovered by authorized coalitions, while it should be kept hidden from unauthorized …
recovered by authorized coalitions, while it should be kept hidden from unauthorized …
Threshold secret sharing requires a linear size alphabet
We prove that for every n and 1< t< n 1< t< n any t-out-of-n threshold secret sharing scheme
for one-bit secrets requires share size\log (t+ 1) log (t+ 1). Our bound is tight when t= n-1 t= n …
for one-bit secrets requires share size\log (t+ 1) log (t+ 1). Our bound is tight when t= n-1 t= n …
Edge Cooperation Based Coded Caching in Fog Radio Access Networks
Y Chen, Y Jiang, Y Huang, FC Zheng… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
In this paper, we investigate edge cooperation based coded caching in fog radio access
networks (F-RANs). Initially, we propose a cooperative coded caching scheme which utilizes …
networks (F-RANs). Initially, we propose a cooperative coded caching scheme which utilizes …
[HTML][HTML] Optimal linear secret sharing schemes for graph access structures on six participants
M Gharahi, S Khazaei - Theoretical Computer Science, 2019 - Elsevier
The efficiency of a secret sharing scheme is measured via its information ratio. The optimal
information ratio (OIR) of an access structure is the infimum of the information ratios of all …
information ratio (OIR) of an access structure is the infimum of the information ratios of all …