Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity.
Alexander VlasovKonstantin PanarinPublished in: IACR Cryptol. ePrint Arch. (2019)
Keyphrases
- polynomial hierarchy
- vapnik chervonenkis dimension
- randomized approximation
- worst case
- recognition scheme
- genetic algorithm
- computer networks
- real time
- np hard
- space complexity
- complexity analysis
- resource constrained
- detection scheme
- communication overhead
- lower bound
- reduced complexity
- secure communication
- computational complexity
- case study
- average case complexity