Concrete chosen-ciphertext secure encryption from subgroup membership problems

Authors:
Jaimee Brown;Juan Manuel González Nieto;Colin Boyd
Affiliations:
Information Security Institute, Queensland University of Technology, Brisbane, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Australia
Venue:
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Year:
2006

Citing 8
Cited 0

General public key residue cryptosystems and mental poker protocols

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Private Information Retrieval Based on the Subgroup Membership Problem

ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A Public Key Cryptosystem Based On A Subgroup Membership Problem

Designs, Codes and Cryptography
On diffie-hellman key agreement with short exponents

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Symmetric subgroup membership problems

PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using three previously studied subgroup membership problems, we obtain new concrete encryption schemes secure against adaptive chosen-ciphertext attack in the standard model, from the Cramer-Shoup and Kurosawa-Desmedt constructions. The schemes obtained are quite efficient. In fact, the Cramer-Shoup derived schemes are more efficient than the previous schemes from this construction, including the Cramer-Shoup cryptosystem, when long messages are considered. The hybrid variants are even more efficient, with a smaller number of exponentiations and a shorter ciphertext than the Kurosawa-Desmedt Decisional Diffie-Hellman based scheme.