Fine-grained re-encryptions between different encryption systems
From MaRDI portal
Cites work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Adaptively secure garbled circuits from one-way functions
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
- Adaptively secure proxy re-encryption
- Anonymous ID-based proxy re-encryption
- Attribute-based conditional proxy re-encryption in the standard model under LWE
- Bilinear entropy expansion from the decisional linear assumption
- CCA-Secure Proxy Re-encryption without Pairings
- Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model
- Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Fine-grained proxy re-encryption: definitions and constructions from LWE
- Fully homomorphic encryption using ideal lattices
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure functional encryption for inner products, from standard assumptions
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Functional encryption: definitions and challenges
- Functional Re-encryption and Collusion-Resistant Obfuscation
- Fuzzy Identity-Based Encryption
- scientific article; zbMATH DE number 1303118 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Identity-based encryption from the Diffie-Hellman assumption
- Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
- Multi-hop fine-grained proxy re-encryption
- On lattices, learning with errors, random linear codes, and cryptography
- On the achievability of simulation-based security for functional encryption
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Proxy re-encryption and re-signatures from lattices
- Proxy re-encryption from lattices
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Re-encryption, functional re-encryption, and multi-hop re-encryption: a framework for achieving obfuscation-based security and instantiations from lattices
- Revisiting proxy re-encryption: forward secrecy, improved security, and applications
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Unbounded ABE via bilinear entropy expansion, revisited
- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
- Unidirectional updatable encryption and proxy re-encryption from DDH
- Universal proxy re-encryption
- What about Bob? The inadequacy of CPA security for proxy reencryption
This page was built for publication: Fine-grained re-encryptions between different encryption systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232687)