Verifiable Capacity-bound Functions: A New Primitive from Kolmogorov Complexity

Giuseppe Ateniese, Long Chen, Danilo Francati, Dimitrios Papadopoulos, Qiang Tang 0005. Verifiable Capacity-bound Functions: A New Primitive from Kolmogorov Complexity. IACR Cryptology ePrint Archive, 2021:162, 2021. [doi]

@article{AtenieseCFPT21,
  title = {Verifiable Capacity-bound Functions: A New Primitive from Kolmogorov Complexity},
  author = {Giuseppe Ateniese and Long Chen and Danilo Francati and Dimitrios Papadopoulos and Qiang Tang 0005},
  year = {2021},
  url = {https://eprint.iacr.org/2021/162},
  researchr = {https://researchr.org/publication/AtenieseCFPT21},
  cites = {0},
  citedby = {0},
  journal = {IACR Cryptology ePrint Archive},
  volume = {2021},
  pages = {162},
}