Direct chosen ciphertext security from identity-based techniques
Proceedings of the 12th ACM conference on Computer and communications security
Security weakness in a three-party pairing-based protocol for password authenticated key exchange
Information Sciences: an International Journal
Information Sciences: an International Journal
A tapestry of identity-based encryption: practical frameworks compared
International Journal of Applied Cryptography
Constant-Round Authenticated Group Key Exchange with Logarithmic Computation Complexity
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Pairing Computation on Twisted Edwards Form Elliptic Curves
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Another Approach to Pairing Computation in Edwards Coordinates
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Computing pairings using x-coordinates only
Designs, Codes and Cryptography
RFID-based supply chain partner authentication and key agreement
Proceedings of the second ACM conference on Wireless network security
Asymmetric Group Key Agreement
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
An escrow-less identity-based group-key agreement protocol for dynamic peer groups
International Journal of Security and Networks
Faster Pairings on Special Weierstrass Curves
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
A new scheme of LBS privacy protection
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Identity-committable signatures and their extension to group-oriented ring signatures
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
NanoECC: testing the limits of elliptic curve cryptography in sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Restricted queries over an encrypted index with applications to regulatory compliance
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges
Information Sciences: an International Journal
Modeling leakage of ephemeral secrets in tripartite/group key exchange
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Identity-based authenticated asymmetric group key agreement protocol
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Optimal authenticated data structures with multilinear forms
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
A variant of Miller's formula and algorithm
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Dynamic asymmetric group key agreement for ad hoc networks
Ad Hoc Networks
Communication-efficient 2-round group key establishment from pairings
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Biometric cards with advanced signing system
International Journal of Biometrics
On the elliptic curves y2=x3-c with embedding degree one
Journal of Computational and Applied Mathematics
Provably secure one-round identity-based authenticated asymmetric group key agreement protocol
Information Sciences: an International Journal
Faster explicit formulas for computing pairings over ordinary curves
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Another elliptic curve model for faster pairing computation
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Computer Networks: The International Journal of Computer and Telecommunications Networking
A generalization of Verheul's theorem for some ordinary curves
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Redesigning group key exchange protocol based on bilinear pairing suitable for various environments
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Efficient pairing computation on Elliptic curves in Hessian form
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
FPGA implementation of pairings using residue number system and lazy reduction
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
HIBE with short public parameters without random oracle
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
An identity-based model for grid security infrastructure
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
An identity-based grid security infrastructure model
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
A method for efficient parallel computation of Tate pairing
International Journal of Grid and Utility Computing
Simple and efficient public-key encryption from computational diffie-hellman in the standard model
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Anonymous hierarchical identity-based encryption (without random oracles)
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Authenticated and communication efficient group key agreement for clustered ad hoc networks
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Developing efficient blinded attribute certificates on smart cards via pairings
CARDIS'10 Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Application
Pairing-Based cryptography at high security levels
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Bridging broadcast encryption and group key agreement
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Publicly verifiable secret sharing for cloud-based key management
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Group key agreement for secure group communication in dynamic peer systems
Journal of Parallel and Distributed Computing
Sufficient condition for ephemeral key-leakage resilient tripartite key exchange
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Enhanced authentication for commercial video services
Security and Communication Networks
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
An improved twisted ate pairing over KSS curves with k=18
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Faster pairing coprocessor architecture
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Simple and exact formula for minimum loop length in Atei pairing based on Brezing---Weng curves
Designs, Codes and Cryptography
| Hi-index | 0.00 |
In this paper we propose a three participants variation of the Diffie--Hellman protocol. This variation is based on the Weil and Tate pairings on elliptic curves, which were first used in cryptography as cryptanalytic tools for reducing the discrete logarithm problem on some elliptic curves to the discrete logarithm problem in a finite field.