Provably secure randomized blind signature scheme based on bilinear pairing
type: Item
instance of: scholarly article
title: Provably secure randomized blind signature scheme based on bilinear pairing
zbMATH Open document ID: 1198.94148
author: Chun-I Fan
author: Wei-Zhe Sun
author: Vincent Shi-Ming Huang
publication date: 2010-11-08T00:00:00Z
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 5813937
zbMATH Keywords: blind signatures
zbMATH Keywords: bilinear pairing
zbMATH Keywords: electronic voting
zbMATH Keywords: coercion \& bribery
zbMATH Keywords: information security
zbMATH Keywords: cryptology
MaRDI profile type: Publication
full work available at URL: j.camwa.2010.01.021
OpenAlex ID: W2040559662
cites work: Receipt-free secret-ballot elections (extended abstract)
cites work: An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
cites work: A practical secret voting scheme for large scale elections
cites work: Q3671884
cites work: Q4934745
cites work: Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
cites work: ID-Based Blind Signature and Proxy Blind Signature without Trusted PKG
cites work: ID-Based Blind Signature and Ring Signature from Pairings
cites work: Q4450758
cites work: Q4536807
cites work: Q4364549
cites work: The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
cites work: Q4536269
cites work: The state of elliptic curve cryptography
cites work: Q4718481
DOI: 10.1016/J.CAMWA.2010.01.021
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 5813937