Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation.
Martin HirtJesper Buus NielsenPublished in: IACR Cryptol. ePrint Arch. (2004)
Keyphrases
- multi party
- upper bound
- worst case
- privacy preserving
- turn taking
- human communication
- lower bound
- secret sharing
- description language
- upper and lower bounds
- mental states
- computational complexity
- secure communication
- lower and upper bounds
- smart card
- branch and bound
- efficiently computable
- social interaction
- orders of magnitude
- tight upper and lower bounds