A one round protocol for tripartite Diffie-Hellman
From MaRDI portal
Publication:1772225
DOI10.1007/s00145-004-0312-yzbMath1070.94007OpenAlexW1998368731WikidataQ55952480 ScholiaQ55952480MaRDI QIDQ1772225
Publication date: 15 April 2005
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-004-0312-y
Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Tensors in computations, Predicate encryption supporting disjunctions, polynomial equations, and inner products, An improved affine equivalence algorithm for random permutations, Security weakness in a three-party pairing-based protocol for password authenticated key exchange, Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation, KCI-resilient anonymous wireless link-layer authentication protocols, Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs, Multi-input non-interactive functional encryption: constructions and applications, Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation, Individual discrete logarithm with sublattice reduction, Multiparty non-interactive key exchange and more from isogenies on elliptic curves, Hierarchical integrated signature and encryption. (or: key separation vs. key reuse: enjoy the best of both worlds), Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves, Wildcarded identity-based encryption, Provably secure one-round identity-based authenticated asymmetric group key agreement protocol, Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH, NIKE from affine determinant programs, Group key agreement for secure group communication in dynamic peer systems, An efficient eCK secure identity based two party authenticated key agreement scheme with security against active adversaries, Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks, Simplified small exponent test for batch verification, RNS arithmetic in 𝔽 pk and application to fast pairing computation, An algebraic framework for Diffie-Hellman assumptions, Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions, On Cycles of Pairing-Friendly Elliptic Curves, On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one, On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited, Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials, Pairing Computation on Twisted Edwards Form Elliptic Curves, A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges, How to Avoid Obfuscation Using Witness PRFs, Communication-Efficient 2-Round Group Key Establishment from Pairings, Computing pairings using \(x\)-coordinates only, Asymmetric Group Key Agreement, Refined analysis to the extended tower number field sieve, Faster Pairings on Special Weierstrass Curves, Koblitz curves over quadratic fields, Publicly Verifiable Secret Sharing for Cloud-Based Key Management, Sender dynamic, non-repudiable, privacy-preserving and strong secure group communication protocol, Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves, Another Approach to Pairing Computation in Edwards Coordinates, Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves, Authenticated asymmetric group key agreement based on certificateless cryptosystem, The multiple number field sieve for medium- and high-characteristic finite fields
