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.
Filters
Fair quantum blind signatures
2010
Chinese Physics B
Preserved Fulltext
We present a new fair blind signature scheme based on the fundamental properties of quantum mechanics. ...
Moreover, comparisons between this scheme and public key blind signature schemes are also discussed. ...
Fair quantum blind signature scheme The presented fair quantum blind signature scheme includes four phases: initializing phase, signing phase, verifying phase and link-recovery phase. ...
doi:10.1088/1674-1056/19/6/060307
fatcat:nba7sqmvjfgrjgx66pfjlmw254
A Kind of Message-recoverable Fairness Blind Digital Signature Scheme
2011
Procedia 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 2017; you can also visit the original URL.
The file type is application/pdf.
Aiming at problems of current fairness blind digital signature schemes can not simultaneously guarantee completely fairness and can not recover message, the paper proposed a kind of message-recoverable ...
fairness blind signature scheme and analyzed its correctness, security and fairness. ...
The third scheme did not provide message recovery function. Aiming at this, we presented a kind of message-recoverable fairness blind signature scheme. ...
doi:10.1016/j.proeng.2011.08.393
fatcat:n2tysugc3rdwjmgalsam7gkfrm
Fair Blind Signatures
[chapter]
1995
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 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, a new type of blind signature schemes called fair blind signature schemes is proposed. ...
T w o types of fair blind signature schemes are distinguished and several realizations are presented. ...
Fair Blind Fiat-Shamir Signatures With fair-OTi we can now convert the signature scheme from Section 4.1 into a fair blind signature scheme of type I. Let us analyze the blindness of this scheme. ...
doi:10.1007/3-540-49264-x_17
fatcat:gxcxjpalebgbnm6nban47ht5lu
Fair Exchange of Digital Signatures using RSA-based CEMBS and Offline STTP
[article]
2009
arXiv
pre-print
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.
In the first protocol, the two main parties exchange their signatures on a common message. In the second protocol, the signatures are exchanged on two different messages. ...
It proposes new security protocols based on the "Certified Encrypted Message Being Signature" (CEMBS) by using RSA signature scheme. ...
If it is valid, B accepts the signature and the protocol terminates. Recovery sub-protocol steps 1. ...
arXiv:0912.3980v1
fatcat:yms2lod2tjbc5lqn334ubj2wxm
Identity-Based Blind Signature Scheme with Message Recovery
2017
International Journal of Electrical and Computer Engineering (IJECE)
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 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a new blind signature scheme with message recovery in the ID-based setting using bilinear pairings over elliptic curves. ...
<p>Blind signature allows a user to obtain a signature on a message without revealing anything about the message to the signer. ...
Their scheme has the message recovery property with less bandwidth. Zhang et al. [16] proposed a kind of message-recoverable fairness blind digital signature scheme in 2011. ...
doi:10.11591/ijece.v7i5.pp2674-2682
fatcat:d76rjui7uvexfcaurito7gy56i
Classification of signature-only signature models
2008
Science in China Series F Information 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 2012; you can also visit the original URL.
The file type is application/pdf.
Moreover, we find the three signature models, i.e., group-nominee signature, multi-nominee signature and threshold-nominee signature, are of great importance in light of our classification. ...
We introduce a set of criterions for classifying signature-only signature models. By the criterions, we classify signature models into 5 basic types and 69 general classes. ...
fair blind signature [?] ...
doi:10.1007/s11432-008-0086-1
fatcat:aclm6m4vgfgttjd47i7fbq7jue
A VANET privacy protection scheme based on fair blind signature and secret sharing algorithm
2017
Automatika
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 2019; you can also visit the original URL.
The file type is application/pdf.
KEYWORDS Vehicular ad hoc network; anonymous authentication; track; fair blind signature; secret sharing algorithm ...
In view of the above problems, this paper proposes a scheme based on fair blind signature and secret sharing algorithm. ...
Conclusion Aiming to protect privacy in VANET, this paper proposes a secure scheme based on fair blind signature and threshold secret sharing. ...
doi:10.1080/00051144.2018.1426294
fatcat:sffpwoisnzfp5kjeumqdhuhsxy
A Verifiable Multi-Authority Secret Election Allowing Abstention from Voting
2002
Computer journal
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 scheme uses a uniquely blind threshold signature scheme to get blind threshold electronic votes such that any voter can abstain from voting after the registration phase. ...
In this scheme, the computations among voters are independent and voters only have to send an anonymous message to the counter after the registration phase. ...
However, this approach cannot provide the message recovery capability. To verify the blind signature (r, s) on m without proper redundancy, one must send m along with (r, s) to the verifier. ...
doi:10.1093/comjnl/45.6.672
fatcat:sx5kmlvkaveknnnk27enzd3tla
Security of Electronic Payment Systems: A Comprehensive Survey
[article]
2017
arXiv
pre-print
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.
The evaluation of the Card-not-present transactions approaches including 3D Secure, 3D SET, SET/EMV and EMV/CAP, the impact of concept of Tokenization and the role of Blind Signatures schemes in electronic ...
Quantum Fair Blind Signatures in E-Payment The "quantum fair blind signature" introduced by [32] includes four steps: "initializing", "signing", "verifying" and "link-recovery" along with three default ...
Fair blind signature scheme introduced in [41] Type 1 : The "link-recovery protocol" permits the signer to determine the related "message-signature pair" and thereby the bank is able to determine the doubtful ...
arXiv:1701.04556v1
fatcat:cf7tocn2znda5btqk5ajdqex5m
Design and implementation of an efficient fair off-line e-cash system based on elliptic curve discrete logarithm problem
2002
Journal of Communications and Networks
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 naturally reduces message size by 85% compared with the original scheme and makes a smart card to store coins easily. Furthermore, we use the Baek et al.' ...
To the best of our knowledge, this is the first result to implement a fair off-line electronic cash system based on ECDLP with provable security. ...
They solved such problems via withdrawal atomicity, payment-delivery atomicity, and deposit atomicity in fair off-line e-cash schemes [17], [11] by using recovery, resolve, dispute handling protocols ...
doi:10.1109/jcn.2002.6596898
fatcat:x6zuhgtqxfe2jlai3bl5y7mwue
Secure Electronic Commerce
[chapter]
2000
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.
i and sets h 1 := g 1 i h 1 proof of knowledge of ix Message m = h 1 g 2 = g 1 In payments, payer has to know therefore blinding is restricted:
Key escrowing / key recovery x Time stamping of documents ...
x Message authentication: x Who created this message? x Digital signature: x Convince a third party about who created this message. ...
CAFE Phone Ticks x Efficient x 1 hash per "tick" x Approximates fair exchange of tick / value x Can be combined with any payment system x Only for high frequency payments to one payee + + + + + + ----- ...
doi:10.1007/978-3-540-44927-0_2
fatcat:qi5qytnklbdi7hdwn4zz55jbcm
Optimistic fair exchange of digital signatures
2000
IEEE Journal on Selected Areas in Communications
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 2018; you can also visit the original URL.
The file type is application/pdf.
We present a new protocol that allows two players to exchange digital signatures over the Internet in a fair way, so that either each player gets the other's signature, or neither player does. ...
A key feature of our protocol is that a player can always force a timely and fair termination, without the cooperation of the other player. ...
Suppose the two players hold signatures on agreed-upon messages. ...
doi:10.1109/49.839935
fatcat:24qtpaqseffbrifuahpts4tovi
Optimistic fair exchange of digital 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 2018; you can also visit the original URL.
The file type is application/pdf.
We present a new protocol that allows two players to exchange digital signatures over the Internet in a fair way, so that either each player gets the other's signature, or neither player does. ...
A key feature of our protocol is that a player can always force a timely and fair termination, without the cooperation of the other player. ...
Suppose the two players hold signatures on agreed-upon messages. ...
doi:10.1007/bfb0054156
fatcat:7w3psm4azjhorhvhmha67t6eha
Analysis of an Electronic Voting Protocol in the Applied Pi Calculus
[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 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we study a protocol commonly known as the FOO 92 scheme [12] , which works with blind signatures. ...
We model a known protocol for elections known as FOO 92 in the applied pi calculus, and we formalise three of its expected properties, namely fairness, eligibility, and privacy. ...
Digital signatures are modeled as being signatures with message recovery, i.e. the signature itself contains the signed message which can be extracted using the checksign function. ...
doi:10.1007/978-3-540-31987-0_14
fatcat:hndkcjjwzzbmrc3hxoqmpsjjfy
APOD: Anonymous Physical Object Delivery
[chapter]
2009
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 2012; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a fair delivery service system with guaranteed customer anonymity and merchant-customer unlinkability, with reasonable assumptions about the threat model. ...
blind (group) signatures. ...
a verification algorithm.Security Properties: Apart from Unforgeability, Blindness is the most important security property of blind signature schemes: S does not learn any information about the message ...
doi:10.1007/978-3-642-03168-7_12
fatcat:hbthjszt55fc5onqm6drr5bftu
« Previous
Showing results 1 — 15 out of 4,560 results