scientific article
From MaRDI portal
Publication:2763028
zbMath0990.94024MaRDI QIDQ2763028
Masaki Nakabayashi, Shunzo Takano, Atsuko Miyaji
Publication date: 14 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Pairing-based cryptography on elliptic curves ⋮ Faster Hashing to ${\mathbb G}_2$ ⋮ Extended dual system group and shorter unbounded hierarchical identity based encryption ⋮ Efficient hash maps to \(\mathbb{G}_2\) on BLS curves ⋮ On the near prime-order MNT curves ⋮ A comparison of MNT curves and supersingular curves ⋮ Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree ⋮ Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption ⋮ ON DISCRIMINANTS OF MINIMAL POLYNOMIALS OF THE RAMANUJAN CLASS INVARIANTS ⋮ A survey of elliptic curves for proof systems ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Shorter identity-based encryption via asymmetric pairings ⋮ Key continual-leakage resilient broadcast cryptosystem from dual system in broadcast networks ⋮ DiSSECT: distinguisher of standard and simulated elliptic curves via traits ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Revisiting cycles of pairing-friendly elliptic curves ⋮ CCA updatable encryption against malicious re-encryption attacks ⋮ Provably-secure time-bound hierarchical key assignment schemes ⋮ On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ ⋮ On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ An optimal Tate pairing computation using Jacobi quartic elliptic curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ The complexity of class polynomial computation via floating point approximations ⋮ On the efficient generation of prime-order elliptic curves ⋮ Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ Fast Hashing to G 2 on Pairing-Friendly Curves ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant ⋮ Real Hidden Identity-Based Signatures ⋮ Unnamed Item ⋮ A Brief History of Pairings
