scientific article; zbMATH DE number 1942431
From MaRDI portal
Publication:4409129
zbMath1026.94520MaRDI QIDQ4409129
No author found.
Publication date: 30 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2442/24420354.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (90)
Efficient three-party authenticated key agreement protocol in certificateless cryptography ⋮ Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields ⋮ Faster Hashing to ${\mathbb G}_2$ ⋮ Identity based group key agreement in multiple PKG environment ⋮ Signcryption-based key management for MANETs applications in mobile commerce ⋮ Idetity based group key agreement from bilinear pairing ⋮ A strongly secure identity-based authenticated group key exchange protocol ⋮ On the distribution of irreducible trinomials over \(\mathbb F_3\) ⋮ Further refinements of Miller's algorithm on Edwards curves ⋮ Multibase scalar multiplications in cryptographic pairings ⋮ Improved generalized Atkin algorithm for computing square roots in finite fields ⋮ A certificateless public key encryption based return routability protocol for next-generation IP mobility to enhance signalling security and reduce latency ⋮ Further refinement of pairing computation based on Miller's algorithm ⋮ Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ An Efficient and Provably Secure Certificate-Based Encryption Scheme ⋮ Efficient ID-Based Key-Insulated Signature Scheme with Batch Verifications using Bilinear Pairings over Elliptic Curves ⋮ A comparison of MNT curves and supersingular curves ⋮ Formulas for cube roots in \(\mathbb F_{3^m}\) ⋮ The generalized Weil pairing and the discrete logarithm problem on elliptic curves ⋮ An ID-based authenticated dynamic group key agreement with optimal round ⋮ Complexity of computation in finite fields ⋮ An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Implementing optimized pairings with elliptic nets ⋮ Certificateless message recovery signatures providing Girault's level-3 security ⋮ An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels ⋮ Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks ⋮ Efficient proxy signcryption scheme with provable CCA and CMA security ⋮ An improved two-party identity-based authenticated key agreement protocol using pairings ⋮ Computing bilinear pairings on elliptic curves with automorphisms ⋮ Identity-based chameleon hashing and signatures without key exposure ⋮ Backdoor-resistant identity-based proxy re-encryption for cloud-assisted wireless body area networks ⋮ Faster computation of the Tate pairing ⋮ Optimal pairing computation over families of pairing-friendly elliptic curves ⋮ Formulas for cube roots in \(\mathbb F_{3^m}\) using shifted polynomial basis ⋮ On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings ⋮ Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\) ⋮ Private key agreement and secure communication for heterogeneous sensor networks ⋮ Non-interactive identity-based threshold signature scheme without random oracles ⋮ Ordinary Abelian varieties having small embedding degree ⋮ A mechanical approach to derive identity-based protocols from Diffie-Hellman-based protocols ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Efficient Tate pairing computation using double-base chains ⋮ Multiple point compression on elliptic curves ⋮ Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five ⋮ An efficient ring signature scheme from pairings ⋮ Algebraic curves and cryptography ⋮ Identity-based authenticated key agreement protocol based on Weil pairing ⋮ Efficient Compression of SIDH Public Keys ⋮ A pairing-based publicly verifiable secret sharing scheme ⋮ Generating more MNT elliptic curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Efficient algorithms for Koblitz curves over fields of characteristic three ⋮ An Efficient ID-Based Proxy Signature Scheme from Pairings ⋮ Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field ⋮ Pairing Computation on Twisted Edwards Form Elliptic Curves ⋮ 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 ⋮ A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ ⋮ Identity-based trapdoor mercurial commitments and applications ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ An Analysis of the Vector Decomposition Problem ⋮ Optimised Versions of the Ate and Twisted Ate Pairings ⋮ Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography ⋮ An improved identity-based key agreement protocol and its security proof ⋮ Computing pairings using \(x\)-coordinates only ⋮ A strong provably secure IBE scheme without bilinear map ⋮ Secure and Efficient Group Key Agreements for Cluster Based Networks ⋮ A Schnorr-Like Lightweight Identity-Based Signature Scheme ⋮ Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ Faster Pairings on Special Weierstrass Curves ⋮ Fast Hashing to G 2 on Pairing-Friendly Curves ⋮ Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates ⋮ On Software Parallel Implementation of Cryptographic Pairings ⋮ Cryptographic Pairings Based on Elliptic Nets ⋮ Beta Weil pairing revisited ⋮ On the relationship between squared pairings and plain pairings ⋮ Isomorphism classes of elliptic and hyperelliptic curves over finite fields \(\mathbb F_{(2g+1)^n}\) ⋮ Efficient and Short Certificateless Signature ⋮ Efficient system parameters for Identity-Based Encryption using supersingular elliptic curves ⋮ Certificateless signature and proxy signature schemes from bilinear pairings ⋮ Several security schemes constructed using ECC-based self-certified public key cryptosystems ⋮ Signcryption with non-interactive non-repudiation ⋮ A provably secure proxy signcryption scheme using bilinear pairings ⋮ Taking roots over high extensions of finite fields ⋮ A conference key distribution system ⋮ On the arithmetic operations over finite fields of characteristic three with low complexity
This page was built for publication:
