PRE: stronger security notions and efficient construction with non-interactive opening
DOI10.1016/J.TCS.2014.04.028zbMATH Open1360.68450OpenAlexW2051193066WikidataQ115036543 ScholiaQ115036543MaRDI QIDQ2015128FDOQ2015128
Authors: Jiang Zhang, Zhenfeng Zhang, Yu Chen
Publication date: 23 June 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.028
Recommendations
- Proxy re-encryption in a stronger security model extended from CT-RSA2012
- Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings
- Key-Private Proxy Re-encryption
- A provably-secure unidirectional proxy re-encryption scheme without pairing in the random oracle model
- Efficient bidirectional proxy re-encryption with direct chosen-ciphertext security
chosen-ciphertext securitypublic key encryptionproxy re-encryptionchosen key modelDBDHknowledge of secret key model
Cites Work
- Fully homomorphic encryption using ideal lattices
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Public-key encryption with non-interactive opening: new constructions and stronger definitions
- Public-Key Encryption with Non-interactive Opening
- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Identity-Based Proxy Re-encryption
- Title not available (Why is that?)
- Type-Based Proxy Re-encryption and Its Construction
- Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles
- Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- Efficient Unidirectional Proxy Re-Encryption
- CCA-Secure Proxy Re-encryption without Pairings
- Key-Private Proxy Re-encryption
- Topics in Cryptology – CT-RSA 2005
- Discrete logarithm problems with auxiliary inputs
- The complexity of certain multi-exponentiation techniques in cryptography
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Non-interactive Proofs for Integer Multiplication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: PRE: stronger security notions and efficient construction with non-interactive opening
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015128)