Concrete Chosen-Ciphertext Secure Encryption from Subgroup Membership Problems

  title={Concrete Chosen-Ciphertext Secure Encryption from Subgroup Membership Problems},
  author={Jaimee Brown and Juan Manuel Gonz{\'a}lez Nieto and Colin Boyd},
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… 
Secure public-key encryption from factorisation-related problems
A number of new public-key encryption schemes are presented which are secure in the sense of indistinguishability against chosen-ciphertext attack in the standard model, and a new approach is presented for constructing RSA-related public key encryption schemes secure inThe Oracle RSA-type assumptions.
Efficient Lossy Trapdoor Functions Based on Subgroup Membership Assumptions
Three concrete constructions based on the k-DCR assumption over $\mathbb{Z}^*_{N^2}$, the extended p-subgroup assumption over $Z, and the decisional RSA subgroup membership assumption over Z are presented.
The Group of Signed Quadratic Residues and Applications
It is able to show that under the factoring assumption, the Strong Diffie-Hellman assumption over the signed quadratic residues holds, which means, in this group the Diffie -Hellman problem is hard, even in the presence of a Decisional Diffie, Hellman oracle.
On Plaintext-Aware Public-Key Encryption Schemes
A modified definition of plaintext awareness is proposed, which is called 2PA2, in which the arbitrary stateful plaintext creators of the PA2 definition are replaced with a choice of two fixed stateless plain text creators, and it is shown that under reasonable conditions the new definition is equivalent to the standard one.
Authenticating Aggregate Range Queries over Multidimensional Dataset
A scheme that requires O(d log N) communication bits to authenticate an aggregate count query conditional on d-dimensional range selection, where N is the number of points in the dataset, and the proposed approach potentially can be applied to other queries by using suitable functional encryption schemes.


Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
A general framework that allows one to construct secure encryption schemes in a generic fashion from language membership problems that satisfy certain technical requirements is introduced, as does the Cramer-Shoup scheme based on the Decision Diffie-Hellman assumption.
Symmetric Subgroup Membership Problems
  • K. Gjøsteen
  • Computer Science, Mathematics
    Public Key Cryptography
  • 2005
The Cramer-Shoup framework is modified, so that it can derive a chosen ciphertext secure cryptosystem in the standard model from symmetric subgroup membership problems, giving a very efficient Cryptosystem whose security relies solely on the symmetricSubgroup membership problem.
A Note on An Encryption Scheme of Kurosawa and Desmedt
A proof of security is presented which shows that the KurosawaDesmedt scheme can be instantiated with any computationally secure key derivation and message authentication functions, thus extending the applicability of their paradigm, and improving its eciency.
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.
A New Paradigm of Hybrid Encryption Scheme
It is shown that a key encapsulation mechanism (KEM) does not have to be IND-CCA secure in the construction of hybrid encryption schemes, as was previously believed, and this result is further generalized to universal2 projective hash families.
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions.
A New Public-Key Cryptosystem as Secure as Factoring
This paper proposes a novel public-key cryptosystem, which is practical, provably secure and has some other interesting properties as follows: It can be proven to be as secure as the intractability of factoring n = p2q (in the sense of the security of the whole plaintext) against passive adversaries.
General Public Key Residue Cryptosystems and Mental Poker Protocols
A general method to construct public key cryptosystems based on the r-th residue problem is presented, and the first mental poker protocol which can shuffle any set of cards is presented.
Private Information Retrieval Based on the Subgroup Membership Problem
The subgroup membership problem is applied to private information retrieval schemes following the method by Kushilevitz and Ostrovsky and the resulting scheme has the same communication complexity as the original scheme.
A Public Key Cryptosystem Based On A Subgroup Membership Problem
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.