On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited

DOI10.1016/j.dam.2011.04.021zbMath1250.94031MaRDI QIDQ2275939

Sanjit Chatterjee, Alfred J. Menezes

Publication date: 10 August 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.04.021

zbMATH Keywords

elliptic curve cryptography; bilinear pairings

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis, Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption, Scalable Divisible E-cash, Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions, Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming, Zero-Knowledge Accumulators and Set Algebra, Practical Round-Optimal Blind Signatures in the Standard Model

Cites Work

• Unnamed Item
• Unnamed Item
• On computable isomorphisms in efficient asymmetric pairing-based systems
• Comparing two pairing-based aggregate signature schemes
• Pairings for cryptographers
• On the relationship between squared pairings and plain pairings
• Efficient implementation of pairing-based cryptosystems
• A one round protocol for tripartite Diffie-Hellman
• Short signatures from the Weil pairing
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Dynamic Fully Anonymous Short Group Signatures
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• The Eta Pairing Revisited
• Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
• Identity-based authenticated key agreement protocol based on Weil pairing
• On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
• The Uber-Assumption Family
• Identity-Based Encryption from the Weil Pairing
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Optimal Pairings
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Compact E-Cash
• Pairing-Friendly Elliptic Curves of Prime Order
• Hyperelliptic Pairings
• Topics in Cryptology – CT-RSA 2005
• Automata, Languages and Programming
• Cryptography and Coding