scientific article; zbMATH DE number 1942431
From MaRDI portal
Publication:4409129
Recommendations
Cited in
(only showing first 100 items - show all)- On the relationship between squared pairings and plain pairings
- Computing bilinear pairings on elliptic curves with automorphisms
- Generating more MNT elliptic curves
- A provably secure proxy signcryption scheme using bilinear pairings
- Computing pairings using \(x\)-coordinates only
- Topics in Cryptology – CT-RSA 2005
- Efficient and Short Certificateless Signature
- Efficient Tate pairing computation using double-base chains
- Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five
- Further refinement of pairing computation based on Miller's algorithm
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
- A Schnorr-Like Lightweight Identity-Based Signature Scheme
- An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices
- Selected Areas in Cryptography
- An improved identity-based key agreement protocol and its security proof
- On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Identity-based authenticated key agreement protocol based on Weil pairing
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Efficient proxy signcryption scheme with provable CCA and CMA security
- Optimal pairing computation over families of pairing-friendly elliptic curves
- An improved two-party identity-based authenticated key agreement protocol using pairings
- Faster hashing to \({\mathbb G}_2\)
- On the distribution of irreducible trinomials over \(\mathbb F_3\)
- Implementing cryptographic pairings
- Identity-based chameleon hashing and signatures without key exposure
- A pairing-based publicly verifiable secret sharing scheme
- Certificateless message recovery signatures providing Girault's level-3 security
- Faster computation of the Tate pairing
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- Faster and lower memory scalar multiplication on supersingular curves in characteristic three
- Efficient three-party authenticated key agreement protocol in certificateless cryptography
- Faster Pairings on Special Weierstrass Curves
- Several security schemes constructed using ECC-based self-certified public key cryptosystems
- An ID-based authenticated dynamic group key agreement with optimal round
- Complexity of computation in finite fields
- Optimised Versions of the Ate and Twisted Ate Pairings
- Private key agreement and secure communication for heterogeneous sensor networks
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Formulas for cube roots in \(\mathbb F_{3^m}\)
- Implementing optimized pairings with elliptic nets
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- A comparison of MNT curves and supersingular curves
- A strong provably secure IBE scheme without bilinear map
- Further refinements of Miller's algorithm on Edwards curves
- Multibase scalar multiplications in cryptographic pairings
- Isomorphism classes of elliptic and hyperelliptic curves over finite fields \(\mathbb F_{(2g+1)^n}\)
- On Software Parallel Implementation of Cryptographic Pairings
- Identity-based trapdoor mercurial commitments and applications
- The realm of the pairings
- Algorithmic Number Theory
- Improved generalized Atkin algorithm for computing square roots in finite fields
- scientific article; zbMATH DE number 2086895 (Why is no real title available?)
- Efficient algorithms for Koblitz curves over fields of characteristic three
- Certificateless signature and proxy signature schemes from bilinear pairings
- An Analysis of the Vector Decomposition Problem
- Taking roots over high extensions of finite fields
- Multiple point compression on elliptic curves
- A taxonomy of pairing-friendly elliptic curves
- Algebraic curves and cryptography
- An efficient ring signature scheme from pairings
- A mechanical approach to derive identity-based protocols from Diffie-Hellman-based protocols
- A conference key distribution system
- Secure and Efficient Group Key Agreements for Cluster Based Networks
- Formulas for cube roots in \(\mathbb F_{3^m}\) using shifted polynomial basis
- Fast symmetric pairing revisited
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves
- Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode
- Non-interactive identity-based threshold signature scheme without random oracles
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- A certificateless public key encryption based return routability protocol for next-generation IP mobility to enhance signalling security and reduce latency
- Idetity based group key agreement from bilinear pairing
- An Efficient ID-Based Proxy Signature Scheme from Pairings
- On the arithmetic operations over finite fields of characteristic three with low complexity
- Cryptographic pairings based on elliptic nets
- Signcryption with non-interactive non-repudiation
- An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels
- Efficient ID-Based Key-Insulated Signature Scheme with Batch Verifications using Bilinear Pairings over Elliptic Curves
- Fast Hashing to G 2 on Pairing-Friendly Curves
- PandA: pairings and arithmetic
- Scalable zero knowledge via cycles of elliptic curves
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
- Cryptanalysis of pairing-based cryptosystems over small characteristic fields
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- Efficient compression of SIDH public keys
- Beta Weil pairing revisited
- Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
- EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE
- Efficient system parameters for identity-based encryption using supersingular elliptic curves
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- Fuzzy perspective of online games by using cryptography and cooperative game theory
- An analysis of affine coordinates for pairing computation
- An efficient and provably secure certificate-based encryption scheme
- Ordinary Abelian varieties having small embedding degree
- Designing efficient dyadic operations for cryptographic applications
- Efficient implementation of pairing-based cryptosystems
- Choosing and generating parameters for pairing implementation on BN curves
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409129)
