The following pages link to (Q2763028):
Displayed 33 items.
- Shorter identity-based encryption via asymmetric pairings (Q404944) (← links)
- Provably-secure time-bound hierarchical key assignment schemes (Q431793) (← links)
- A comparison of MNT curves and supersingular curves (Q862563) (← links)
- Key continual-leakage resilient broadcast cryptosystem from dual system in broadcast networks (Q893862) (← links)
- Pairing-based cryptography on elliptic curves (Q1616164) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- An optimal Tate pairing computation using Jacobi quartic elliptic curves (Q1752615) (← links)
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Extended dual system group and shorter unbounded hierarchical identity based encryption (Q2630713) (← links)
- On the near prime-order MNT curves (Q2631924) (← links)
- CCA updatable encryption against malicious re-encryption attacks (Q2691599) (← links)
- Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
- Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree (Q2947157) (← links)
- Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption (Q2948190) (← links)
- (Q2956382) (← links)
- On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ (Q2980869) (← links)
- The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
- On the Efficient Implementation of Pairing-Based Protocols (Q3104702) (← links)
- On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant (Q3104749) (← links)
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves (Q3392904) (← links)
- Fast Hashing to G 2 on Pairing-Friendly Curves (Q3392906) (← links)
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography (Q3634510) (← links)
- A Brief History of Pairings (Q5267789) (← links)
- On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves (Q5389447) (← links)
- Real Hidden Identity-Based Signatures (Q5854422) (← links)
- On the efficient generation of prime-order elliptic curves (Q5962222) (← links)
- ON DISCRIMINANTS OF MINIMAL POLYNOMIALS OF THE RAMANUJAN CLASS INVARIANTS (Q6060522) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- DiSSECT: distinguisher of standard and simulated elliptic curves via traits (Q6103100) (← links)
- Revisiting cycles of pairing-friendly elliptic curves (Q6186695) (← links)