On the relationship between squared pairings and plain pairings
From MaRDI portal
Publication:1045941
DOI10.1016/j.ipl.2005.11.005zbMath1191.68279MaRDI QIDQ1045941
Publication date: 18 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.11.005
68P25: Data encryption (aspects in computer science)
Related Items
Computing bilinear pairings on elliptic curves with automorphisms, Comparing two pairing-based aggregate signature schemes, On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient implementation of pairing-based cryptosystems
- Short signatures from the Weil pairing
- Efficient pairing computation on supersingular abelian varieties
- Identity-Based Encryption from the Weil Pairing
- Hyperelliptic Pairings
- Algorithmic Number Theory
- Selected Areas in Cryptography
- Cryptography and Coding
- Advances in Cryptology - ASIACRYPT 2003