Abstract
In this work, we study the intrinsic complexity of black-box Universally Composable (UC) secure computation based on general assumptions. We present a thorough study in various corruption modelings while focusing on achieving security in the common reference string (CRS) model. Our results involve the following:
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have