Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations.
Benny ApplebaumBarak ArkisPavel RaykovPrashant Nalini VasudevanPublished in: CRYPTO (1) (2017)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- objective function
- lower bounding
- statistical databases
- lower and upper bounds
- optimal solution
- vc dimension
- upper and lower bounds
- worst case
- random field model
- recursive functions
- multiscale
- confidential information
- privacy preserving data publishing
- private information
- sensitive information
- privacy protection
- sample complexity
- online algorithms
- quadratic assignment problem
- optimal cost
- sample size
- linear programming
- bayesian networks
- asked questions