Provably secure randomized blind signature scheme based on bilinear pairing

DOI10.1016/J.CAMWA.2010.01.021zbMath1198.94148OpenAlexW2040559662MaRDI QIDQ604080

Wei-Zhe Sun, Vincent Shi-Ming Huang, Chun-I Fan

Publication date: 8 November 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.01.021

zbMATH Keywords

cryptologyinformation securityblind signaturesbilinear pairingelectronic votingcoercion \& bribery

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

A chaotic maps-based authenticated key agreement protocol with strong anonymity

Cites Work

• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• The state of elliptic curve cryptography
• An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
• Receipt-free secret-ballot elections (extended abstract)
• ID-Based Blind Signature and Proxy Blind Signature without Trusted PKG
• A practical secret voting scheme for large scale elections
• ID-Based Blind Signature and Ring Signature from Pairings
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Provably secure randomized blind signature scheme based on bilinear pairing