Non-Malleable Zero-Knowledge Arguments with Lower Round Complexity

Zhenbin Yan, Yi Deng. Non-Malleable Zero-Knowledge Arguments with Lower Round Complexity. Comput. J., 64(4):534-549, 2021. [doi]

@article{YanD21-1,
  title = {Non-Malleable Zero-Knowledge Arguments with Lower Round Complexity},
  author = {Zhenbin Yan and Yi Deng},
  year = {2021},
  doi = {10.1093/comjnl/bxaa076},
  url = {https://doi.org/10.1093/comjnl/bxaa076},
  researchr = {https://researchr.org/publication/YanD21-1},
  cites = {0},
  citedby = {0},
  journal = {Comput. J.},
  volume = {64},
  number = {4},
  pages = {534-549},
}