Skip Navigation

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2006 E89-A(1):203-205; doi:10.1093/ietfec/e89-a.1.203
This Article
Right arrow Full Text (PDF)
Right arrow References
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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by HIWATARI, H.
Right arrow Articles by TANAKA, K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2006 The Institute of Electronics, Information and Communication Engineers

Special Section on Cryptography and Information Security -- Letters -- Public Key Cryptography

A Cramer-Shoup Variant Related to the Quadratic Residuosity Problem

Harunaga HIWATARI1 and Keisuke TANAKA1

1 The authors are with the Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, 152-8552 Japan. E-mail: hiwatar1{at}is.titech.ac.jp, E-mail: keisuke{at}is.titech.ac.jp

At Eurocrypt '02, Cramer and Shoup [1] proposed a general paradigm to construct practical public-key encryption schemes secure against the adaptive chosen ciphertext attack as well as several concrete examples. One of these example is the scheme based on the quadratic residuosity (QR) problem. However this scheme is less efficient than the other examples. In this paper, we construct a new variant of the Cramer-Shoup encryption scheme which is related to the QR problem. Our variant is more efficient than the scheme based on the QR problem.

Key Words: encryption, semantically secure, quadratic residuosity

Manuscript received March 23, 2005. Final manuscript received June 9, 2005.


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.