Registration-based encryption in the plain model
From MaRDI portal
Cites work
- Adaptive hardness and composable security in the plain model from standard assumptions
- Adaptive One-Way Functions and Applications
- Advances in Cryptology - CRYPTO 2003
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient laconic cryptography from learning with errors
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Identity-based encryption from the Diffie-Hellman assumption
- Lower bounds for the number of decryption updates in registration-based encryption
- New constructions of identity-based and key-dependent message secure encryption schemes
- New directions in cryptography
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Non-interactive non-malleability from quantum supremacy
- Non-interactive Zaps and New Techniques for NIZK
- One-message zero knowledge and non-malleable commitments
- Practical Identity-Based Encryption Without Random Oracles
- Registered (inner-product) functional encryption
- Registered attribute-based encryption
- Registration-based encryption from standard assumptions
- Registration-based encryption: removing private-key generator from IBE
- Trapdoors for hard lattices and new cryptographic constructions
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
Cited in
(1)
This page was built for publication: Registration-based encryption in the plain model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951603)
