Verifiable registration-based encryption
From MaRDI portal
Publication:2096501
Recommendations
- Registration-based encryption: removing private-key generator from IBE
- Optimizing registration based encryption
- Registration-based encryption from standard assumptions
- Lower bounds for the number of decryption updates in registration-based encryption
- Revocable IBE systems with almost constant-size key update
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- Advances in Cryptology - CRYPTO 2003
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Certificateless public key cryptography
- Distributed private-key generators for identity-based cryptography
- From selective IBE to full IBE and selective HIBE
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- 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?)
- Identity-based cryptosystems and signature schemes
- Identity-based encryption from the Diffie-Hellman assumption
- Laconic oblivious transfer and its applications
- New constructions of identity-based and key-dependent message secure encryption schemes
- New directions in cryptography
- Probabilistic encryption
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- 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
- Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
Cited in
(31)- Registration-based encryption: removing private-key generator from IBE
- Identity-based encryption with security against the KGC: a formal model and its instantiations
- Optimizing registration based encryption
- Registration-based encryption from standard assumptions
- Laconic private set intersection and applications
- Efficient laconic cryptography from learning with errors
- Registered attribute-based encryption
- 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
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- Registered functional encryptions from pairings
- Online mergers and applications to registration-based encryption and accumulators
- A modular approach to registered ABE for unbounded predicates
- Threshold encryption with silent setup
- Universal vector commitments
- A note on adaptive security in hierarchical identity-based encryption
- Anonymous registered attribute-based signature for circuits
- Multi-authority registered attribute-based encryption
- Distributed broadcast encryption from lattices
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Bounded collusion-resistant registered functional encryption for circuits
- 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
- Silent threshold cryptography from pairings: expressive policies in the plain model
- \textit{Ad hoc} broadcast, trace, and revoke -- plus time-space trade-offs for attribute-based encryption
This page was built for publication: Verifiable registration-based encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096501)
