Results 1 to 10 of about 28,350 (257)
Two Improved Partially Blind Signature Schemes from Bilinear Pairings [PDF]
Key words: threshold partially blind signature, identity-based partially blind signature, bilinear ...
Sherman S M Chow, Lucas C K Hui, S M Yiu
exaly +4 more sources
Cryptanalysis and improvement of a certificateless partially blind signature
Partially blind signature is an important technique in secure electronic cash (e‐cash) system. The first concrete certificateless partially blind signature (CLPBS) scheme for e‐cash was constructed in 2011. Recently it was found that this construction had a security weakness and a rescued scheme was given.
Qiaoyan Wen
exaly +3 more sources
A new lattice-based partially blind signature with more complete proof
Partially blind signatures are introduced on the basis of blind signatures, which not only retain the advantages of blind signatures, but also solve the contradiction between anonymity and controllability in blind signatures.
Juntao Gao, Xuelian Li
exaly +3 more sources
The Abe-Okamoto Partially Blind Signature Scheme Revisited [PDF]
Partially blind signatures, an extension of ordinary blind sig- natures, are a primitive with wide applications in e-cash and electronic voting. One of the most efficient schemes to date is the one by Abe and Okamoto (CRYPTO 2000), whose underlying idea — the OR-proof technique — has served as the basis for several works.
Julia Kastner, J. Loss, Jiayu Xu
semanticscholar +5 more sources
CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist. [PDF]
In this paper, we construct the first provably-secure isogeny-based (partially) blind signature scheme. While at a high level the scheme resembles the Schnorr blind signature, our work does not directly follow from that construction, since isogenies do ...
Katsumata S, Lai YF, LeGrow JT, Qin L.
europepmc +2 more sources
A New Framework For More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling [PDF]
Blind signatures, proposed by Chaum (CRYPTO\u2782), are interactive protocols between a signer and a user, where a user can obtain a signature without revealing the message to be signed. Recently, Hauck et al.
R. Pino, Shuichi Katsumata
semanticscholar +2 more sources
A lattice-based partially blind signature
AbstractBlind signature is a crucial technique to provide anonymity in many information systems such as e‐cash, e‐voting, and smart grid systems. Partially blind signature is a more applicable extension where the part of the message includes some common information known by the signer and the signature requestor. In the family of lattice‐based schemes,
Haibo Tian, Fangguo Zhang, Baodian Wei
semanticscholar +2 more sources
Efficient Blind and Partially Blind Signatures Without Random Oracles [PDF]
This paper proposes a new efficient signature scheme from bilinear maps that is secure in the standard model (i.e., without the random oracle model). Our signature scheme is more effective in many applications (e.g., blind signatures, group signatures, anonymous credentials etc.) than the existing secure signature schemes in the standard model such as ...
Tatsuaki Okamoto
openaire +3 more sources
new randomized partially blind signature scheme [PDF]
The existing partially blind signature schemes rarely consider the random,and had less strict proof on random. Based on bilinear pairings and elliptic curve discrete logarithm problem,this article proposes a new randomized partially blind signature ...
Xinghua Zhang
semanticscholar +2 more sources
Leakage‐resilient lattice‐based partially blind signatures [PDF]
Blind signature schemes (BSS) play a pivotal role in privacy‐oriented cryptography. However, with BSS, the signed message remains unintelligible to the signer, giving them no guarantee that the blinded message he signed actually contained valid information. Partially BSS (PBSS) were introduced to address precisely this problem.
Dimitrios Papachristoudis +3 more
core +5 more sources

