scientific article; zbMATH DE number 1952905

No author found.

Publication date: 24 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2576/25760257.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items (48)

Multi-party revocation in sovrin: performance through distributed trust ⋮ Efficient hash maps to \(\mathbb{G}_2\) on BLS curves ⋮ LOVE a pairing ⋮ Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree ⋮ Families of SNARK-friendly 2-chains of elliptic curves ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Anonymous tokens with public metadata and applications to private contact tracing ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ Revisiting BBS signatures ⋮ Non-interactive blind signatures for random messages ⋮ GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs ⋮ TinyABE: unrestricted ciphertext-policy attribute-based encryption for embedded devices and low-quality networks ⋮ DiSSECT: distinguisher of standard and simulated elliptic curves via traits ⋮ Co-factor clearing and subgroup membership testing on pairing-friendly curves ⋮ A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation ⋮ \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves ⋮ New versions of Miller-loop secured against side-channel attacks ⋮ Revisiting cycles of pairing-friendly elliptic curves ⋮ Finding composite order ordinary elliptic curves using the Cocks-Pinch method ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Dory: efficient, transparent arguments for generalised inner products and polynomial commitments ⋮ Unnamed Item ⋮ An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication ⋮ New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 ⋮ Algebraic curves and cryptography ⋮ Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree ⋮ On Cycles of Pairing-Friendly Elliptic Curves ⋮ Updating key size estimations for pairings ⋮ Provably secure non-interactive key distribution based on pairings ⋮ Generating more MNT elliptic curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ The complexity of class polynomial computation via floating point approximations ⋮ Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange ⋮ On bilinear structures on divisor class groups ⋮ A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ Faster Pairings on Special Weierstrass Curves ⋮ Group signatures with user-controlled and sequential linkability ⋮ Cryptographic Pairings Based on Elliptic Nets ⋮ Beta Weil pairing revisited ⋮ Improving the computation of the optimal ate pairing for a high security level ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant ⋮ Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings ⋮ Hardware implementation of multiplication over quartic extension fields ⋮ Elliptic curves suitable for pairing based cryptography ⋮ Adequate Elliptic Curves for Computing the Product of n Pairings

This page was built for publication: