"On the Round Complexity of Fully Secure Solitary MPC with Honest Majority."

Saikrishna Badrinarayanan et al. (2021)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2023-08-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics