International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Adaptive Concurrent Non-Malleability with Bare Public-Keys

Authors:
Andrew C. Yao
Moti Yung
Yunlei Zhao
Download:
URL: http://eprint.iacr.org/2010/107
Search ePrint
Search Google
Abstract: Concurrent non-malleability (CNM) is central for cryptographic protocols running concurrently in environments such as the Internet. In this work, we formulate CNM in the bare public-key (BPK) model, and show that round-eĀ±cient concurrent non-malleable cryptography with full adaptive input selection can be established, in general, with bare public-keys (where, in particular, no trusted assumption is made).
BibTeX
@misc{eprint-2010-23008,
  title={Adaptive Concurrent Non-Malleability with Bare Public-Keys},
  booktitle={IACR Eprint archive},
  keywords={foundations /},
  url={http://eprint.iacr.org/2010/107},
  note={ yunleizhao@gmail.com 14666 received 26 Feb 2010},
  author={Andrew C. Yao and Moti Yung and Yunlei Zhao},
  year=2010
}