Results 261 to 270 of about 1,372,166 (300)
Some of the next articles are maybe not open access.
Fair Partially Blind Signatures
2010It is well-known that blind signature schemes provide full anonymity for the receiving user. For many real-world applications, however, this leaves too much room for fraud. There are two generalizations of blind signature schemes that compensate this weakness: fair blind signatures and partially blind signatures.
Markus Rückert, Dominique Schröder
openaire +1 more source
1984
A cryptographic system allows, in one exemplary use, a supplier (101) to cryptographically transform a plurality of messages responsive to secret keys; the transformed messages to be digitally signed by a signer (102); and the signed transformed messages returned to the supplier (101) to be transformed by the supplier (101), responsive to the same ...
openaire +1 more source
A cryptographic system allows, in one exemplary use, a supplier (101) to cryptographically transform a plurality of messages responsive to secret keys; the transformed messages to be digitally signed by a signer (102); and the signed transformed messages returned to the supplier (101) to be transformed by the supplier (101), responsive to the same ...
openaire +1 more source
Chinese Physics B, 2010
We present a new fair blind signature scheme based on the fundamental properties of quantum mechanics. In addition, we analyse the security of this scheme, and show that it is not possible to forge valid blind signatures. Moreover, comparisons between this scheme and public key blind signature schemes are also discussed.
Wang Tian-Yin, Wen Qiao-Yan
openaire +1 more source
We present a new fair blind signature scheme based on the fundamental properties of quantum mechanics. In addition, we analyse the security of this scheme, and show that it is not possible to forge valid blind signatures. Moreover, comparisons between this scheme and public key blind signature schemes are also discussed.
Wang Tian-Yin, Wen Qiao-Yan
openaire +1 more source
Efficient Identity-Based Signatures and Blind Signatures
2005In this paper, we first propose an efficient provably secure identity-based signature (IBS) scheme based on bilinear pairings, then propose an efficient identity-based blind signature (IBBS) scheme based on our IBS scheme. Assuming the intractability of the Computational Diffie-Hellman Problem, our IBS scheme is unforgeable under adaptive chosen ...
Zhenjie Huang, Kefei Chen, Yumin Wang
openaire +1 more source
Short Pairing-Free Blind Signatures with Exponential Security
IACR Cryptology ePrint Archive, 2022Stefano Tessaro, Chenzhi Zhu
semanticscholar +1 more source
Fair Blind Signatures Revisited
2007This paper presents a formal model for fair blind signature schemes and a provably secure scheme based on bilinear maps. A blind signature scheme is a protocol for obtaining a signature on a message which is unknown from the signer. Furthermore, the signer cannot link his transcript of a protocol to the resulting message-signature pair.
Emeline Hufschmitt, Jacques Traoré
openaire +1 more source
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures
IACR Cryptology ePrint Archive, 2022Vadim Lyubashevsky +2 more
semanticscholar +1 more source
An Improved Proxy Blind Signature Scheme
International Journal of Theoretical Physics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guo, Xi, Zhang, Jian-Zhong, Xie, Shu-Cui
openaire +1 more source
Rai-Choo! Evolving Blind Signatures to the Next Level
IACR Cryptology ePrint Archive, 2022L. Hanzlik, J. Loss, Benedikt Wagner
semanticscholar +1 more source
Round-Optimal Blind Signatures in the Plain Model from Classical and Quantum Standard Assumptions
IACR Cryptology ePrint Archive, 2021Shuichi Katsumata +3 more
semanticscholar +1 more source