Pages that link to "Item:Q5418689"
From MaRDI portal
The following pages link to Why Proving HIBE Systems Secure Is Difficult (Q5418689):
Displaying 14 items.
- Anonymous spatial encryption under affine space delegation functionality with full security (Q506150) (← links)
- Parameter-hiding order revealing encryption (Q1633450) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH (Q1710687) (← links)
- Verifiable random functions with optimal tightness (Q2061948) (← links)
- Tightness subtleties for multi-user PKE notions (Q2149787) (← links)
- Optimal tightness for chain-based unique signatures (Q2170062) (← links)
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice (Q2678984) (← links)
- Unbounded HIBE with tight security (Q2692379) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Towards tight adaptive security of non-interactive key exchange (Q2697896) (← links)
- (Q4638057) (← links)
- Hierarchical Identity-Based Encryption with Tight Multi-challenge Security (Q5041156) (← links)
- Tightly secure hierarchical identity-based encryption (Q5919017) (← links)
