External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Giuseppe Ateniese

This author has not been identified. Look up 'Giuseppe Ateniese' in Google

Long Chen

This author has not been identified. Look up 'Long Chen' in Google

Danilo Francati

This author has not been identified. Look up 'Danilo Francati' in Google

Dimitrios Papadopoulos

This author has not been identified. Look up 'Dimitrios Papadopoulos' in Google

Qiang Tang 0005

This author has not been identified. Look up 'Qiang Tang 0005' in Google
runs on