Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Tirumala, Harsha"'
We show that a decidable promise problem has a non-interactive statistical zero-knowledge proof system if and only if it is randomly reducible via an honest polynomial-time reduction to a promise problem for Kolmogorov-random strings, with a superlog
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d451dd83a47a4ddda71e5f4c4ebf5e8b
One-way functions (OWFs) are central objects of study in cryptography and computational complexity theory. In a seminal work, Liu and Pass (FOCS 2020) proved that the average-case hardness of computing time-bounded Kolmogorov complexity is equivalent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92ea322fd540bb8fba597e25b6a1505a