Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications

Muhammed F. Esgin, Ron Steinfeld, Raymond K. Zhao. Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications. In Goichiro Hanaoka, Junji Shikata, Yohei Watanabe 0001, editors, Public-Key Cryptography - PKC 2022 - 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8-11, 2022, Proceedings, Part I. Volume 13177 of Lecture Notes in Computer Science, pages 317-348, Springer, 2022. [doi]

@inproceedings{EsginSZ22-0,
  title = {Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications},
  author = {Muhammed F. Esgin and Ron Steinfeld and Raymond K. Zhao},
  year = {2022},
  doi = {10.1007/978-3-030-97121-2_12},
  url = {https://doi.org/10.1007/978-3-030-97121-2_12},
  researchr = {https://researchr.org/publication/EsginSZ22-0},
  cites = {0},
  citedby = {0},
  pages = {317-348},
  booktitle = {Public-Key Cryptography - PKC 2022 - 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8-11, 2022, Proceedings, Part I},
  editor = {Goichiro Hanaoka and Junji Shikata and Yohei Watanabe 0001},
  volume = {13177},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-97121-2},
}