Comparing two pairing-based aggregate signature schemes
From MaRDI portal
Publication:970534
DOI10.1007/s10623-009-9334-7zbMath1204.94064MaRDI QIDQ970534
Edward Knapp, Darrel Hankerson, Sanjit Chatterjee, Alfred J. Menezes
Publication date: 19 May 2010
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-009-9334-7
94A60: Cryptography
14G50: Applications to coding theory and cryptography of arithmetic geometry
94A62: Authentication, digital signatures and secret sharing
Related Items
Rai-Choo! Evolving blind signatures to the next level, Sequential aggregate signatures with lazy verification from trapdoor permutations, Security of BLS and BGLS signatures in a multi-user setting, Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis, More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds, On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited, Short signatures from Diffie-Hellman: realizing almost compact public key, Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge, Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming, Subgroup Security in Pairing-Based Cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computable isomorphisms in efficient asymmetric pairing-based systems
- Pairings for cryptographers
- On the relationship between squared pairings and plain pairings
- Efficient pairing computation on supersingular abelian varieties
- Algorithms for Black-Box Fields and their Application to Cryptography
- The Eta Pairing Revisited
- The number field sieve for integers of low weight
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Integer Variable χ–Based Ate Pairing
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- Monte Carlo Methods for Index Computation (mod p)
- Discrete logarithms and local units
- The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
- Using number fields to compute logarithms in finite fields
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Pairing-Friendly Elliptic Curves of Prime Order
- Unrestricted Aggregate Signatures
- Implementing Cryptographic Pairings over Barreto-Naehrig Curves
- Algorithmic Number Theory
- Topics in Cryptology – CT-RSA 2005
- Information Security and Cryptology - ICISC 2005