A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient Blind and Partially Blind Signatures Without Random Oracles
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
This paper proposes a new ecient signature scheme from bilinear maps that is secure in the standard model (i.e., without the random oracle model). ...
Here, partially blind signatures are a generalization of blind signatures (i.e., blind signatures are a special case of partially blind signatures) and have many applications including electronic cash ...
We assume that A forges the blind signature scheme with non-negligible (in n) probability and breaks the binding condition of commit with negligible (in n) probability . ...
doi:10.1007/11681878_5
fatcat:uq5rukhfcraafldkx7rt55y46a
ID-Based Partially Blind Signatures: A Scalable Solution to Multi-Bank E-Cash
2009
2009 International Conference on Signal Processing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The signatures are shown secure in the random oracle model. ...
In this paper, we propose a practical ID-based (partially) blind signature scheme. Our scheme combines the already existing notions of blind signatures and identity-based cryptography. ...
Acknowledgment and Disclaimer This paper is partly supported by the Chinese NSF project 60673071 and by the Spanish Government through projects CONSOLIDER INGENIO 2010 CSD2007-00004 "ARES" and TSI2007- ...
doi:10.1109/icsps.2009.121
fatcat:vpvzlubmhzdm7pyrwkq7oaaa3e
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
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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. ...
In order to improve the efficiency, in this paper, we propose a new pairing free partially blind signature scheme with message recovery in the identity-based frame work. ...
The partially blind signature schemes, thus play a crucial role in designing an efficient and secure e-cash payment. ...
doi:10.26782/jmcms.2019.06.00036
fatcat:tx5bvi5nizegbhwjqdymeqstty
Concurrent Blind Signatures Without Random Oracles
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We present a blind signature scheme that is efficient and provably secure without random oracles under concurrent attacks utilizing only four moves of short communication. ...
Our construction is the first efficient construction for blind signatures in such a concurrent model without random oracles. ...
Acknowledgement We thank one of the reviewers of Eurocrypt 2006 for pointing out a flaw in the design of a previous version of our blind signature protocol. ...
doi:10.1007/11832072_4
fatcat:pbfh7ie6pjd3hci2lpvhb2zpcy
A New Certificateless Blind Signature Scheme
2014
Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
chosen-target CDH problem in the random oracle model. ...
Therefore in this paper we propose a new efficient provably secure certificateless blind signature scheme whose security can be proven to be equivalent to solving computational Diffie-Hellman (CDH) and ...
We use ideas of the aforementioned papers effectively and constructed a new efficient certificateless blind signature. ...
doi:10.22667/jowua.2014.03.31.122
dblp:journals/jowua/JoseGP14
fatcat:3dbjvtwbzbcbpday35za4s2jy4
Improved Self-certified Partially Blind Signature Scheme
2012
International journal of computer and communication technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
s scheme and also meets the aspects of security features needed by a partial blind signature. ...
Blind signature allows one user to get a signature without giving the signer any information about the actual message or the resulting signature. ...
signing oracle S Ο and the random oracle H Ο . ...
doi:10.47893/ijcct.2012.1130
fatcat:xt73jjhzifhbnbiqh7b2lmjlu4
A Short Paper on Blind Signatures from Knowledge Assumptions
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
There are known efficient blind signature schemes based on the random oracle model and on the common reference string model. ...
We present a blind signature scheme that is two-move, setup-free and comparable in terms of efficiency with the results of Fuchsbauer et al. Its security is based on a knowledge assumption. ...
Miros law Kuty lowski and the FC's anonymous reviewers for their valuable comments on this short paper. ...
doi:10.1007/978-3-662-54970-4_31
fatcat:zsuga2cwmjf5rhpuctp5vphode
Two Improved Partially Blind Signature Schemes from Bilinear Pairings
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
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 ...
Fangguo Zhang for pointing out the mistake of the preliminary version of this paper (by showing a changing agreed information attack on the scheme) and all the anonymous reviewers for their helpful comments ...
doi:10.1007/11506157_27
fatcat:2f7ogolqzfdpphu2wrful6m3uq
Fair Partially Blind Signatures
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
There are two generalizations of blind signature schemes that compensate this weakness: fair blind signatures and partially blind signatures. ...
In partially blind signature schemes, the signer retains a certain control over the signed message because signer and user have to agree on a specific part of the signed message. ...
They are indebted to one particular reviewer who provided exceptionally detailed comments and helped in improving the presentation as well as eliminating inconsistencies. ...
doi:10.1007/978-3-642-12678-9_3
fatcat:bll4zd5bdjc2nhdar2v37uawfa
Practical Round-Optimal Blind Signatures in the Standard Model
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We then show how to extend our construction to partially blind signatures and to blind signatures on message vectors, which yield a construction of one-show anonymous credentialsà la "anonymous credentials ...
We present a construction of practically efficient round-optimal blind signatures in the standard model. ...
The latter [Oka06] proposed an efficient construction for nonround-optimal blind as well as partially blind signatures in the standard model. ...
doi:10.1007/978-3-662-48000-7_12
fatcat:qkhhfijxavbalpg3f3nrp34sge
Provably secure randomized blind signature scheme based on bilinear pairing
2010
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Various generic ideas and variants on blind signatures have been brought up so far, but few of them considered the randomization property or offered formal proofs. ...
This manuscript will present a blind signature scheme with randomization based on bilinear pairing primitives. ...
How to design a more efficient and provably secure randomized blind signature scheme is an interesting and non-trivial research topic. ...
doi:10.1016/j.camwa.2010.01.021
fatcat:m4dztg2efjbexpfup7finwk3wm
New Certificateless Blind Ring Signature Scheme
2014
TELKOMNIKA Indonesian Journal of Electrical Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A new certificateless blind ring signature scheme was proposed in this paper. ...
In the last, by using bilinear pairing technique, it was proved that this scheme satisfied the security of existential unforgeability, blindness and unconditional anonymity. ...
Conclusion In this paper, we propose a concrete construction of certificateless blind ring signature scheme based on bilinear pairings in the random oracle model, which is more efficient by precomputing ...
doi:10.11591/telkomnika.v12i1.3382
fatcat:vsz4lzyjurdy7lrej3vkls4npq
Provably Secure Convertible User Designating Confirmer Partially Blind Signatures
2006
Informatica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
Since Abe and Fujisaki (1996) had introduced partially blind signature in 1996, several partially blind signature schemes have been proposed. ...
doi:10.15388/informatica.2006.142
fatcat:d7hifmqydbganfdasxcphxfwpy
Strengthened security for blind signatures
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Last year, Stern and the author studied the security of blind signatures in this model. ...
More recently, a new approach to achieve some kind of provable security was explored using the so-called "random oracle model". ...
Blind Signatures After this presentation of the random oracle model, we review an important cryptographic primitive: blind signatures. We first motivate their use and give some well-known examples. ...
doi:10.1007/bfb0054141
fatcat:oh355ztw3beetffb5ekbubq2ni
Sub-linear Blind Ring Signatures without Random Oracles
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In [53] , the authors presented a static blind ring signature scheme that requires both random oracles and the generic group model. ...
All the existing blind ring signature schemes [18, 53, 37, 54] require random oracles. ...
Acknowledgements This work was supported by ERC Advanced Grant ERC-2010-AdG-267188-CRIPTO and EPSRC via grant EP/H043454/1. ...
doi:10.1007/978-3-642-45239-0_18
fatcat:ccb2y7xkunhirdnrel3s5bksdi
« Previous
Showing results 1 — 15 out of 1,375 results