A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Filters
Provably Secure Partially Blind Signatures
[chapter]
2000
Lecture Notes in Computer Science
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral conditions, or whatever) in the ...
We then give a formal proof of security in the random oracle model. Our approach also allows one to construct secure fully blind signature schemes based on a variety of signature schemes. ...
All in all, no provably secure and practical partially blind signature scheme has been publicly released. ...
doi:10.1007/3-540-44598-6_17
fatcat:yn5twwllkfd3xecd7ivziy4p24
A Provably Secure Restrictive Partially Blind Signature Scheme
[chapter]
2002
Lecture Notes in Computer Science
Subsequently, in work by Abe and Okamoto, a provably secure construction was proposed along with a formalised definition for partially blind schemes. ...
The concept of partially blind signatures was first introduced by Abe and Fujisaki. ...
It is this scheme (with d = 1 and n = 2) that Abe and Okamoto [3] use to construct a provably secure partially blind signature scheme. ...
doi:10.1007/3-540-45664-3_7
fatcat:ddxebscsojh7pleuyr44uanajm
Provably Secure Convertible User Designating Confirmer Partially Blind Signatures
2006
Informatica
This paper introduces a new concept of convertible user designating confirmer partially blind signature, in which only the designated confirmer (designated by the user) and the user can verify and confirm ...
We give a formal definition for it and propose a concrete provably secure scheme with a proof of security and a brief analysis of efficiency. ...
The first provably secure partially blind threshold signature scheme was proposed at Crypto2000 by Abe and Okamoto (2000) , followed by the Maitland and Boyd's provably secure restrictive partially blind ...
doi:10.15388/informatica.2006.142
fatcat:d7hifmqydbganfdasxcphxfwpy
An Efficient and Provably Secure Threshold Blind Signature
[chapter]
2002
Lecture Notes in Computer Science
We propose an efficient and provably secure threshold blind signature scheme based on Okamoto-Schnorr blind signature. ...
We prove that our scheme is to be as secure as Okamoto-Schnorr's blind signature scheme and more efficient than Juang et al.'s scheme [12] . ...
In this paper, we propose an efficient and provably secure threshold blind signature scheme and prove its security in the random oracle model. ...
doi:10.1007/3-540-45861-1_24
fatcat:3eyzyiigsbfdjdxzyfluevz6lq
Fair Partially Blind Signatures
[chapter]
2010
Lecture Notes in Computer Science
There are two generalizations of blind signature schemes that compensate this weakness: fair blind signatures and partially blind signatures. ...
In this work, we unify the previous well-studied models into a generalization, called fair partially blind signatures. ...
Then, we provide a provably secure instantiation from general assumption in Section 4.
Fair Partially Blind Signatures Notation. ...
doi:10.1007/978-3-642-12678-9_3
fatcat:bll4zd5bdjc2nhdar2v37uawfa
PairiPairing-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment Systemng-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment System
2019
JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES
A partially blind signature enables a signer to explicitly incorporate a pre-agreed common information into a blind signature without the loss of blindness property. ...
We compare our scheme to the well known existing identity-based partially blind signature schemes. ...
Abe and Okamoto [II] proposed provably secure partially blind signatures and provided a formal security definition for their scheme. ...
doi:10.26782/jmcms.2019.06.00036
fatcat:tx5bvi5nizegbhwjqdymeqstty
Strengthened security for blind signatures
[chapter]
1998
Lecture Notes in Computer Science
Last year, Stern and the author studied the security of blind signatures in this model. ...
We first defined appropriate notions of security for electronic cash purpose, then, we proposed the first efficient and provably secure schemes. ...
Using this model, we follow the study we made [23, 25] with the proposition of several provably secure blind signature schemes. ...
doi:10.1007/bfb0054141
fatcat:oh355ztw3beetffb5ekbubq2ni
Provably secure randomized blind signature scheme based on bilinear pairing
2010
Computers and Mathematics with Applications
This manuscript will present a blind signature scheme with randomization based on bilinear pairing primitives. ...
Blind signature is a well-known technique used to construct some advanced applications for the consideration of user privacy. ...
To the best of our knowledge, the proposed scheme is the first provably secure randomized blind signature scheme. ...
doi:10.1016/j.camwa.2010.01.021
fatcat:m4dztg2efjbexpfup7finwk3wm
An Efficient Proxy Blind Signcryption Scheme for IoT
2022
Computers Materials & Continua
We designed a light weight and secure proxy blind signcryption for multi-digital messages based on a hyperelliptic curve (HEC). ...
The designed scheme also has the desired authentication, unforgeability of warrants and/or plaintext, confidentiality, integrity, and blindness, respectively. ...
[43] developed a provable and secure proxy-signcryption scheme based on a standard model to improve the security service area. ...
doi:10.32604/cmc.2022.017318
fatcat:cxk7bvbvlvdwrjrfpwtiswfqlm
Improvement of Chen-Zhang-Liu's IRPB Signature Scheme
2010
Intelligent Information Management
Restrictive partially blind signatures incorporate the advantages of restrictive blind signatures and partially blind signatures, which play an important role in electronic commerce. ...
Recently, Chen-Zhang-Liu first proposed an ID-based restrictive partially blind (IRPB) signature from bilinear pairings. ...
Maitland and Boyd [4] first proposed a provably secure restrictive partially blind signature scheme, which satisfies the partial blindness and restrictive blindness. ...
doi:10.4236/iim.2010.29064
fatcat:5sbrcusgkvahzjuz2a57gqmbhe
An Efficient Certificateless Blind Signature Scheme in the Random Oracle Model
[chapter]
2014
Lecture Notes in Computer Science
The blind signature schemes are useful in some applications where the anonymity is a thorny issue. ...
In this paper, we put forward a secure and efficient CLBS scheme. We then illustrate that our new scheme is secure in the random oracle model. ...
However, to our best knowledge, little attention has been paid to the design of provably secure blind signature scheme in CL-PKC *3+. ...
doi:10.1007/978-3-662-44917-2_53
fatcat:hwymxgr55vdjblhqmaeyuh3z2i
ID-Based Restrictive Partially Blind Signatures
[chapter]
2005
Lecture Notes in Computer Science
Furthermore, we first propose an ID-based restrictive partially blind signature scheme, which is provably secure in the random oracle model. ...
Restrictive partially blind signatures incorporate the advantages of these two blind signatures. ...
Maitland and Boyd [16] first incorporated these two blind signatures and proposed a provably secure restrictive partially blind signature scheme, which satisfies the partial blindness and restrictive ...
doi:10.1007/11596981_17
fatcat:qrhtcfm5drfj7k233wljzcqi6a
ID-based restrictive partially blind signatures and applications
2007
Journal of Systems and Software
Furthermore, we first propose an ID-based restrictive partially blind signature scheme, which is provably secure in the random oracle model. ...
Restrictive partially blind signatures incorporate the advantages of these two blind signatures. ...
Maitland and Boyd [15] first incorporated these two blind signatures and proposed a provably secure restrictive partially blind signature scheme, which satisfies the partial blindness and restrictive ...
doi:10.1016/j.jss.2006.02.046
fatcat:semwt2mkxrfc5cgkfwunmx3rsa
Two Improved Partially Blind Signature Schemes from Bilinear Pairings
[chapter]
2005
Lecture Notes in Computer Science
In this paper, we propose a threshold partially blind signature scheme from bilinear pairings and an ID-based partially blind signature scheme, which are provably secure in the random oracle model. ...
Partially blind signature is a variant such that part of the message contains pre-agreed information (agreed by the signer and the signature requester) in unblinded form, while threshold blind signature ...
Partially blind signature was introduced in [1], together with a RSA-based scheme. This notion was formalized in [2] , a discrete-logarithm based scheme that is provably secure was also proposed. ...
doi:10.1007/11506157_27
fatcat:2f7ogolqzfdpphu2wrful6m3uq
Page 7005 of Mathematical Reviews Vol. , Issue 2002I
[page]
2002
Mathematical Reviews
Furthermore, we also give variants of the RC hash function that can output 192 and 256 bits, respectively.”
2002i:94056 94A62 Abe, Masayuki; Okamoto, Tatsuaki Provably secure partially blind signatures ...
Summary: “Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral conditions, or whatever ...
« Previous
Showing results 1 — 15 out of 1,004 results