The following pages link to (Q4737495):
Displayed 46 items.
- An improved two-party identity-based authenticated key agreement protocol using pairings (Q414861) (← links)
- Provably secure three-party password-based authenticated key exchange protocol (Q425526) (← links)
- A mechanical approach to derive identity-based protocols from Diffie-Hellman-based protocols (Q507654) (← links)
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves (Q596141) (← links)
- Chosen ciphertext secure authenticated group communication using identity-based signcryption (Q604107) (← links)
- An efficient dynamic authenticated key exchange protocol with selectable identities (Q639064) (← links)
- Zero-knowledge identification scheme based on Weil pairing (Q639425) (← links)
- Private key agreement and secure communication for heterogeneous sensor networks (Q666197) (← links)
- Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode (Q848272) (← links)
- Efficient hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
- A comparison of MNT curves and supersingular curves (Q862563) (← links)
- Formulas for cube roots in \(\mathbb F_{3^m}\) (Q868380) (← links)
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\) (Q932799) (← links)
- Non-interactive identity-based threshold signature scheme without random oracles (Q943088) (← links)
- Efficient Tate pairing computation using double-base chains (Q954437) (← links)
- An improved identity-based key agreement protocol and its security proof (Q1007846) (← links)
- On the relationship between squared pairings and plain pairings (Q1045941) (← links)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Efficient algorithms for Koblitz curves over fields of characteristic three (Q1775021) (← links)
- On the distribution of irreducible trinomials over \(\mathbb F_3\) (Q2370648) (← links)
- Further refinement of pairing computation based on Miller's algorithm (Q2381335) (← links)
- Efficient pairing computation on supersingular abelian varieties (Q2383998) (← links)
- Ordinary Abelian varieties having small embedding degree (Q2467316) (← links)
- Generating more MNT elliptic curves (Q2491266) (← links)
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) (← links)
- Certificateless signature and proxy signature schemes from bilinear pairings (Q2571514) (← links)
- Several security schemes constructed using ECC-based self-certified public key cryptosystems (Q2572699) (← links)
- Efficient three-party authenticated key agreement protocol in certificateless cryptography (Q2885502) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks (Q3503870) (← links)
- Identity-based authenticated key agreement protocol based on Weil pairing (Q3577932) (← links)
- Pairing Computation on Twisted Edwards Form Elliptic Curves (Q3600505) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
- Secure and Efficient Group Key Agreements for Cluster Based Networks (Q3627421) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- Easy Decision Diffie-Hellman Groups (Q4827630) (← links)
- Boneh-Franklin IBE (Q5050183) (← links)
- Optimised Versions of the Ate and Twisted Ate Pairings (Q5448545) (← links)
- Efficient Compression of SIDH Public Keys (Q5738894) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
- (Q6081719) (← links)
- Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities (Q6122595) (← links)
- Generic construction of trace-and-revoke inner product functional encryption (Q6173290) (← links)