International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation

Authors:
Shweta Agrawal
Vipul Goyal
Abhishek Jain
Manoj Prabhakaran
Amit Sahai
Download:
DOI: 10.1007/978-3-642-32009-5_26 (login may be required)
URL: https://www.iacr.org/archive/crypto2012/74170437/74170437.pdf
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2012
Video from CRYPTO 2012
BibTeX
@inproceedings{crypto-2012-24336,
  title={New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation},
  booktitle={Advances in Cryptology - Crypto 2012},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={7417},
  pages={443-460},
  url={https://www.iacr.org/archive/crypto2012/74170437/74170437.pdf},
  doi={10.1007/978-3-642-32009-5_26},
  author={Shweta Agrawal and Vipul Goyal and Abhishek Jain and Manoj Prabhakaran and Amit Sahai},
  year=2012
}