Comparing two pairing-based aggregate signature schemes
DOI10.1007/S10623-009-9334-7zbMATH Open1204.94064OpenAlexW2140685585MaRDI QIDQ970534FDOQ970534
Authors: Sanjit Chatterjee, Darrel Hankerson, Edward Knapp, Alfred 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
Recommendations
- Unrestricted Aggregate Signatures
- Security of BLS and BGLS signatures in a multi-user setting
- Cryptology and Network Security
- Identity based aggregate signcryption schemes
- Information Security and Cryptology
- Universal signature aggregators
- Novel efficient certificateless aggregate signatures
- How to aggregate the CL signature scheme
Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Monte Carlo Methods for Index Computation (mod p)
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Efficient Identity-Based Encryption Without Random Oracles
- Pairing-Friendly Elliptic Curves of Prime Order
- Algorithmic Number Theory
- Title not available (Why is that?)
- Efficient pairing computation on supersingular abelian varieties
- Title not available (Why is that?)
- The Eta Pairing Revisited
- Integer Variable χ–Based Ate Pairing
- Implementing Cryptographic Pairings over Barreto-Naehrig Curves
- Pairings for cryptographers
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- Unrestricted Aggregate Signatures
- Title not available (Why is that?)
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Implementing cryptographic pairings
- On the relationship between squared pairings and plain pairings
- Topics in Cryptology – CT-RSA 2005
- Using number fields to compute logarithms in finite fields
- On computable isomorphisms in efficient asymmetric pairing-based systems
- Algorithms for black-box fields and their application to cryptography
- The number field sieve for integers of low weight
- Title not available (Why is that?)
- Discrete logarithms and local units
- The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
- Information Security and Cryptology - ICISC 2005
Cited In (14)
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- Subgroup security in pairing-based cryptography
- Short signatures from Diffie-Hellman: realizing almost compact public key
- A comparison of MNT curves and supersingular curves
- On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
- Information Security and Cryptology
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
- Sequential aggregate signatures with lazy verification from trapdoor permutations
- Rai-Choo! Evolving blind signatures to the next level
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Generalised asynchronous remote key generation for pairing-based cryptosystems
- Security of BLS and BGLS signatures in a multi-user setting
This page was built for publication: Comparing two pairing-based aggregate signature schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970534)
