Results 231 to 240 of about 232,677 (257)
Some of the next articles are maybe not open access.
Optimistic blinded-key signatures
IEEE First Symposium onMulti-Agent Security and Survivability, 2004, 2004If autonomous mobile agents are to be used in electronic commerce environments, they must be able to sign contracts and payment orders without the need to contact their owners. As agents execute in untrusted environments, it is assumed that any information they carry can be read by a malicious host; thus, it is unwise to include secrets, such as ...
L.C. Ferreira, R. Dahab
openaire +1 more source
Certificateless Partially Blind Signature
2012 26th International Conference on Advanced Information Networking and Applications Workshops, 2012Blind signatures play a central role in applications such as e-cash and e-voting systems, while partially blind signature is an even more applicable variant. This paper proposes a Certificate less Partially Blind Signature (CPBS) by laying its construction on bilinear pairings over Gap Diffie-Hellman (GDH) Group for solving the key escrow problem in ...
Jingwei Liu +3 more
openaire +1 more source
Round-Optimal Blind Signatures from Waters Signatures
2008We present a round-optimal blind signature scheme based on Waters' signature scheme. Our construction resembles that of Fischlin [10], but does not rely on generic non-interactive zero-knowledge proofs. In addition to a common reference string, our scheme requires a registered public key for the signer.
Kristian Gjøsteen, Lillian Kråkmo
openaire +1 more source
Blind Signature Schemes Based on Gost Signature
2006In this paper, the authors propose a generalized blind GOST signature scheme and three practical blind GOST signature schemes educed from the proposed generalized scheme by setting one of three parameters be a constant.
Zhenjie Huang, Yumin Wang
openaire +1 more source
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
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
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

