Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications

Jonathan Katz. Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications. In Eli Biham, editor, Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings. Volume 2656 of Lecture Notes in Computer Science, pages 211-228, Springer, 2003. [doi]

@inproceedings{Katz03:2,
  title = {Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications},
  author = {Jonathan Katz},
  year = {2003},
  url = {http://link.springer.de/link/service/series/0558/bibs/2656/26560211.htm},
  researchr = {https://researchr.org/publication/Katz03%3A2},
  cites = {0},
  citedby = {0},
  pages = {211-228},
  booktitle = {Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings},
  editor = {Eli Biham},
  volume = {2656},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-14039-5},
}