International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Round Optimal Concurrent Non-malleability from Polynomial Hardness

Authors:
Dakshita Khurana
Download:
DOI: 10.1007/978-3-319-70503-3_5
Search ePrint
Search Google
Conference: TCC 2017
BibTeX
@inproceedings{tcc-2017-28353,
  title={Round Optimal Concurrent Non-malleability from Polynomial Hardness},
  booktitle={TCC (2)},
  publisher={Springer},
  pages={139-171},
  doi={10.1007/978-3-319-70503-3_5},
  author={Dakshita Khurana},
  year=2017
}