On blind signatures and perfect crimes

  title={On blind signatures and perfect crimes},
  author={Sebastiaan H. von Solms and David Naccache},
  journal={Comput. Secur.},

Security Analysis of User Efficient Blind Signatures

Blind signature schemes allow a person to get a message signed by another party without revealing any information about the message to the other party. To believe the message contains a certain form,

New ID-based Fair Blind Signatures

This paper is proposing some identity based fair blind signatures, a cryptographic primitive in which a user can obtain a signature from the signer without revealing any information about message signature pair.

Fair Blind Signatures

A new type of blind signature schemes called fairblind signature schemes is proposed, which have the additional property that a trusted entity can deliver information allowing the signer to link his view of the protocol and the message-signature pair.

Message Recovery Fair Blind Signature

A new fair blind signature based on the oblivious transfer protocol, with which a judge can verify its fairness is proposed, which additionally provides the role of message recovery in the blind multi-signature applications.

Fair Partially Blind Signatures

This work unify the previous well-studied models into a generalization, called fair partially blind signatures, and proposes an instantiation that is secure in the standard model without any setup assumptions, giving a positive answer to the open question of whether fair blind signature schemes in thestandard model exist.

ID-Based Distributed "Magic Ink" Signature from Pairings

An ID-based (n, n) threshold “magic ink" signature is proposed along with its analysis and application, which provides a revocable anonymity solution and has some capability to revoke a blind signature to investigate the original user in case of abnormal activity, while keeping the legal user’s privacy anonymous.

Accountable Ring Signatures: A Smart Card Approach

An important advantage of ring signatures over group signatures is that there is no need to pre-specify rings or groups of users.

Fair blind threshold signatures in wallet with observers

Provably Secure Blind Signature Schemes

This paper proposes a definition of security for blind signatures, with application to electronic cash, and focuses on a specific example which can be successfully transformed in a provably secure blind signature scheme.

A User Efficient Fair Blind Signature Scheme for Untraceable Electronic Cash

A user efficient fair blind signature scheme which makes it possible for a government or a judge to recover the link between a signature and the instance of the signing protocol which produces that signature when the unlinkability property is abused is proposed.



Untraceable Electronic Cash

An electronic cash protocol including the steps of using a one-way function f1 to generate an image f1 (x1) from a preimage x1 and receiving from the second party a note including a digital signature.

Security without identification: transaction systems to make big brother obsolete

The large-scale automated transaction systems of the near future can be designed to protect the privacy and maintain the security of both individuals and organizations.

Designing and implementation of a new security model

The original protection graph rewriting grammar used to simulate the different operations of the Take/Grant model is reviewed. The productions of the PGR-grammar is then expanded, by adding a new

Solms is Professor and Head of the Department of Computer Science at the Rand Afrikaans University in Johannesburg

  • 1989