Lower bounds for the number of decryption updates in registration-based encryption
From MaRDI portal
Recommendations
Cites work
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Certificateless public key cryptography
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 2163009 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- Identity-based cryptosystems and signature schemes
- Identity-based encryption from the Diffie-Hellman assumption
- Identity-based encryption with security against the KGC: a formal model and its instantiation from lattices
- Indistinguishability obfuscation from well-founded assumptions
- On the communication complexity of secure function evaluation with long output
- Optimizing registration based encryption
- Reducing Trust in the PKG in Identity Based Cryptosystems
- Registration-based encryption from standard assumptions
- Registration-based encryption: removing private-key generator from IBE
- Removing Escrow from Identity-Based Encryption
- Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions
- Verifiable registration-based encryption
Cited in
(10)- Registration-based encryption: removing private-key generator from IBE
- Verifiable registration-based encryption
- Optimizing registration based encryption
- Registration-based encryption from standard assumptions
- Lower bounds on assumptions behind registration-based encryption
- Registered (inner-product) functional encryption
- Online mergers and applications to registration-based encryption and accumulators
- Merkle mountain ranges are optimal: on witness update frequency for cryptographic accumulators
- Registration-based encryption in the plain model
- Lower bounding update frequency in short accumulators and vector commitments
This page was built for publication: Lower bounds for the number of decryption updates in registration-based encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169371)