Results 251 to 260 of about 20,320 (295)
Non-Interactive Blind Signatures: Post-Quantum and Stronger Security [PDF]
Lecture Notes in Computer ScienceBlind signatures enable a receiver to obtain signatures on messages of its choice without revealing any message to the signer. Round-optimal blind signatures are designed as a two-round interactive protocol between a signer and receiver.
Baldimtsi Foteini
exaly +2 more sources
Practical Round-Optimal Blind Signatures in the Standard Model [PDF]
Lecture Notes in Computer Science, 2015 Round-optimal blind signatures are notoriously hard to construct in the stan-dard model, especially in the malicious-signer model, where blindness must hold un-der adversarially chosen keys. This is substantiated by several impossibility results.
Daniel Slamanig +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An Efficient ID Based Proxy Signature, Proxy Blind Signature and Proxy Partial Blind Signature
2008 International Conference on Information Technology, 2008Identity-based (ID based) public key cryptosystem gives an efficient alternative for key management as compared to certificate based public key settings. A proxy signature is a method for an entity to delegate signing capabilities to other participants so that they can sign on behalf of the entity with in a given context.
Banshidhar Majhi +2 more
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
On the Complexity of Blind Signatures
2010Blinde Signaturen ähneln einem Briefumschlag, der aus Kohlepapier besteht. Der Sig- nierer (Sender) unterschreibt dabei auf diesem Kohlepapier, ohne das im Briefumschlag liegende Dokument zu sehen. Danach erhält der Empfänger den Briefumschlag und somit die unterschriebene Nachricht.
openaire +2 more sources
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
Boosting the Security of Blind Signature Schemes
2021Existing blind signature schemes that are secure for poly- nomially many concurrent executions of the signing protocol are either inefficient or rely on non-standard assumptions (even in the random-oracle model). We show the first efficient blind signature schemes achieving this level of security based on the RSA, factoring, or discrete-logarithm ...
Jonathan Katz +2 more
openaire +2 more sources
A Blind Signature Protocol with Exchangeable Signature Sequence
International Journal of Theoretical Physics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
Unconditionally Secure Blind Signatures
2009The blind signature scheme introduced by Chaum allows a user to obtain a valid signature for a message from a signer such that the message is kept secret for the signer. Blind signature schemes have mainly been studied from a viewpoint of computational security so far. In this paper, we study blind signatures in unconditional setting.
Yuki Hara +3 more
openaire +1 more source