A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions.
Kaoru KurosawaWataru KishimotoTakeshi KoshibaPublished in: IEEE Trans. Inf. Theory (2008)
Keyphrases
- lower bound
- upper bound
- branch and bound
- objective function
- lower and upper bounds
- upper and lower bounds
- branch and bound algorithm
- transfer learning
- np hard
- worst case
- vc dimension
- knowledge transfer
- optimal solution
- lower bounding
- randomly generated problems
- security requirements
- cryptographic protocols
- lightweight
- security analysis
- linear programming relaxation
- max sat
- min sum
- optimal cost
- identity management
- user authentication
- encryption scheme
- sensitive data
- special case
- machine learning
- cross domain
- linear programming