Practical Identity-Based Encryption Without Random Oracles
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Efficient Construction of (Distributed) Verifiable Random Functions
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical ID-Based Cryptography
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 2009960 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 2086725 (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 Weil Pairing
- Public Key Cryptography - PKC 2005
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
- Topics in Cryptology – CT-RSA 2005
Cited in
(only showing first 100 items - show all)- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- Efficient subtree-based encryption for fuzzy-entity data sharing
- Regular lossy functions and their applications in leakage-resilient cryptography
- Memory lower bounds of reductions revisited
- Another step towards realizing random oracles: non-malleable point obfuscation
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
- IRIBE: intrusion-resilient identity-based encryption
- Robust encryption
- Bonsai trees, or how to delegate a lattice basis
- Relations between semantic security and anonymity in identity-based encryption
- Cryptanalysis of an identity based broadcast encryption scheme without random oracles
- Fully secure functional encryption with a large class of relations from the decisional linear assumption
- Revocable hierarchical identity-based encryption
- Novel generic construction of leakage-resilient PKE scheme with CCA security
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Identity-based encryption with security against the KGC: a formal model and its instantiations
- Implementing secure reporting of sexual misconduct -- revisiting WhoToo
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience
- Access control encryption with efficient verifiable sanitized decryption
- Identity-based revocation system: enhanced security model and scalable bounded IBRS construction with short parameters
- New technique for chosen-ciphertext security based on non-interactive zero-knowledge
- KDM security for identity-based encryption: constructions and separations
- Anonymous HIBE with short ciphertexts: full security in prime order groups
- Efficient hybrid encryption from ID-based encryption
- A provably secure certificate-based encryption scheme against malicious CA attacks in the standard model
- Novel updatable identity-based hash proof system and its applications
- Registration-based encryption from standard assumptions
- Revocable identity-based encryption with server-aided ciphertext evolution
- Continuous leakage-resilient identity-based encryption with leakage amplification
- Ephemeral-secret-leakage secure ID-based three-party authenticated key agreement protocol for mobile distributed computing environments
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- On the power of rewinding simulators in functional encryption
- Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
- Generic constructions of identity-based and certificateless kEMs
- Inner-product encryption under standard assumptions
- The relation and transformation between hierarchical inner product encryption and spatial encryption
- Extended dual system group and shorter unbounded hierarchical identity based encryption
- An efficient IBE scheme with tight security reduction in the random oracle model
- Accountable identity-based encryption with distributed private key generators
- Efficient revocable identity-based encryption with short public parameters
- Adaptively secure certificate-based broadcast encryption and its application to cloud storage service
- Efficient and fully secure lattice-based IBE with equality test
- Forward-secure revocable identity-based encryption
- Adaptively secure inner product encryption from LWE
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Déjà Q: encore! Un petit IBE
- Functional encryption without obfuscation
- Idealizing identity-based encryption
- One-round strong oblivious signature-based envelope
- Content-based encryption
- Identity-based group encryption
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Universally composable identity-based encryption
- An efficient and provably secure certificate-based encryption scheme
- Efficient statically-secure large-universe multi-authority attribute-based encryption
- Towards tightly secure lattice short signature and id-based encryption
- Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Iterated random oracle: a universal approach for finding loss in security reduction
- New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
- Semi-adaptive security and bundling functionalities made generic and easy
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Improved identity-based online/offline encryption
- Constructions of CCA-Secure Revocable Identity-Based Encryption
- Identity-based group encryption revisited
- Generic construction of bounded-collusion IBE via table-based ID-to-key map
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Formal Security Treatments for Signatures from Identity-Based Encryption
- Efficient One-Round Key Exchange in the Standard Model
- General Certificateless Encryption and Timed-Release Encryption
- Efficient Certificate-Based Encryption in the Standard Model
- Identity Based Encryption Without Redundancy
- Programmable Hash Functions and Their Applications
- Multi-Identity Single-Key Decryption without Random Oracles
- Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities
- Identity-Based Online/Offline Encryption
- Adaptive-ID Secure Revocable Identity-Based Encryption
- A Variant of Boneh-Gentry-Hamburg’s Pairing-Free Identity Based Encryption Scheme
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Building Key-Private Public-Key Encryption Schemes
- Certified Encryption Revisited
- Practical hybrid (hierarchical) identity-based encryption schemes based on the decisional bilinear Diffie-Hellman assumption
- Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles
- Broadcast encryption based non-interactive key distribution in MANETs
- Shorter identity-based encryption via asymmetric pairings
- Reducing elliptic curve logarithms to logarithms in a finite field
- Programmable hash functions and their applications
- Accountable authority key policy attribute-based encryption
- Adaptively secure identity-based broadcast encryption with constant size private keys and ciphertexts from the subgroups
- Chosen ciphertext secure keyed-homomorphic public-key encryption
- Revocable identity-based encryption revisited: security model and construction
- A timed-release proxy re-encryption scheme and its application to fairly-opened multicast communication
- Public key encryption with keyword search secure against keyword guessing attacks without random oracle
This page was built for publication: Practical Identity-Based Encryption Without Random Oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593111)
