An Identification Scheme Based on Sparse Polynomials

William D. Banks, Daniel Lieman, Igor Shparlinski. An Identification Scheme Based on Sparse Polynomials. In Hideki Imai, Yuliang Zheng, editors, Public Key Cryptography, Third International Workshop on Practice and Theory in Public Key Cryptography, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000, Proceedings. Volume 1751 of Lecture Notes in Computer Science, pages 68-74, Springer, 2000.

@inproceedings{BanksLS00,
  title = {An Identification Scheme Based on Sparse Polynomials},
  author = {William D. Banks and Daniel Lieman and Igor Shparlinski},
  year = {2000},
  tags = {rule-based},
  researchr = {https://researchr.org/publication/BanksLS00},
  cites = {0},
  citedby = {0},
  pages = {68-74},
  booktitle = {Public Key Cryptography, Third International Workshop on Practice and Theory in Public Key Cryptography, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000, Proceedings},
  editor = {Hideki Imai and Yuliang Zheng},
  volume = {1751},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66967-1},
}