Lower bounds on assumptions behind registration-based encryption
From MaRDI portal
Publication:6582178
Recommendations
Cites work
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Cryptography and Coding
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- From selective IBE to full IBE and selective HIBE
- Generic-Group Identity-Based Encryption: A Tight Impossibility Result
- Generic-group delay functions require hidden-order groups
- On the impossibility of algebraic vector commitments in pairing-free groups
- On the impossibility of purely algebraic signatures
- Registered attribute-based encryption
- Registration-based encryption from standard assumptions
- Registration-based encryption: removing private-key generator from IBE
- Theory of Cryptography
- To label, or not to label (in generic groups)
- Trapdoor hash functions and their applications
- Verifiable registration-based encryption
Cited in
(2)
This page was built for publication: Lower bounds on assumptions behind registration-based encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582178)