The following pages link to (Q2739458):
Displaying 50 items.
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree (Q2163356) (← links)
- A survey on delegated computation (Q2163976) (← links)
- Secure and efficient delegation of elliptic-curve pairing (Q2229264) (← links)
- An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks (Q2293188) (← links)
- Beta Weil pairing revisited (Q2313463) (← links)
- Koblitz curves over quadratic fields (Q2318090) (← links)
- Ephemeral-secret-leakage secure ID-based three-party authenticated key agreement protocol for mobile distributed computing environments (Q2331797) (← links)
- Further refinement of pairing computation based on Miller's algorithm (Q2381335) (← links)
- Algebraic generalization of Diffie-Hellman key exchange (Q2413287) (← links)
- Polynomial approximation of bilinear Diffie-Hellman maps (Q2426464) (← links)
- Elliptic curve cryptography: the serpentine course of a paradigm shift (Q2430981) (← links)
- Heuristics of the Cocks-Pinch method (Q2437964) (← links)
- Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme (Q2438535) (← links)
- Security weaknesses of a signature scheme and authenticated key agreement protocols (Q2445398) (← links)
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings (Q2453385) (← links)
- Weakness in ID-based one round authenticated tripartite multiple-key agreement protocol with pairings (Q2485651) (← links)
- A group key agreement protocol from pairings (Q2570804) (← links)
- On the near prime-order MNT curves (Q2631924) (← links)
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118) (← links)
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions (Q2827730) (← links)
- Cryptanalysis of GGH15 Multilinear Maps (Q2829232) (← links)
- A clustering-based group key agreement protocol for ad-hoc networks (Q2864368) (← links)
- Efficient three-party authenticated key agreement protocol in certificateless cryptography (Q2885502) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- On Near Prime-Order Elliptic Curves with Small Embedding Degrees (Q2947154) (← links)
- Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree (Q2947157) (← links)
- Elligator Squared: Uniform Points on Elliptic Curves of Prime Order as Uniform Random Strings (Q2949239) (← links)
- A new certificateless multiple key agreement scheme (Q2966501) (← links)
- On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ (Q2980869) (← links)
- An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication (Q2988347) (← links)
- Cryptographic Pairings Based on Elliptic Nets (Q3097999) (← links)
- Publicly Verifiable Secret Sharing for Cloud-Based Key Management (Q3104748) (← links)
- On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant (Q3104749) (← links)
- Authenticated Group Key Agreement Protocol Without Pairing (Q3297534) (← links)
- Generating Pairing-Friendly Curves with the CM Equation of Degree 1 (Q3392903) (← links)
- Attribute-Based Broadcast Encryption Scheme Made Efficient (Q3506391) (← links)
- Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures (Q3506405) (← links)
- Cryptanalytic Flaws in Oh et al.’s ID-Based Authenticated Key Agreement Protocol (Q3512528) (← links)
- The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
- A Provably Secure One-Pass Two-Party Key Establishment Protocol (Q3600324) (← links)
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax (Q3600501) (← links)
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms (Q3600509) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
- Revisiting Pairing Based Group Key Exchange (Q3603004) (← links)
- Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening (Q3623060) (← links)
- Secure and Efficient Group Key Agreements for Cluster Based Networks (Q3627421) (← links)
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates (Q3644190) (← links)
- Public Verifiability from Pairings in Secret Sharing Schemes (Q3644208) (← links)
