Skip Navigation

The Computer Journal 2004 47(1):58-70; doi:10.1093/comjnl/47.1.58
© 2004 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Abe, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Combining Encryption and Proof of Knowledge in the Random Oracle Model

Masayuki Abe

NTT Information Sharing Platform Laboratories, 1-1 Hikarino-oka, Yokosuka-shi, Kanagawa, 239-0847, Japan

This paper proposes a generic construction that yields encryption schemes that are secure against adaptive chosen ciphertext attacks. In particular, we focus on combining weak encryption schemes with proofs of knowledge made non-interactive through the use of a hash function. This type of conversion yields encryption schemes that allow anybody to verify the integrity of the ciphertexts. A typical example is a combination of ElGamal encryption with the Schnorr proof of knowledge, but a straightforward combination requires a stronger assumption than the random oracle assumption to prove the security. We first generalize a class of encryption schemes and proofs of knowledge to key-encapsulation schemes and signature schemes, and then present a secure way of combining them so that the security of the resulting scheme can be proven solely in the random oracle model.

Received 2 July 2002. Revised 1 July 2003.

* Email: abe{at}isl.ntt.co.jp


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.