Abstract
We present a novel public key encryption scheme semantically secure in the standard model under the intractability assumption of the subgroupmem bershipp roblem. We also describe an honest verifier zero knowledge proof of knowledge protocol that can be converted into a signature scheme in the usual way.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In Advances of Cryptology — Crypto’ 98, pages 26–45.
M. Bellare and O. Goldreich. On defining proofs of knowledge. In Advances in Cryptology — CRYPTO’ 92,pages 390–420.
M. Bellare and P. Rogaway. Optimal asymmetric encryption-how to encrypt with RSA. InAdvances in Cryptology — EUROCRYPT’ 94, pages 92–111.
D. Boneh. The Decision Diffie-Hellman problem. In Third Algorithmic Number Theory Symposium, LNCS 1423, pages 48–63.
R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances of Cryptology — Crypto’ 98, pages 13–25.
W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644–654, November 1976.
T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31(4):469–472, July 1985.
E. Fujisaki and T. Okamoto. How to enhance the security of public-key encryption at minimum cost. In PKC’ 99, LNCS 1560, pages 53–68.
S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer Security, 28:270–299, 1984.
A. Lenstra and E. Verheul. Selecting cryptographic key sizes. In PKC 2000, LNCS 1751, pages 446–465.
A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of applied cryptography. CRC Press series on discrete mathematics and its applications. CRC Press, 1997.
T. Okamoto and S. Uchiyama. A new public key cryptosystem as secure as factoring. In Advances in Cryptology — EUROCRYPT’ 98, pages 308–318.
P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology — EUROCRYPT’ 99, pages 223–238.
M. Rabin. Digitalized signatures and public key functions as intractable as factoring. Technical Report TR-212, Laboratory of Computer Science LCS, Massachusetts Institute of Technology MIT, January 1979.
R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120–126, February 1978.
C. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161–174, 1991.
A. Yamamura and T. Saito. Private information retrieval based on the subgroup membershipp roblem. InACISP 2001, LNCS 2119, pages 206–220.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nieto, J.M.G., Boyd, C., Dawson, E. (2001). A Public Key Cryptosystem Based on the Subgroup Membership Problem. In: Qing, S., Okamoto, T., Zhou, J. (eds) Information and Communications Security. ICICS 2001. Lecture Notes in Computer Science, vol 2229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45600-7_38
Download citation
DOI: https://doi.org/10.1007/3-540-45600-7_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42880-0
Online ISBN: 978-3-540-45600-1
eBook Packages: Springer Book Archive