The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal
Vince GrolmuszPublished in: Inf. Comput. (1994)
Keyphrases
- multi party
- lower bound
- privacy preserving
- optimal solution
- worst case
- upper bound
- privacy preserving distributed data mining
- fair exchange protocols
- bayesian networks
- branch and bound
- branch and bound algorithm
- competitive ratio
- dynamic programming
- belief networks
- mental states
- lower and upper bounds
- search space
- expert knowledge
- structure learning
- special case
- fair exchange