UNIVERSALLY COMPOSABLE NON-COMMITTING ENCRYPTIONS IN THE PRESENCE OF ADAPTIVE ADVERSARIES

Huafei Zhu, Tadashi Araragi, Takashi Nishide, Kouichi Sakurai

2010

Abstract

Designing non-committing encryptions tolerating adaptive adversaries is a challenging task. In this paper, a simple implementation of non-committing encryptions is presented and analyzed in the strongest security model. We show that the proposed non-committing encryption scheme is provably secure against adaptive adversaries in the universally composable framework assuming that the decisional Diffie-Hellman problem is hard.

References

  1. Beaver, D. (1997). Plug and play encryption. In CRYPTO. Springer.
  2. Beaver, D. and Haber, S. (1992). Cryptographic protocols provably secure against dynamic adversaries. In EUROCRYPT. Springer.
  3. Canetti, R. (2001). a new paradigm for cryptographic protocols. In FOC. IEEE.
  4. Canetti, R. (2005). Universally composable security: A new paradigm for cryptographic protocols. In ePrint. eprinter.iacr.org.
  5. Canetti, R., Feige, U., Goldreich, O., and Naor, M. (1996). Adaptively secure multi-party computation. In STOC. IEEE.
  6. Canetti, R. and Fischlin, M. (2001). a new paradigm for cryptographic protocols. In CRYPTO. Springer.
  7. Damga°rd, I. and Nielsen, J. (2000). Improved noncommitting encryption schemes based on a general complexity assumption. In CRYPTO. Springer.
  8. Garay, J., Wichs, D., and Zhou, H. (2009). Somewhat noncommitting encryption and efficient adaptively secure oblivious transfer. In CRYPTO. Springer.
  9. Moni Naor, B. P. (2001). Efficient oblivious transfer protocols. In SODA. ACM.
  10. Nielsen, J. (2002). Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In CRYPTO. Springer.
  11. Nielsen, J. (2003). On protocol security in the cryptographic model. In thesis. www.brics.dk/ jbn/thesis.pdf.
  12. S.Choi, Dachman-Soled, D., Malkin, T., and Wee, H. (2009). Adaptively secure multi-party computation. In Asiacrypt. Springer.
Download


Paper Citation


in Harvard Style

Zhu H., Araragi T., Nishide T. and Sakurai K. (2010). UNIVERSALLY COMPOSABLE NON-COMMITTING ENCRYPTIONS IN THE PRESENCE OF ADAPTIVE ADVERSARIES . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2010) ISBN 978-989-8425-18-8, pages 389-398. DOI: 10.5220/0002985003890398


in Bibtex Style

@conference{secrypt10,
author={Huafei Zhu and Tadashi Araragi and Takashi Nishide and Kouichi Sakurai},
title={UNIVERSALLY COMPOSABLE NON-COMMITTING ENCRYPTIONS IN THE PRESENCE OF ADAPTIVE ADVERSARIES},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2010)},
year={2010},
pages={389-398},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002985003890398},
isbn={978-989-8425-18-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2010)
TI - UNIVERSALLY COMPOSABLE NON-COMMITTING ENCRYPTIONS IN THE PRESENCE OF ADAPTIVE ADVERSARIES
SN - 978-989-8425-18-8
AU - Zhu H.
AU - Araragi T.
AU - Nishide T.
AU - Sakurai K.
PY - 2010
SP - 389
EP - 398
DO - 10.5220/0002985003890398