The Round Complexity of Secure Protocols
Assume we have a network of three of more players, each player in possession of some private input. The players want to compute some function of these private inputs, but in a way which protects the privacy of each participant's contribution.
Main Author: | Rogaway, Phillip |
---|---|
Other Authors: | Micali, Silvio |
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149705 |
Similar Items
-
The Complexity of Continuous Optimization
by: Rogaway, Phillip
Published: (2023) -
Secure Computation (Preliminary Report)
by: Micali, Silvio, et al.
Published: (2023) -
Scaleable round trip time estimation for layered multicast protocol
by: Ghazali, Osman, et al.
Published: (2006) -
Distributed PageRank computation with improved round complexities
by: Luo, Siqiang, et al.
Published: (2022) -
From the Odyssey to the Iliad, and round (and round) again
by: Kelly, A
Published: (2024)