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