The following pages link to (Q4414287):
Displaying 50 items.
- Multi-party revocation in sovrin: performance through distributed trust (Q826287) (← links)
- On bilinear structures on divisor class groups (Q1017359) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Efficient implementation of pairing-based cryptosystems (Q1772224) (← links)
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 (Q1995209) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level (Q2055706) (← links)
- Group signatures with user-controlled and sequential linkability (Q2061926) (← links)
- Hardware implementation of multiplication over quartic extension fields (Q2079983) (← links)
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- LOVE a pairing (Q2146100) (← links)
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree (Q2163356) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Beta Weil pairing revisited (Q2313463) (← links)
- Improving the computation of the optimal ate pairing for a high security level (Q2317387) (← links)
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method (Q2430983) (← links)
- Provably secure non-interactive key distribution based on pairings (Q2489921) (← links)
- Generating more MNT elliptic curves (Q2491266) (← links)
- Elliptic curves suitable for pairing based cryptography (Q2572982) (← links)
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice (Q2678984) (← links)
- Practical dynamic group signatures without knowledge extractors (Q2692957) (← links)
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments (Q2697847) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication (Q2988347) (← links)
- The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
- Cryptographic Pairings Based on Elliptic Nets (Q3097999) (← links)
- On the Efficient Implementation of Pairing-Based Protocols (Q3104702) (← links)
- On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant (Q3104749) (← links)
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings (Q3104750) (← links)
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves (Q3392904) (← links)
- Faster Pairings on Special Weierstrass Curves (Q3392905) (← links)
- Constructing elliptic curves from Galois representations (Q4683884) (← links)
- Adequate Elliptic Curves for Computing the Product of n Pairings (Q5267791) (← links)
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree (Q5738795) (← links)
- On Cycles of Pairing-Friendly Elliptic Curves (Q5742695) (← links)
- Algorithmic Number Theory (Q5899268) (← links)
- Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange (Q5918309) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
- Anonymous tokens with public metadata and applications to private contact tracing (Q6045198) (← links)
- TinyABE: unrestricted ciphertext-policy attribute-based encryption for embedded devices and low-quality networks (Q6103078) (← links)
- DiSSECT: distinguisher of standard and simulated elliptic curves via traits (Q6103100) (← links)
- Co-factor clearing and subgroup membership testing on pairing-friendly curves (Q6103102) (← links)
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation (Q6108852) (← links)
- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves (Q6135392) (← links)
- New versions of Miller-loop secured against side-channel attacks (Q6169018) (← links)
- Secure and Efficient Pairing at 256-Bit Security Level (Q6487201) (← links)
- Curves with Fast Computations in the First Pairing Group (Q6488030) (← links)
- Pairings in rank-1 constraint systems (Q6535081) (← links)
- Practical round-optimal blind signatures in the ROM from standard assumptions (Q6562573) (← links)
