Old Web
English
Sign In
Acemap
>
Paper
>
Verifiable Capacity-bound Functions: A New Primitive from Kolmogorov Complexity.
Verifiable Capacity-bound Functions: A New Primitive from Kolmogorov Complexity.
2021
Giuseppe Ateniese
Long Chen
Danilo Francati
Dimitrios Papadopoulos
Qiang Tang
Keywords:
Kolmogorov complexity
Discrete mathematics
Verifiable secret sharing
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]