A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Short Signatures from the Weil Pairing
Journal of Cryptology
Group signatures with verifier-local revocation
Proceedings of the 11th ACM conference on Computer and communications security
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
New paradigms in signature schemes
New paradigms in signature schemes
On computable isomorphisms in efficient asymmetric pairing-based systems
Discrete Applied Mathematics
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Identity-based key agreement protocols from pairings
International Journal of Information Security
IEEE Transactions on Information Theory
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Designs, Codes and Cryptography
Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Practical Zero-Knowledge Proofs for Circuit Evaluation
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Flexible key exchange negotiation for wireless sensor networks
Proceedings of the fifth ACM international workshop on Wireless network testbeds, experimental evaluation and characterization
Synchronized aggregate signatures: new definitions, constructions and applications
Proceedings of the 17th ACM conference on Computer and communications security
A DAA scheme using batch proof and verification
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
Structure-preserving signatures and commitments to group elements
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Mediated traceable anonymous encryption
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Get shorty via group signatures without encryption
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Distributed private-key generators for identity-based cryptography
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
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
Shrinking the keys of discrete-log-type lossy trapdoor functions
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Identity based encryption: Progress and challenges
Information Security Tech. Report
Non-interactive multisignatures in the plain public-key model with efficient verification
Information Processing Letters
Additive combinatorics and discrete logarithm based range protocols
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Shorter verifier-local revocation group signature with backward unlinkability
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Chosen-ciphertext secure identity-based encryption from computational bilinear Diffie-Hellman
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
A DAA scheme requiring less TPM resources
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
Improved hidden vector encryption with short ciphertexts and tokens
Designs, Codes and Cryptography
Signatures resilient to continual leakage on memory and computation
TCC'11 Proceedings of the 8th conference on Theory of cryptography
A family of implementation-friendly BN elliptic curves
Journal of Systems and Software
Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
Designs, Codes and Cryptography
Commuting signatures and verifiable encryption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Public-key encryption with delegated search
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
A generalization of Verheul's theorem for some ordinary curves
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Optimal structure-preserving signatures in asymmetric bilinear groups
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Fair and abuse-free contract signing protocol from Boneh-Boyen signature
EuroPKI'10 Proceedings of the 7th European conference on Public key infrastructures, services and applications
The n-Diffie-Hellman problem and its applications
ISC'11 Proceedings of the 14th international conference on Information security
Non-interactive CDH-based multisignature scheme in the plain public key model with tighter security
ISC'11 Proceedings of the 14th international conference on Information security
Using sphinx to improve onion routing circuit construction
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
On the design and implementation of an efficient DAA scheme
CARDIS'10 Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Application
On the joint security of encryption and signature, revisited
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Efficient zero-knowledge arguments from two-tiered homomorphic commitments
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
CHECKER: on-site checking in RFID-based supply chains
Proceedings of the fifth ACM conference on Security and Privacy in Wireless and Mobile Networks
Optimal eta pairing on supersingular genus-2 binary hyperelliptic curves
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
ROTIV: RFID ownership transfer with issuer verification
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
Parallelizing the weil and tate pairings
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
On the efficient implementation of pairing-based protocols
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Designated confirmer signatures with unified verification
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Round-Optimal privacy-preserving protocols with smooth projective hash functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Computer Networks: The International Journal of Computer and Telecommunications Networking
Variants of waters' dual system primitives using asymmetric pairings
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
A (corrected) DAA scheme using batch proof and verification
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Group signatures with controllable linkability for dynamic membership
Information Sciences: an International Journal
Efficient two-move blind signatures in the common reference string model
ISC'12 Proceedings of the 15th international conference on Information Security
Oblivious transfer with hidden access control from attribute-based encryption
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Constant-Size structure-preserving signatures: generic constructions and simple assumptions
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
On the (im)possibility of projecting property in prime-order setting
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Implementing pairings at the 192-bit security level
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Improved broadcast encryption scheme with constant-size ciphertext
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
International Journal of Applied Cryptography
Efficient identity-based signcryption without random oracles
AISC '12 Proceedings of the Tenth Australasian Information Security Conference - Volume 125
Group-signature schemes on constrained devices: the gap between theory and practice
Proceedings of the First Workshop on Cryptography and Security in Computing Systems
| Hi-index | 0.04 |
Many research papers in pairing-based cryptography treat pairings as a ''black box''. These papers build cryptographic schemes making use of various properties of pairings. If this approach is taken, then it is easy for authors to make invalid assumptions concerning the properties of pairings. The cryptographic schemes developed may not be realizable in practice, or may not be as efficient as the authors assume. The aim of this paper is to outline, in as simple a fashion as possible, the basic choices that are available when using pairings in cryptography. For each choice, the main properties and efficiency issues are summarized. The paper is intended to be of use to non-specialists who are interested in using pairings to design cryptographic schemes.