Sometimes You Can’t Distribute Random-Oracle-Based Proofs

ePrint Report: Sometimes You Can’t Distribute Random-Oracle-Based Proofs

Jack Doerner, Yashvanth Kondi, Leah Namisa Rosenbloom

We investigate the conditions under which straight-line extractable NIZKs in the random oracle model (i.e. without a CRS) permit multiparty realizations that are black-box in the same random oracle. We show that even in the semi-honest setting, any MPC protocol to compute such a NIZK cannot make black-box use of the random oracle or a hash function instantiating it if security against all-but-one corruptions is …

box conditions eprint report jack mpc oracle random report under