Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles

@inproceedings{Boneh2004EfficientSS,
  title={Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles},
  author={Dan Boneh and Xavier Boyen},
  booktitle={IACR Cryptology ePrint Archive},
  year={2004}
}
  • D. BonehXavier Boyen
  • Published in
    IACR Cryptology ePrint…
     2 May 2004
  • Computer Science, Mathematics
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model. Selective identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time to the identity that it intends to attack, whereas in the standard model the adversary is allowed to choose this identity adaptively. Our first secure IBE system extends to give a selective identity… 
View via Publisher
link.springer.com
1,753 Citations
Highly Influential Citations
286
Background Citations
562
Methods Citations
600
Results Citations
35

1,753 Citations

Efficient Identity-Based Encryption Without Random Oracles

This work first presents their IBE construction and reduces the security of the scheme to the decisional Bilinear Diffie-Hellman (BDH) problem, and shows that their techniques can be used to build a new signature scheme that is secure under the computational Diffie -Hellman assumption without random oracles.

Efficient Selective Identity-Based Encryption Without Random Oracles

We construct two efficient Identity-Based Encryption (IBE) systems that admit selective-identity security reductions without random oracles in groups equipped with a bilinear map. Selective-identity…

Chosen-Ciphertext Security from Identity-Based Encryption

This work proposes a simple and efficient construction of a CCA-secure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme, which avoids non-interactive proofs of “well-formedness” which were shown to underlie most previous constructions.

Lattice Forward-Secure Identity Based Encryption Scheme

This paper proposes lattice based forward-secure identity based encryption scheme based on LWE assumption in random oracle model in the standard model.

Cryptanalysis of an identity based broadcast encryption scheme without random oracles

Generic Construction of Forward-Secure Identity-Based Encryption

A generic construction of forward-secure identity-based encryption is proposed that guarantees that even if the current private keys are compromised, it is not possible to compromise past secret keys and past communications.

New Fully Secure Hierarchical Identity-Based Encryption with Constant Size Ciphertexts

A new HIBE scheme with constant size ciphertexts and short parameters in prime order groups using symmetric pairing is proposed and a new technique called "hybrid identity vector" is used to make the key derivation feasible.

Certificate-Based Encryption Without Random Oracles

This work presents a certificate-based encryption scheme which is fully secure in the standard model and points out that one of the existing generic constructions going from IBE to CBE is flawed.

Forward-Secure Identity-Based Public-Key Encryption without Random Oracles

This work proposes a forward-secure identity-based public-key encryption scheme without random oracles, which is the first forward- Secure Identity-based Public-key Encryption Scheme without Random Oracles.

Identity-Based Encryption Secure against Selective Opening Attack

We present the first IBE schemes that are proven secure against selective opening attack (SOA). This means that if an adversary, given a vector of ciphertexts, adaptively corrupts some fraction of…
...

References

SHOWING 1-10 OF 33 REFERENCES

Efficient Identity-Based Encryption Without Random Oracles

This work first presents their IBE construction and reduces the security of the scheme to the decisional Bilinear Diffie-Hellman (BDH) problem, and shows that their techniques can be used to build a new signature scheme that is secure under the computational Diffie -Hellman assumption without random oracles.

Secure Identity Based Encryption Without Random Oracles

We present a fully secure Identity Based Encryption scheme whose proof of security does not rely on the random oracle heuristic. Security is based on the Decision Bilinear Diffie-Hellman assumption.…

Identity-Based Encryption from the Weil Pairing

This work proposes a fully functional identity-based encryption scheme (IBE) based on the Weil pairing that has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem.

Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption

This work improves the efficiency of their construction, and shows two specific instantiations of the resulting scheme which offer the most efficient encryption (and, in one case, key generation) of any CCA-secure encryption scheme to date.

An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack

This paper proposes a simple threshold Public-Key Cryptosystem (PKC) which is secure against adaptive chosen ciphertext attack, under the Decisional Diffie-Hellman (DDH) intractability assumption.…

Short Signatures Without Random Oracles

A short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles, which depends on a new complexity assumption the authors call the Strong Diffie-Hellman assumption.

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 Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions

A simpler construction of a public-key encryption scheme that achieves adaptive chosen ciphertext security (CCA2), assuming the existence of trapdoor permutations is presented, which is believed to be the easiest to understand to date.

A Forward-Secure Public-Key Encryption Scheme

The first constructions of (non-interactive) forward-secure public-key encryption schemes are presented and the main construction achieves security against chosen-plaintext attacks in the standard model, and all parameters are poly-logarithmic in the total number of time periods.

Public-key cryptosystems provably secure against chosen ciphertext attacks

We show how to construct a public-key cryptosystem (as originally defined by DiNe and Hellman) secure against chosen ciphertezt attacks, given a public-key cryptosystern secure against passive…