Instance-wise hardness versus randomness tradeoffs for Arthur-Merlin protocols

DOI10.4230/LIPICS.CCC.2023.17MaRDI QIDQ6640353zbMATH OpenFDO

Authors Dieter Van Melkebeek, Sdroievski Nicollas Mocelin

Publication date 19 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2023.17

zbMATH Keywords

Arthur-Merlin protocolhardness versus randomness tradeofftargeted hitting set generator

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(4)

• Instance-wise hardness and refutation versus derandomization for Arthur-Merlin protocols
• Stretching demi-bits and nondeterministic-secure pseudorandomness
• Leakage resilience, targeted pseudorandom generators, and mild derandomization of Arthur-Merlin protocols
• Towards free lunch derandomization from necessary assumptions (and OWFs)

This page was built for publication: Instance-wise hardness versus randomness tradeoffs for Arthur-Merlin protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640353)