Identity-Based Encryption from the Weil Pairing
From MaRDI portal
Publication:4706220
DOI10.1137/S0097539701398521zbMath1046.94008OpenAlexW2086042811WikidataQ55952479 ScholiaQ55952479MaRDI QIDQ4706220
Publication date: 19 June 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539701398521
elliptic curvespairingsTate pairingWeil pairingbilinear mapsidentity-based encryptionbilinear Diffie-Hellmanescrow ElGamal
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (only showing first 100 items - show all)
Identity-based re-encryption scheme with lightweight re-encryption key generation ⋮ Another Look at Tightness ⋮ Modeling Distributed Private Key Generation by Composing Petri Nets ⋮ Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles ⋮ Predicate encryption supporting disjunctions, polynomial equations, and inner products ⋮ Trapdoors for Ideal Lattices with Applications ⋮ Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$ ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption ⋮ From Selective to Adaptive Security in Functional Encryption ⋮ A cryptographic primitive based on hidden-order groups ⋮ Efficient pairing computation on supersingular abelian varieties ⋮ Survey of information security ⋮ Certificateless Proxy Re-Encryption Without Pairings ⋮ Easy Decision Diffie-Hellman Groups ⋮ Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption ⋮ A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes ⋮ Public-key authenticated encryption with keyword search revisited: security model and constructions ⋮ An efficient RSA-based certificateless public key encryption scheme ⋮ Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography ⋮ On the Anonymization of Cocks IBE Scheme ⋮ Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption ⋮ Verifiable Functional Encryption ⋮ Efficient Asymmetric Index Encapsulation Scheme for Named Data ⋮ CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts ⋮ Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks ⋮ Generic constructions of identity-based and certificateless kEMs ⋮ Polynomial approximation of bilinear Diffie-Hellman maps ⋮ Secure multi-party convex hull protocol based on quantum homomorphic encryption ⋮ Wildcarded identity-based encryption ⋮ Improved hidden vector encryption with short ciphertexts and tokens ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ Adaptively secure inner product encryption from LWE ⋮ Incremental symmetric puncturable encryption with support for unbounded number of punctures ⋮ Heuristics of the Cocks-Pinch method ⋮ Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme ⋮ A simple deniable authentication protocol based on the Diffie–Hellman algorithm ⋮ Leakage-Resilient IND-CCA KEM from the Extractable Hash Proofs with Indistinguishability Obfuscation ⋮ Improvement on Meshram et al.'s ID-based cryptographic mechanism ⋮ An Identity-Based Key Agreement Protocol for the Network Layer ⋮ New Communication-Efficient Oblivious Transfer Protocols Based on Pairings ⋮ Design of improved password authentication and update scheme based on elliptic curve cryptography ⋮ Chosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertexts ⋮ Certificateless threshold cryptosystem secure against chosen-ciphertext attack ⋮ Identity-based ring signatures from RSA ⋮ Certificateless undeniable signature scheme ⋮ A novel ID-based designated verifier signature scheme ⋮ Adaptively Secure Non-interactive Threshold Cryptosystems ⋮ Revocable Identity-Based Encryption Revisited: Security Model and Construction ⋮ Efficient Certificateless KEM in the Standard Model ⋮ Factor-4 and 6 compression of cyclotomic subgroups of and ⋮ Provably secure non-interactive key distribution based on pairings ⋮ Generating more MNT elliptic curves ⋮ Efficient computation of roots in finite fields ⋮ Practical Identity-Based Encryption Without Random Oracles ⋮ Generalized Identity Based and Broadcast Encryption Schemes ⋮ Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials ⋮ Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax ⋮ Pairing Computation on Twisted Edwards Form Elliptic Curves ⋮ Exponentiation in Pairing-Friendly Groups Using Homomorphisms ⋮ Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms ⋮ Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition ⋮ Protecting against key-exposure: strongly key-insulated encryption with optimal threshold ⋮ Revisiting Pairing Based Group Key Exchange ⋮ Revocable Hierarchical Identity-Based Encryption: History-Free Update, Security Against Insiders, and Short Ciphertexts ⋮ Certificate-Based Signatures: New Definitions and a Generic Construction from Certificateless Signatures ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Secure administration of cryptographic role-based access control for large-scale cloud storage systems ⋮ Déjà Q: Encore! Un Petit IBE ⋮ HIERARCHICAL IDENTITY-BASED PROXY RE-ENCRYPTION WITHOUT RANDOM ORACLES ⋮ On Shortening Ciphertexts: New Constructions for Compact Public Key and Stateful Encryption Schemes ⋮ Attribute-Based Signatures ⋮ A Privacy-Preserving ID-Based Group Key Agreement Scheme Applied in VPAN ⋮ Adaptive-ID Secure Revocable Identity-Based Encryption ⋮ Universally Anonymous IBE Based on the Quadratic Residuosity Assumption ⋮ Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening ⋮ Asymmetric Group Key Agreement ⋮ Content-Based Encryption ⋮ Identity-Based Group Encryption ⋮ A Schnorr-Like Lightweight Identity-Based Signature Scheme ⋮ Certified Encryption Revisited ⋮ Verifiable Security of Boneh-Franklin Identity-Based Encryption ⋮ Fully Distributed Broadcast Encryption ⋮ Generalized Learning Problems and Applications to Non-commutative Cryptography ⋮ Faster Pairings on Special Weierstrass Curves ⋮ Strongly Secure Certificateless Key Agreement ⋮ Functional encryption for public-attribute inner products: Achieving constant-size ciphertexts with adaptive security or support for negation ⋮ Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ Strong Forward Security in Identity-Based Signcryption ⋮ Publicly Verifiable Secret Sharing for Cloud-Based Key Management ⋮ Robust Encryption ⋮ Note on families of pairing-friendly elliptic curves with small embedding degree ⋮ A group key agreement protocol from pairings ⋮ On Small Characteristic Algebraic Tori in Pairing-Based Cryptography ⋮ Computing on authenticated data ⋮ Privacy-preserving encryption scheme using DNA parentage test ⋮ Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves ⋮ The multiple number field sieve for medium- and high-characteristic finite fields
This page was built for publication: Identity-Based Encryption from the Weil Pairing
