Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Limits on the provable consequences of one-way permutations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On blind signatures and perfect crimes
Computers and Security
Revokable and versatile electronic money (extended abstract)
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
An efficient fair payment system
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Proactive public key and signature systems
Proceedings of the 4th ACM conference on Computer and communications security
Privacy vs. authenticity
Trustee-based tracing extensions to anonymous cash and the making of anonymous change
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Communications of the ACM
Digital Payment Systems with Passive Anonymity-Revoking Trustees
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
"Indirect Discourse Proof": Achieving Efficient Fair Off-Line E-cash
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Anonymity Control in E-Cash Systems
FC '97 Proceedings of the First International Conference on Financial Cryptography
Applying Anti-Trust Policies to Increase Trust in a Versatile E-Money System
FC '97 Proceedings of the First International Conference on Financial Cryptography
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Robust threshold DSS signatures
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Distributed provers with applications to undeniable signatures
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
SAC '98 Proceedings of the Selected Areas in Cryptography
Provably Secure Fair Blind Signatures with Tight Revocation
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Trustee Tokens: Simple and Practical Anonymous Digital Coin Tracing
FC '99 Proceedings of the Third International Conference on Financial Cryptography
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
A New type of ``Magic Ink'' Signatures - Towards Transcript-Irrelevant Anonymity Revocation
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Mini-Cash: A Minimalistic Approach to E-Commerce
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Marking: A Privacy Protecting Approach Against Blackmailing
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A Practical Approach Defeating Blackmailing
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Improved Magic Ink Signatures Using Hints
FC '99 Proceedings of the Third International Conference on Financial Cryptography
Anonymous traceable disclosure scheme using pairing over elliptic curve
InfoSecu '04 Proceedings of the 3rd international conference on Information security
Balancing auditability and privacy in vehicular networks
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Design and analysis of a lightweight certificate revocation mechanism for VANET
Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking
A practical system for globally revoking the unlinkable pseudonyms of unknown users
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Auditable privacy: on tamper-evident mix networks
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Fair partially blind signatures
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
| Hi-index | 0.00 |
The physical analog of "blind signatures" of Chaum is a document and a carbon paper put into an envelope, allowing the signer to transfer his signature onto the document by signing on the envelope, and without opening it. Only the receiver can present the signed document while the signer cannot "unblind" its signature and get the document signed. When an authority signs "access tokens", "electronic coins", "credentials" or "passports", it makes sense to assume that whereas the users can typically enjoy the disassociation of the blindly signed token and the token itself (i.e. anonymity and privacy), there may be cases which require "unblinding" of a signature by the signing authority itself (to establish what is known as "audit trail" and to "revoke anonymity" in case of criminal activity). This leads us to consider a new notion of signature with the following physical parallel: The signer places a piece of paper with a carbon paper on top in an envelope as before (but the document on the paper is not yet written). The receiver then writes the document on the envelope using magic ink, e.g., ink that is only visible after being "developed". Due to the carbon copy, this results in the document being written in visible ink on the internal paper. Then, the signer signs the envelope (so its signature on the document is made available). The receiver gets the internal paper and the signer retains the envelope with the magic ink copy. Should the signer need to unblind the document, he can develop the magic ink and get the document copy on the envelope. Note that the signing is not blinded forever to the signer. We call this new type of signature a magic ink signature. We present an efficient method for distributively generating magic ink signatures, requiring a quorum of servers to produce a signature and a (possibly different) quorum to unblind a signature. The scheme is robust, and the unblinding is guaranteed to work even if a set of up to a threshold of signers refuses to cooperate, or actively cheats during either the signing or the unblinding protocol. We base our specific implementation on the DSS algorithm. Our construction demonstrates the extended power of distributed signing.