PRE: stronger security notions and efficient construction with non-interactive opening
From MaRDI portal
Publication:2015128
DOI10.1016/j.tcs.2014.04.028zbMath1360.68450OpenAlexW2051193066WikidataQ115036543 ScholiaQ115036543MaRDI QIDQ2015128
Yu Chen, Zhenfeng Zhang, Jiang Zhang
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
chosen-ciphertext securitypublic key encryptionproxy re-encryptionchosen key modelDBDHknowledge of secret key model
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles
- Short signatures without random oracles and the SDH assumption in bilinear groups
- The complexity of certain multi-exponentiation techniques in cryptography
- Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Efficient Unidirectional Proxy Re-Encryption
- Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions
- Identity-Based Proxy Re-encryption
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- CCA-Secure Proxy Re-encryption without Pairings
- Key-Private Proxy Re-encryption
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Fully homomorphic encryption using ideal lattices
- Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Non-interactive Proofs for Integer Multiplication
- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
- Public-Key Encryption with Non-interactive Opening
- Type-Based Proxy Re-encryption and Its Construction
- Topics in Cryptology – CT-RSA 2005
- Discrete logarithm problems with auxiliary inputs
