Comparing two pairing-based aggregate signature schemes

DOI10.1007/s10623-009-9334-7zbMath1204.94064OpenAlexW2140685585MaRDI 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

zbMATH Keywords

pairing-based cryptographyaggregate signature schemes

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Related Items (max. 100)

More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ 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 ⋮ On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited ⋮ Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis ⋮ Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming

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

This page was built for publication: Comparing two pairing-based aggregate signature schemes