Identity-based encryption from the Weil pairing
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Pairings for cryptographers
- Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
- Breaking the short certificateless signature scheme
- An improved identity-based key agreement protocol and its security proof
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
- Designing a secure e-tender submission protocol
- Security proofs for identity-based identification and signature schemes
- Using abelian varieties to improve pairing-based cryptography
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- The twin Diffie-Hellman problem and applications
- A secure and scalable group key exchange system
- Pairing-based cryptography on elliptic curves
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- Efficient subtree-based encryption for fuzzy-entity data sharing
- Provably secure group key management scheme based on proxy re-encryption with constant public bulletin size and key derivation time
- Impossibility of simulation secure functional encryption even with random oracles
- Registration-based encryption: removing private-key generator from IBE
- Public-key quantum digital signature scheme with one-time pad private-key
- Message authentication mechanism and privacy protection in the context of vehicular ad hoc networks
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- Identity-based encryption from the Diffie-Hellman assumption
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Timed-release computational secret sharing and threshold encryption
- Functional encryption for computational hiding in prime order groups via pair encodings
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Provably secure certificate-based encryption with leakage resilience
- Dual trapdoor identity-based encryption with keyword search
- Efficient identity-based threshold decryption scheme from bilinear pairings
- Parallelizing pairings on Hessian elliptic curves
- Injective encodings to binary ordinary elliptic curves
- Fine-grained searchable encryption in multi-user setting
- Choosing and generating parameters for pairing implementation on BN curves
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- A provable authenticated group key agreement protocol for mobile environment
- New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
- Identity-based encryption with outsourced equality test in cloud computing
- Robust encryption
- Efficient identity-based authenticated key agreement protocol from pairings
- New identity-based society oriented signature schemes from pairings on elliptic curves
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Supersingular hyperelliptic curves of genus 2 over finite fields
- Efficient algorithms for Koblitz curves over fields of characteristic three
- Indiscreet logarithms in finite fields of small characteristic
- Policy controlled system with anonymity
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- A self-pairing map and its applications to cryptography
- Batch verification of short signatures
- Provably secure and efficient certificateless authenticated tripartite key agreement protocol
- KCI-resilient anonymous wireless link-layer authentication protocols
- E-passport EAC scheme based on identity-based cryptography
- Cryptanalysis of an identity based broadcast encryption scheme without random oracles
- Faster pairing computation on genus 2 hyperelliptic curves
- A refinement of Müller's cube root algorithm
- Flexible attribute-based proxy re-encryption for efficient data sharing
- Revocable attribute-based encryption with decryption key exposure resistance and ciphertext delegation
- Universal designated verifier signature scheme with non-delegatability in the standard model
- Efficient attribute-based encryption with attribute revocation for assured data deletion
- Updating key size estimations for pairings
- Fully secure functional encryption with a large class of relations from the decisional linear assumption
- Functional encryption for cascade automata
- Revocable hierarchical identity-based encryption
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption
- Revocable hierarchical identity-based encryption with adaptive security
- Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
- Compact NIZKs from standard assumptions on bilinear maps
- Non-interactive zero knowledge from sub-exponential DDH
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Generic construction of server-aided revocable hierarchical identity-based encryption
- Distributed key generation for SM9-based systems
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Master-key KDM-secure ABE via predicate encoding
- 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
- Identity-based authenticated encryption with identity confidentiality
- Wildcarded identity-based encryption from lattices
- Functional encryption for set intersection in the multi-client setting
- Efficient fully CCA-secure predicate encryptions from pair encodings
- A new identity-based multivariate signature scheme
- Hardware implementation of multiplication over quartic extension fields
- Verifiable registration-based encryption
- Dynamic decentralized functional encryption
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
- A secure cross-chain transaction model based on quantum multi-signature
- Revocable hierarchical identity-based authenticated key exchange
- Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles
- Fine-grained secure attribute-based encryption
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- Attribute-based access control for inner product functional encryption from LWE
- LOVE a pairing
- Revocable policy-based chameleon hash
- Fine-grained forward secrecy: allow-list/deny-list encryption and applications
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
- Server-aided revocable attribute-based encryption revised: multi-user setting and fully secure
- Optimizing registration based encryption
- Cross-domain attribute-based access control encryption
- Identity based linkable ring signature with logarithmic size
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience
This page was built for publication: Identity-based encryption from the Weil pairing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4783728)
