Secure Certificateless Signature Scheme with Batch Verification from Bilinear Pairings

No abstract is available for this paper.

• Publication year

  2016

• Venue

  International Symposium on Security in Computing and Communications

• Publication date

  2016-09-21

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-981-10-2738-3_19
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Security models for certificateless signature schemes revisited

  2015cited by this paper
• Security Arguments for Digital Signatures and Blind Signatures

  2015cited by this paper
• Strongly Secure Certificateless Signature Scheme Supporting Batch Verification

  2014cited by this paper
• A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges

  2010cited by this paper
• Java Implementation for Pairing-Based Cryptosystems

  2010cited by this paper
• Batch Verification for Certificateless Signature Schemes

  2009cited by this paper
• Batch Verifications with ID-Based Signatures

  2004cited by this paper
• Certificateless Public Key Cryptography

  2003cited by this paper
• Efficient Algorithms for Pairing-Based Cryptosystems

  2002cited by this paper
• Fast Batch Verification for Modular Exponentiation and Digital Signatures

  1998cited by this paper
• Batch RSA

  1997cited by this paper
• Can D.S.A. be Improved? Complexity Trade-Offs with the Digital Signature Standard

  1994cited by this paper

• A secure and efficient certificateless batch verification scheme with invalid signature identification for the internet of things

  2020cites this paper