On the Round Complexity of Fully Secure Solitary MPC with Honest Majority.
- Award ID(s):
- 2247352
- PAR ID:
- 10505745
- Publisher / Repository:
- Springer, Cham
- Date Published:
- Journal Name:
- Theory of Cryptography Conference (TCC)
- ISBN:
- 978-3-031-48617-3
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government
