Fully Secure Self-Updatable Encryption in Prime Order Bilinear Groups

@article{Datta2014FullySS,
  title={Fully Secure Self-Updatable Encryption in Prime Order Bilinear Groups},
  author={Pratish Datta and Ratna Dutta and Sourav Mukhopadhyay},
  journal={IACR Cryptology ePrint Archive},
  year={2014},
  volume={2014},
  pages={940}
}
  • Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay
  • Published in ISC 2014
  • Computer Science
  • In CRYPTO 2012, Sahai et al. raised the concern that in a cloud control system revocation of past keys should also be accompanied by updation of previously generated ciphertexts in order to prevent unread ciphertexts from being read by revoked users. Self-updatable encryption (SUE), introduced by Lee et al. in ASIACRYPT 2013, is a newly developed cryptographic primitive that realizes ciphertext update as an inbuilt functionality and thus improves the efficiency of key revocation and time… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-3 OF 3 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 16 REFERENCES

    Identity-based encryption with efficient revocation

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Self-updatable encryption with short public parameters and its extensions

    • Kwangsu Lee
    • Computer Science, Mathematics
    • Des. Codes Cryptogr.
    • 2014
    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    A Forward-Secure Public-Key Encryption Scheme

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL