Kolmogorov Complexity and Cryptography: New Connections and Applications to Space-Demanding Functions

Danilo Francati

Research output: Thesis › Doctoral Thesis

Original language	English
Qualification	Ph.D.
Awarding Institution	Stevens Institute of Technology
Supervisors/Advisors	Ateniese, Giuseppe, Supervisor, External person
Award date	31 Aug 2021
Publisher	ProQuest, part of Clarivate
Publication status	Published - 2021
Externally published	Yes

Access to Document

Verifiable Capacity-Bound Functions: A New Primitive from Kolmogorov Complexity (Revisiting Space-Based Security in the Adaptive Setting)
Ateniese, G., Chen, L., Francati, D., Papadopoulos, D. & Tang, Q., 2 May 2023, Public-Key Cryptography – PKC 2023 - 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. Boldyreva, A. & Kolesnikov, V. (eds.). Springer Science and Business Media Deutschland GmbH, p. 63-93 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13941 LNCS).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution