
	Where results make sense

Topic: Blind signature

Related Topics

Electronic voting

List of cryptography topics

Strait of Malacca

List of countries involved in World War II

	Blind signature -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-10-08)
		Blind signatures are used in a number of cryptographic protocols, including various election systems and (Click link for more info and facts about digital cash) digital cash schemes.
		An oft-used analogy to the cryptographic blind signature is the physical act of enclosing a message in an envelope, which is then sealed and signed by a signing agent.
		Blind signatures can also be used to provide unlinkability, which prevents the signer from linking the blinded message it signs to a later un-blinded version that it may be called upon to verify.
	www.absoluteastronomy.com /encyclopedia/b/bl/blind_signature.htm (633 words)

	Blind signature - Wikipedia, the free encyclopedia
		In cryptography, a blind signature is a form of digital signature in which the content of a message is disguised (blinded) before it is signed.
		Blind signatures are typically employed in privacy-related protocols where the signer and message author are different parties.
		Blind signature schemes can be implemented using a number of common public key signing schemes, for instance RSA and DSA.
	en.wikipedia.org /wiki/Blind_signature (592 words)

	Blind credential - Wikipedia, the free encyclopedia
		A blind credential is a token asserting that someone qualifies under some criteria or has some status or right, without revealing "who" that person is — without including their name or address, for instance.
		Electronic money requires some blind credential system to assert that the money is valid, and has not been already spent, and belongs to the individual or entity that is spending it.
		It is usually not wise to consider a blind credential outside of the Public Key Infrastructure of electronic identity guarantees required to support it.
	en.wikipedia.org /wiki/Blind_credential (159 words)

	Blind signature systems - Patent 4759063
		Thus, for example, signature transformation 102 may be regarded as a step in a method or part of an apparatus, and/or it may be regarded as a party, and it may be called signer 102 or signer party 102.
		Signature checker 105 is shown as taking its input from the output of unblinding transformation 104, line 159, and producing output 161, shown in the preferred embodiment as m.
		Thus, the blinding transformation 231 and 235 as well as the unblinding transformation 232 and 234 are each nearly the same as in the single key mode of of the preferred embodiment to be described in detail.
	www.freepatentsonline.com /4759063.html (10693 words)

	One-show blind signature systems - Patent 4914698
		Blind signatures are known in the art, as described in European Patent Publication 0139313, dated 2/5/85, claiming priority on U.S. Ser.
		In all these systems, there are essentially three parties: (1) the signature issuing party; (2) the plurality of parties to whom signatures are issued by the first party; and (3) the plurality of parties to whom the signatures are shown by the second parties.
		Instead of the particular blinding indicated, which is essentially that of the first mentioned blind signature publication, the techniques disclosed in the second mentioned blind signature publication could be used.
	www.freepatentsonline.com /4914698.html (5029 words)

	RSA Security - 7.3 What is a blind signature scheme?
		Blind signature schemes, first introduced by Chaum [Cha83] [Cha85], allow a person to get a message signed by another party without revealing any information about the message to the other party.
		Using RSA signatures (see Question 3.1.1), Chaum demonstrated the implementation of this concept as follows: Suppose Alice has a message m that she wishes to have signed by Bob, and she does not want Bob to learn anything about m.
		Blind signatures have numerous uses including timestamping (see Question 7.11), anonymous access control, and digital cash (see Question 4.2.1).
	www.rsasecurity.com /rsalabs/node.asp?id=2339 (313 words)

	[No title] (Site not responding. Last check: 2007-10-08)
		Blind signatures are, IMO, the key to anonymous digital cash, and in fact to many forms of anonymity.
		In the noninteractive signature, the challenge number c is calculated as a cryptographic hash function of the other numbers, and r is again shown based on c.
		The main things to take away are that the restrictive blinding does require some interaction with the signer in order to end up with a non-interactive signature, and that the limitations on the blinding which can be done are to take the signed number to a power and multiply it by some power of g.
	ganges.cs.tcd.ie /mepeirce/Project/Mlists/brands3.html (1384 words)

	Patents
		Such signatures allow an endorser to provide a public-key verifiable signature on a chosen message more efficiently than if the endorser were to make a public key signature, since the endorser needs only to perform conventional cryptographic operations and has to store less data per signature than required by previously known endorsement schemes.
		Abstract: Digital signature techniques are disclosed in which exponents may be selected by the message to be signed itself, by the signing party, by the party providing the message to the signing party for signature, and/or by a party to whom the signature is shown.
		Abstract: An improved blind signature system not requiring computation during blinding for anticipating which of a plurality of possible signatures will be made during signing, while still allowing the blinding party to unblind and recover the unanticipated kind of signature on what was blinded.
	www.chaum.com /patents.htm (2381 words)

	Achieving Electronic Privacy (Site not responding. Last check: 2007-10-08)
		Whereas the security of digital signatures is dependent on the difficulty of particular computations, the anonymity of blinded notes is limited only by the unpredictability of Alice's random numbers.
		The card verifies the blinding and the signature and checks the keys to make sure they were correctly generated.
		It passes the blinded, signed keys to the validating authority, which recognizes the observer's built-in signature, removes it and signs the blinded keys with its own key.
	ganges.cs.tcd.ie /mepeirce/Project/Chaum/sciam.html (4069 words)

	NEGATIVE – COUNTERPLAN – FREE MARKET – INDIVIDUALS WILL PROTECT 88 (Site not responding. Last check: 2007-10-08)
		The blind signature, created by David Chaum of Digicash, is an extension of the digital signature - the electronic equivalent of a handwritten signature.
		The blind signature is an extension of the digital signature but with one additional feature: it ensures the anonymity of the sender.
		Digital signatures are intended to be identifiable to serve as proof that a particular individual signed a particular document.
	debate.uvm.edu /handbookfile/pubpriv/088.html (557 words)

	Kryptographie FAQ: Frage 39: What is a Blind Signature Scheme? (Site not responding. Last check: 2007-10-08)
		Blind signature schemes, first introduced by Chaum [Cha83][Cha85], allow a person to get a message signed by another party without revealing any information about the message to the other party.
		Chaum demonstrated the implementation of this concept using RSA signatures (see Question 8) as follows: Suppose Alice has a message m that she wishes to have signed by Bob, and she does not want Bob to learn anything about m.
		Blind signatures have numerous uses including timestamping (see Question 108), anonymous access control, and digital cash (see Question 138).
	www.iks-jena.de /mitarb/lutz/security/cryptfaq/q39.html (294 words)

	David Pointcheval's Publications (Site not responding. Last check: 2007-10-08)
		In this paper, we give a provably secure design for blind signatures, the most important ingredient for anonymity in off-line electronic cash systems.
		Previous examples of blind signature schemes were constructed from traditional signature schemes with only the additional proof of blindness.
		The design of some of the underlying signature schemes can be validated by a proof in the so-called random oracle model, but the security of the original signature scheme does not, by itself, imply the security of the blind version.
	www.di.ens.fr /~pointche/pub.php?reference=PoSt96b (148 words)

	Two Improved Partially Blind Signature Schemes from Bilinear Pairings (ResearchIndex)
		Abstract: A blind signature scheme is a protocol for obtaining a signature from a signer, but the signer can neither learn the messages he/she sign nor the signatures the recipients obtain afterwards.
		One of the examples is the partially blind signature scheme introduced by Abe and Fujisaki.
		In addition, we also modify the ID-based blind signature scheme by Zhang and Kim elegantly to spawn an unlinkable partially blind signature scheme and an ID-based unlinkable partially blind signature scheme.
	citeseer.ist.psu.edu /chow04two.html (729 words)

	UBILAB: Fair Blind Signatures (Site not responding. Last check: 2007-10-08)
		A blind signature scheme is a protocol allowing to get a signature from a signer such that the signer's view of the protocol cannot be linked to the resulting message-signature pair.
		Blind signature schemes are used in anonymous digital payment systems.
		In this paper, a new type of blind signature schemes is proposed, called fair blind signature schemes.
	www.ubilab.org /publications/sta95.html (143 words)

	Q39: What is a Blind Signature Scheme? (Site not responding. Last check: 2007-10-08)
		The value m' is "blinded" by the random value r, and hence Bob can derive no useful information from it.
		Since s'=rmd mod n, Alice can obtain the true signature s of m by computing.
		There are potential problems if Alice can give an arbitrary message to be signed, since this effectively enables her to mount a chosen message attack.
	www.x5.net /faqs/crypto/q39.html (249 words)

	[No title]
		The blinding functions are usually based on a secret random number called the "blinding factor".
		The brilliance lies in step 3: Chaum discovered that some signatures have the property of being "commutative" with the blinding functions: Alice can strip off the blinding in the reverse order which the blinding and signature were applied, leaving just Alice's signature of n.
		MD5 is used for hashing and a technique based on RSA is used for blind signatures.
	www.cs.utk.edu /~ffowler/cns-html/append.html (1226 words)

	AT&T Labs Research - Technical Report Series - 98.38 Abstract (Site not responding. Last check: 2007-10-08)
		Probably the most successful application of blind signatures is electronic cash.
		In order to avoid multiple copies of the same electronic coin, one-time blind signatures are of particular importance, i.e., a recipient can obtain a signature for at most one message from each interaction with a signer.
		Here, we present the first restrictive blind signature scheme that is not one-time.
	www.research.att.com /resources/trs/TRs/98/98.38/98.38.1.abs.html (143 words)

	Money on the Internet - Ecash
		Because the bank does not know the blinding factor, it has no way of linking the coins issued during the user's original withdrawal to those that are finally deposited by a shop.
		The client software then recreates the exact same blinded coins that were used in previous withdrawals and resubmits them for signing by the bank.
		Based on public-key encryption and the blind signature scheme of Ecash a smartcard and an electronic "wallet" was designed, a pocket-calculator-like device that reads the card, displays its content on an LCD screen, and has an infrared interface for contact-less transfers - point-and-pay.
	waste.informatik.hu-berlin.de /Grassmuck/Texts/ecash.e.html (7355 words)

	CIS: Anonymity in Cryptographic Protocols (Site not responding. Last check: 2007-10-08)
		A group blind signature allows individual members of a possibly large group to digitally sign a message on behalf of the entire group in a cryptographically secure manner.
		In addition to being hard to forge, the resulting digital signatures are anonymous and unlinkable, and only a pre-specified group manager can determine the identity of the signer.
		Finally, the signatures have a blindness property, so if the signer later sees a message he has signed, he will not be able to determine when or for whom he signed it.
	theory.lcs.mit.edu /~cis/cis-anonymity.html (448 words)

	On the Security of Some Proxy Blind Signature Schemes - Sun, Hsieh (ResearchIndex) (Site not responding. Last check: 2007-10-08)
		Abstract: A proxy blind signature scheme is a digital signature scheme which combines the properties of proxy signature and blind signature schemes.
		Later, compared with Tan et al.'s scheme, Lal and Awasthi further proposed a more e#cient proxy blind signature scheme.
		On the security of some proxy blind signature schemes.
	citeseer.ist.psu.edu /654266.html (254 words)

	IJEC:v6n1 (Site not responding. Last check: 2007-10-08)
		This paper presents an efficient blind signature scheme under which information can be hidden in the signature and uncovered later for security purposes.
		When it is applied to an untraceable electronic cash system, cash owners are able to claim and identify lost cash; when applied to an anonymous electronic voting protocol, no election results are revealed until the entire voting process is finished.
		The additional computation for the proposed scheme, as compared with typical blind signatures, consists of just two hashing operations.
	www.gvsu.edu /business/ijec/v6n1/p093.html (101 words)

	Teacher Credential (Site not responding. Last check: 2007-10-08)
		The econcensus link is unhelpful on this point and needs considerable work in any case.
		Chaum has a technically elegant proposal in re this, but of course those with power to adopt/determine are color blind to quality design in these matters.
		Apropos of nothing WP -- have you heard about the Florida county (recall it was Florida which couldn't count its votes in 2000 (though others had trouble as well), and a century earlier in the Hayes/Tilden election) in which one candidate won by something like 12 votes.
	www.blownspeakers.com /pages3/87/teacher-credential.html (1183 words)

	[No title] (Site not responding. Last check: 2007-10-08)
		Efficient threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme
		Abstract: We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman problem is easy).
		Our constructions are based on the recently proposed GDH signature scheme of Boneh, Lynn and Shacham.
	www-cse.ucsd.edu /users/aboldyre/papers/b.html (142 words)

	The Matrix: .TXT: The Trouble With e-Cash
		A company based in the Netherlands, named DigiCash, holds patents that resolve most security concerns around e-cash using cryptographic techniques belonging to them.
		DigiCash's founder, David Chaum, worked on a form of cryptography which allows information to be encrypted using a combination of digital "signatures" and a process of authentication called a "blind signature."
		Simply put, this allows for the creation of unique serial numbers that can be verified by the bank issuing the currency, without revealing the identity of the money-holder.
	memex.org /troublewithecash.html (897 words)

	[No title]
		.·ó¨Digital Signature Algorithm (1) ÄAlgorithm : key generation select a prime q of 160bits Choose 0£ðt£ð8, select 2511+64t
		z&)ó¨DSA signature generation Algorithm Select a random integer k, 0
		{0,1}l (v1,v2,...vt) public, (k1,...kt) private. ¡¶&´& çÿçÿçÿçÿçÿ)ÀÈÀÈÀÈçÿÀÈçÿÀÈçÿ ÀÈçÿÀÈçÿ Àª4 * ó¨Merkle one-time signature ª NSign: message m of bitlength n Compute c, the bin representation of number of 0 s in m; w=mc=(a1a2...at) Determine the coordinate positions i1
	langevin.usc.edu /~xuhuad/slides/signature.ppt (173 words)

	David Pointcheval's Publications
		Security Arguments for Digital Signatures and Blind Signatures
		Twin Signatures: an Alternative to the Hash-and-Sign Paradigm
		The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme
	www.di.ens.fr /~pointche/pub.php (401 words)

Try your search on: Qwika (all wikis)