scientific article
From MaRDI portal
Publication:2739458
zbMath1029.94026MaRDI QIDQ2739458
Publication date: 9 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
AUTHENTICATED TRIPARTITE KEY AGREEMENT PROTOCOL USING DIGITAL SIGNATURE ALGORITHM, Boneh-Franklin IBE, Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem, Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves, Adaptive multiparty NIKE, Homomorphic encryption: a mathematical survey, Fine-grained non-interactive key-exchange: constructions and lower bounds, Secure-channel free certificateless searchable public key authenticated encryption with keyword search, Searchable encryption with randomized ciphertext and randomized keyword search, On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves, ON BOUNDS FOR BALANCED EMBEDDING DEGREE, Non-Interactive Key Exchange, New Constructions and Applications of Trapdoor DDH Groups, Algebraic curves and cryptography, Optimised Versions of the Ate and Twisted Ate Pairings, Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction, Multi-key Hierarchical Identity-Based Signatures, More Discriminants with the Brezing-Weng Method, A Brief History of Pairings, Lattice-Based SNARGs and Their Application to More Efficient Obfuscation, Pairing-based cryptography on elliptic curves, Efficient three-party authenticated key agreement protocol in certificateless cryptography, Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves, Faster Ate pairing computation on Selmer's model of elliptic curves, Structure-preserving signatures and commitments to group elements, Further refinements of Miller's algorithm on Edwards curves, Efficient hash maps to \(\mathbb{G}_2\) on BLS curves, On the near prime-order MNT curves, Multi-designated verifiers signatures: anonymity without encryption, Further refinement of pairing computation based on Miller's algorithm, A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption, Towards breaking the exponential barrier for general secret sharing, A comparison of MNT curves and supersingular curves, Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree, A survey on delegated computation, Cryptanalysis of tripartite and multi-party authenticated key agreement protocols, An ID-based authenticated dynamic group key agreement with optimal round, Algebraic generalization of Diffie-Hellman key exchange, On Near Prime-Order Elliptic Curves with Small Embedding Degrees, Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree, Provably secure and efficient certificateless authenticated tripartite key agreement protocol, Elligator Squared: Uniform Points on Elliptic Curves of Prime Order as Uniform Random Strings, A survey of fault attacks in pairing based cryptography, Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications, Implementing optimized pairings with elliptic nets, Provably secure identity-based authenticated key agreement protocols with malicious private key generators, Attribute-Based Broadcast Encryption Scheme Made Efficient, Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures, An improved two-party identity-based authenticated key agreement protocol using pairings, Polynomial approximation of bilinear Diffie-Hellman maps, Spreading alerts quietly and the subgroup escape problem, Cryptanalytic Flaws in Oh et al.’s ID-Based Authenticated Key Agreement Protocol, Security weaknesses of authenticated key agreement protocols, Solving discrete logarithms on a 170-bit MNT curve by pairing reduction, Faster pairing computation on genus \(2\) hyperelliptic curves, A round-optimal three-party ID-based authenticated key agreement protocol, Elliptic curve cryptography: the serpentine course of a paradigm shift, A new certificateless multiple key agreement scheme, Provably-secure time-bound hierarchical key assignment schemes, Reducing equational theories for the decision of static equivalence, Heuristics of the Cocks-Pinch method, Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme, Parallelizing pairings on Hessian elliptic curves, On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$, Security weaknesses of a signature scheme and authenticated key agreement protocols, An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication, Efficient selective identity-based encryption without random oracles, An XTR-based constant round key agreement scheme, On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings, Efficient algorithms for secure outsourcing of bilinear pairings, Authenticated Group Key Agreement Protocol Without Pairing, Secure and efficient delegation of elliptic-curve pairing, Fixed argument pairing inversion on elliptic curves, Computing discrete logarithms in \(\mathbb F_{p^6}\), Heuristics on pairing-friendly elliptic curves, An optimal Tate pairing computation using Jacobi quartic elliptic curves, Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five, Secure simultaneous bit extraction from Koblitz curves, Rogue-key attacks on the multi-designated verifiers signature scheme, Efficient identity-based authenticated key agreement protocol from pairings, Weakness in ID-based one round authenticated tripartite multiple-key agreement protocol with pairings, New identity-based society oriented signature schemes from pairings on elliptic curves, Comparing two pairing-based aggregate signature schemes, A pairing-based publicly verifiable secret sharing scheme, Multi-party authenticated key agreement protocols from multi-linear forms, The Function Field Sieve in the Medium Prime Case, Efficient algorithms for Koblitz curves over fields of characteristic three, A Provably Secure One-Pass Two-Party Key Establishment Protocol, Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax, Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms, A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$, On the embedding degree of reductions of an elliptic curve, Revisiting Pairing Based Group Key Exchange, Indiscreet logarithms in finite fields of small characteristic, Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis, An identity-based strongly unforgeable signature without random oracles from bilinear pairings, Lower Bounds on Assumptions Behind Indistinguishability Obfuscation, Pairings for cryptographers, An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks, Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening, Secure and Efficient Group Key Agreements for Cluster Based Networks, On bilinear structures on divisor class groups, Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification, Generating Pairing-Friendly Curves with the CM Equation of Degree 1, Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions, Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates, Public Verifiability from Pairings in Secret Sharing Schemes, Cryptographic Pairings Based on Elliptic Nets, Beta Weil pairing revisited, Using abelian varieties to improve pairing-based cryptography, Cryptanalysis of GGH15 Multilinear Maps, Koblitz curves over quadratic fields, Publicly Verifiable Secret Sharing for Cloud-Based Key Management, On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant, Direct chosen-ciphertext secure identity-based key encapsulation without random oracles, A self-pairing map and its applications to cryptography, A secure and scalable group key exchange system, Ephemeral-secret-leakage secure ID-based three-party authenticated key agreement protocol for mobile distributed computing environments, A group key agreement protocol from pairings, A Clustering-based Group Key Agreement Protocol for Ad-Hoc Networks
