Login / Signup
On the Exact Round Complexity of Self-Composable Two-Party Computation.
Sanjam Garg
Susumu Kiyoshima
Omkant Pandey
Published in:
IACR Cryptol. ePrint Arch. (2017)
Keyphrases
</>
computational complexity
artificial intelligence
graphical models
decision problems
information systems
computational cost
exact computation