Further Lower Bounds for Structure-Preserving Signatures in Asymmetric Bilinear Groups.
Essam GhadafiPublished in: IACR Cryptol. ePrint Arch. (2018)
Keyphrases
- structure preserving
- lower bound
- upper bound
- dimensionality reduction
- branch and bound
- np hard
- branch and bound algorithm
- optimal solution
- linear programming relaxation
- singular value decomposition
- cluster analysis
- randomly generated problems
- neural network
- signature verification
- lower and upper bounds
- vc dimension
- online learning
- worst case
- pattern recognition
- machine learning