Verifiable Capacity-Bound Functions: A New Primitive from Kolmogorov Complexity (Revisiting Space-Based Security in the Adaptive Setting)

Giuseppe Ateniese, Long Chen, Danilo Francati, Dimitrios Papadopoulos, Qiang Tang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish
Title of host publicationPublic-Key Cryptography – PKC 2023 - 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings
EditorsAlexandra Boldyreva, Vladimir Kolesnikov
PublisherSpringer Science and Business Media Deutschland GmbH
Pages63-93
Number of pages31
ISBN (Print)9783031313707
DOIs
Publication statusPublished - 2 May 2023
Event26th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2023 - Atlanta, United States
Duration: 7 May 202310 May 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13941 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2023
Country/TerritoryUnited States
CityAtlanta
Period7/05/2310/05/23

Keywords

  • Adaptive security
  • Kolmogorov complexity
  • Polynomial evaluation
  • Verifiable computation
  • Verifiable delay function

Cite this