Lower bounds on assumptions behind registration-based encryption
From MaRDI portal
Publication:6582178
DOI10.1007/978-3-031-48618-0_11zbMATH Open1544.94247MaRDI QIDQ6582178FDOQ6582178
Authors: Mohammad Hajiabadi, Mohammad Mahmoody, Wei Qi, Sara Sarfaraz 
Publication date: 2 August 2024
Recommendations
Cites Work
- Title not available (Why is that?)
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Theory of Cryptography
- Advances in Cryptology – CRYPTO 2004
- Cryptography and Coding
- To label, or not to label (in generic groups)
- Registration-based encryption: removing private-key generator from IBE
- Anonymous IBE, leakage resilience and circular security from new assumptions
- From selective IBE to full IBE and selective HIBE
- Trapdoor hash functions and their applications
- Generic-group delay functions require hidden-order groups
- Verifiable registration-based encryption
- Registration-based encryption from standard assumptions
- On the impossibility of purely algebraic signatures
- Generic-Group Identity-Based Encryption: A Tight Impossibility Result
- Registered attribute-based encryption
- On the impossibility of algebraic vector commitments in pairing-free groups
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)
