International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions

Authors:
Daniel Kraschewski
Jörn Müller-Quade
Download:
DOI: 10.1007/978-3-642-19571-6_22
URL: https://www.iacr.org/archive/tcc2011/65970360/65970360.pdf
Search ePrint
Search Google
Conference: TCC 2011
BibTeX
@inproceedings{tcc-2011-23526,
  title={Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions},
  booktitle={Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={6597},
  pages={364},
  url={https://www.iacr.org/archive/tcc2011/65970360/65970360.pdf},
  doi={10.1007/978-3-642-19571-6_22},
  author={Daniel Kraschewski and Jörn Müller-Quade},
  year=2011
}