Efficient Identity-Based Encryption Without Random Oracles
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Efficient public key encryption with smallest ciphertext expansion from factoring
- 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
- Ring signatures: Stronger definitions, and constructions without random oracles
- Security proofs for identity-based identification and signature schemes
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- Tight chosen ciphertext attack (CCA)-secure hybrid encryption scheme with full public verifiability
- Efficient subtree-based encryption for fuzzy-entity data sharing
- Adaptively secure distributed PRFs from LWE
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- Short variable length domain extenders with beyond birthday bound security
- Memory lower bounds of reductions revisited
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Timed-release computational secret sharing and threshold encryption
- Efficient authentication from hard learning problems
- Provably secure certificate-based encryption with leakage resilience
- Improved inner-product encryption with adaptive security and full attribute-hiding
- All-but-many encryption
- Identity-based quotable ring signature
- New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
- IRIBE: intrusion-resilient identity-based encryption
- Attacks on one designated verifier proxy signature scheme
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
- Bonsai trees, or how to delegate a lattice basis
- Non-interactive multisignatures in the plain public-key model with efficient verification
- Relations between semantic security and anonymity in identity-based encryption
- Cryptanalysis of an identity based broadcast encryption scheme without random oracles
- Subversion-resilient signatures: definitions, constructions and applications
- Deterministic public-key encryption for adaptively-chosen plaintext distributions
- Universal designated verifier signature scheme with non-delegatability in the standard model
- Confined guessing: new signatures from standard assumptions
- Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model
- Novel generic construction of leakage-resilient PKE scheme with CCA security
- Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Generic construction of server-aided revocable hierarchical identity-based encryption
- An efficient CCA-secure access control encryption for any policy
- Impossibility on tamper-resilient cryptography with uniqueness properties
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Verifiable random functions with optimal tightness
- Wildcarded identity-based encryption from lattices
- Adaptively secure constrained pseudorandom functions in the standard model
- Reverse firewalls for actively secure MPCs
- Don't tamper with dual system encryption. Beyond polynomial related-key security of IBE
- Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles
- Partially structure-preserving signatures: lower bounds, constructions and more
- A generic construction of fuzzy signature
- Skipping the \(q\) in group signatures
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Identity-based data storage scheme with anonymous key generation in fog computing
- Puncturable identity-based and attribute-based encryption from lattices
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Efficient traceable ring signature scheme without pairings
- Forward-secure ID based digital signature scheme with forward-secure private key generator
- Intrusion-resilient identity-based signatures: concrete scheme in the standard model and generic construction
- Identity-based revocation system: enhanced security model and scalable bounded IBRS construction with short parameters
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Tight security for the generic construction of identity-based signature (in the multi-instance setting)
- New technique for chosen-ciphertext security based on non-interactive zero-knowledge
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
- Generalized public-key cryptography with tight security
- Efficient identity-based encryption with hierarchical key-insulation from HIBE
- Anonymous HIBE with short ciphertexts: full security in prime order groups
- Efficient hybrid encryption from ID-based encryption
- Efficient chosen-ciphertext secure certificateless threshold key encapsulation mechanism
- 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
- Identity-based encryption with leakage-amplified chosen-ciphertext attacks security
- Revocable identity-based encryption with server-aided ciphertext evolution
- A fully distributed hierarchical attribute-based encryption scheme
- Beta Weil pairing revisited
- An alternative approach to public cloud data auditing supporting data dynamics
- An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem
- Continuous leakage-resilient identity-based encryption with leakage amplification
- Tightly secure signature schemes from the LWE and subset sum assumptions
- Ephemeral-secret-leakage secure ID-based three-party authenticated key agreement protocol for mobile distributed computing environments
- A strong designated verifier proxy re-signature scheme for IoT environments
- Computing on authenticated data
- Sequential aggregate signatures with short public keys without random oracles
- Privacy-preserving encryption scheme using DNA parentage test
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves
- Practical (fully) distributed signatures provably secure in the standard model
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Survey of information security
- Fully leakage-resilient signatures
- Efficient revocable identity-based encryption via subset difference methods
- Efficient and secure attribute-based signature for monotone predicates
- Anonymous and leakage resilient IBE and IPE
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
- Identity-based encryption with hierarchical key-insulation in the standard model
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- A generic construction of tightly secure signatures in the multi-user setting
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- On tight security proofs for Schnorr signatures
- Generic constructions of identity-based and certificateless kEMs
- Wildcarded identity-based encryption
This page was built for publication: Efficient 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 Q5385725)
