Registration-based encryption from standard assumptions
From MaRDI portal
Publication:2289426
Recommendations
Cited in
(35)- Registration-based encryption: removing private-key generator from IBE
- Identity-based encryption with security against the KGC: a formal model and its instantiations
- New constructions of hinting PRGs, OWFs with encryption, and more
- Verifiable registration-based encryption
- Optimizing registration based encryption
- Laconic private set intersection and applications
- Match me if you can: matchmaking encryption and its applications
- Efficient laconic cryptography from learning with errors
- Registered attribute-based encryption
- IBE with incompressible master secret and small identity secrets
- Lower bounds for the number of decryption updates in registration-based encryption
- How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
- Lower bounds on assumptions behind registration-based encryption
- Registered ABE via predicate encodings
- Registered (inner-product) functional encryption
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Distributed broadcast encryption from bilinear groups
- R3PO: reach-restricted reactive program obfuscation and its applications
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- Registered functional encryptions from pairings
- A modular approach to registered ABE for unbounded predicates
- Threshold encryption with silent setup
- A note on adaptive security in hierarchical identity-based encryption
- Anonymous registered attribute-based signature for circuits
- Multi-authority registered attribute-based encryption
- Registration-based encryption in the plain model
- Distributed broadcast encryption from lattices
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Traitor tracing without trusted authority from registered functional encryption
- Oblivious identity-based encryption. IBE secure against an adversarial KGC
- When KGC meets curator: new paradigm of registered ABE and FE
- Lower bounding update frequency in short accumulators and vector commitments
- \textit{Ad hoc} broadcast, trace, and revoke -- plus time-space trade-offs for attribute-based encryption
- Compact registered functional encryption for attribute-weighted sums with access control
- Tight lower bound on witness update frequency in additive positive accumulators
This page was built for publication: Registration-based encryption from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289426)