Symmetric Subgroup Membership Problems

  • Kristian Gjøsteen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3386)

Abstract

We define and discuss symmetric subgroup membershipproblems and their properties, including a relation to the Decision Diffie-Hellman problem. We modify the Cramer-Shoup framework, so that we can derive a chosen ciphertext secure cryptosystem in the standard model from symmetric subgroup membership problems. We also discuss how chosen ciphertext secure hybrid cryptosystems based on a symmetric subgroup membership can be constructed in the standard model, giving a very efficient cryptosystem whose security relies solely on the symmetric subgroup membership problem.

Keywords

public key encryption hybrid encryption standard model subgroup membership problem 

References

  1. 1.
    Boneh, D.: The decision diffie-hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48–63. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  2. 2.
    Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998)Google Scholar
  3. 3.
    Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45–64. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing 33(1), 167–226 (2003)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory 22, 644–654 (1976)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Gennaro, R., Shoup, V.: A note on an encryption scheme of Kurosawa and Desmedt. Cryptology ePrint Archive, Report 2004/194 (2004), http://eprint.iacr.org/
  7. 7.
    Kurosawa, K., Desmedt, Y.G.: A new paradigm of hybrid encryption scheme. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 426–442. Springer, Heidelberg (2004)Google Scholar
  8. 8.
    Mao, W.: Fast Monte-Carlo primality evidence shown in the dark. Technical Report HPL-1999-30R1, HP Laboratories (October 1999)Google Scholar
  9. 9.
    González Nieto, J.M., Boyd, C., Dawson, E.: A public key cryptosystem based on the subgroup membership problem. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 352–363. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433–444. Springer, Heidelberg (1992)Google Scholar
  11. 11.
    Yamamura, A., Saito, T.: Private information retrieval based on the subgroup membership problem. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol. 2119, pp. 206–220. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kristian Gjøsteen
    • 1
  1. 1.Department of Matematical SciencesNorwegian University of Science and TechnologyTrondheimNorway

Personalised recommendations