(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens

@article{2011EfficientUC,
  title={(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens},
  author={},
  journal={IACR Cryptology ePrint Archive},
  year={2011},
  volume={2011},
  pages={689}
}
  • Published 2011 in IACR Cryptology ePrint Archive

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…