Study on supply chain strategy based on cost income model and multi-access edge computing under the background of the Internet of Things
L Sun, Y Zhao, W Sun, Z Liu - Neural Computing and Applications, 2020 - Springer
With the application of the Internet of Things, the cold-chain logistics efficiency of fresh
agricultural product remarkably is improved, but the operating costs inevitably rise. Thus, the …
agricultural product remarkably is improved, but the operating costs inevitably rise. Thus, the …
On the cryptographic complexity of the worst functions
We study the complexity of realizing the “worst” functions in several standard models of
information-theoretic cryptography. In particular, for the case of security against passive …
information-theoretic cryptography. In particular, for the case of security against passive …
Succinct computational secret sharing
A secret-sharing scheme enables a dealer to share a secret s among n parties such that
only authorized subsets of parties, specified by a monotone access structure f:{0, 1} n→{0 …
only authorized subsets of parties, specified by a monotone access structure f:{0, 1} n→{0 …
On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate
B Applebaum, B Arkis - ACM Transactions on Computation Theory …, 2020 - dl.acm.org
Consider the following secret-sharing problem: A file s should be distributed between n
servers such that (d-1)-subsets cannot recover the file,(d+ 1)-subsets can recover the file …
servers such that (d-1)-subsets cannot recover the file,(d+ 1)-subsets can recover the file …
Linear secret-sharing schemes for forbidden graph access structures
A secret-sharing scheme realizes the forbidden graph access structure determined by a
graph if the parties are the vertices of the graph and the subsets that can reconstruct the …
graph if the parties are the vertices of the graph and the subsets that can reconstruct the …
Conditional disclosure of secrets: Amplification, closure, amortization, lower-bounds, and separations
B Applebaum, B Arkis, P Raykov… - Annual International …, 2017 - Springer
In the conditional disclosure of secrets problem (Gertner et al. J. Comput. Syst. Sci. 2000)
Alice and Bob, who hold inputs x and y respectively, wish to release a common secret s to …
Alice and Bob, who hold inputs x and y respectively, wish to release a common secret s to …
The share size of secret-sharing schemes for almost all access structures and graphs
The share size of general secret-sharing schemes is poorly understood. The gap between
the best known upper bound on the total share size per party of 2^ 0.64 n (Applebaum et al …
the best known upper bound on the total share size per party of 2^ 0.64 n (Applebaum et al …
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 …
Improving the linear programming technique in the search for lower bounds in secret sharing
We present a new improvement in the linear programming technique to derive lower bounds
on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds …
on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds …
Optimal linear multiparty conditional disclosure of secrets protocols
A Beimel, N Peter - Advances in Cryptology–ASIACRYPT 2018: 24th …, 2018 - Springer
In ak-party CDS protocol, each party sends one message to a referee (without seeing the
other messages) such that the referee will learn a secret held by the parties if and only if the …
other messages) such that the referee will learn a secret held by the parties if and only if the …