A Public Key Cryptosystem Based On A Subgroup Membership Problem

Authors:
Juan Manuel Gonzalez Nieto;Colin Boyd;Ed Dawson
Affiliations:
Information Security Research Centre, Queensland University of Technology, Brisbane, Australia;Information Security Research Centre, Queensland University of Technology, Brisbane, Australia;Information Security Research Centre, Queensland University of Technology, Brisbane, Australia
Venue:
Designs, Codes and Cryptography
Year:
2005

Citing 19
Cited 4

Public-key cryptosystems provably secure against chosen ciphertext attacks

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Nonmalleable Cryptography

SIAM Journal on Computing
Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Private Information Retrieval Based on the Subgroup Membership Problem

ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
A Public Key Cryptosystem Based on the Subgroup Membership Problem

ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
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
Chosen-Ciphertext Security for Any One-Way Cryptosystem

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Selecting Cryptographic Key Sizes

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
The Decision Diffie-Hellman Problem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Fair encryption of RSA keys

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Concrete chosen-ciphertext secure encryption from subgroup membership problems

CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
An efficient IND-CCA2 secure Paillier-based cryptosystem

Information Processing Letters
Homomorphic encryption for multiplications and pairing evaluation

SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Pseudorandom generators based on subcovers for finite groups

Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel public key encryption scheme semantically secure in the standard model under the intractability assumption of a subgroup membership problem related to the factorization problem.