Can We Beat Three Halves Lower Bound?: (Im)Possibility of Reducing Communication Cost for Garbled Circuits.
Chunghun BaekTaechan KimPublished in: IACR Cryptol. ePrint Arch. (2024)
Keyphrases
- communication cost
- lower bound
- upper bound
- sensor networks
- communication overhead
- low bandwidth
- power reduction
- branch and bound algorithm
- branch and bound
- data distribution
- processing cost
- objective function
- distributed data
- lower and upper bounds
- optimal solution
- network size
- low overhead
- data availability
- reduce communication cost
- data structure
- data mining
- data sets