October 2002 - cypherpunks-legacy

Hello cypherpunks, service_with a smile
by Arlene Bisch 31 Oct '02

31 Oct '02

URGENT MESSAGE, RESPONSE IS NEEDED: http://www.bosay3.com/ml/index.htm If you have debts and want to_refinance your home I guaruntee that I can do it fast and easy and your credit score doesn't matter! Please just fill out this form and I'll call you immediately. http://www.bosay3.com/ml/index.htm I have more credit programs than the large companies. You will not be dissappointed. Sincerely, Tom Lowery

1 0

*NEW***COPY ANY DVD TO CD**** hwlq
by Sallie 31 Oct '02

31 Oct '02

UNSUBSCRIBE AT THE BOTTOM --------------------------------------------------------------- Dear Subscriber/Member, You don't need to spend hundreds of dollars on a DVD burner to backup your DVD's! DVD Professional is the most technologically advanced method of DVD reproduction ever available and it's the only system you will need to create backups of your DVD's that will play in your home DVD player. Get it Today and you get: ------------------------------ + 70% off the Regular Price + Full Technical Support + Free Updates For more information, please visit their Web Site: http://www.xplatinum.net/specialoffer/ AOL USERS: <A HREF="http://www.xplatinum.net/specialoffer/" CLICK HERE</A> ---- [ REMOVE ] ------------------------------------------------- You are receiving this email as a subscriber to our mailing list. To remove yourself from this and related email lists click here: http://www.xplatinum.net/specialoffer/remove.htm hbmfvgggomrmolyrmpkf

1 0

LIESELOTTE'S pics 26501
by enabel0＠earthlink.com 31 Oct '02

31 Oct '02

1 0

Ticket of 2 to Bahamas. Dating site.
by Yanki Club 31 Oct '02

31 Oct '02

--------------------------------------------------------------------- ~~ Netflush Member Newsletter: October 30th 2002 ~~ --------------------------------------------------------------------- Signup and get access to singles. As a valued subscriber, check out this special offer. +--------------------------------------------------------+ Lover girls and Guys in your area. +--------------------------------------------------------+ Signup and get access to millions of singles. Join today to enter the Ticket of 2 to Bahamas Sweepstakes. http://www.netflush.com/client/yankeelist/20021030 +--------------------------------------------------------+ Singles, meet your dream love! +--------------------------------------------------------+ Interact with real people, girls and guys in your area. Click here: http://www.netflush.com/client/yankeelist/20021030 +--------------------------------------------------------+ Year end Sweepstakes: Ticket of 2 to Bahamas +--------------------------------------------------------+ Find singles in your area. Join today and enter Friendplay year end sweepstakes. http://www.netflush.com/client/yankeelist/20021030 ----------------------------------------------------- Subscription Information ----------------------------------------------------- You received this email because you signed up at one of Netflush's websites or you signed up with a party that has contracted with Netflush. To unsubscribe from the Netflush Rewards List, visit http://www.netflush.com/unsub/ To read Netflush privacy policy, visit Privacy Policy at http://www.netflush.com. The products and/or services advertised in this email are the sole responsibility of the advertiser, and questions about this offer should be directed to the advertiser. CID: trk.20021030.yankilist61242 cypherpunks(a)manifold.algebra.com ========================================================== (c) 2002 Netflush Publishing. All rights reserved.

1 0

Friendplay match making. Join and win prizes.
by Yanki Club 31 Oct '02

31 Oct '02

--------------------------------------------------------------------- ~~ Netflush Member Newsletter: October 30th 2002 ~~ --------------------------------------------------------------------- This is part of your freebie newsletter subscription. Signup and get access to singles. +--------------------------------------------------------+ Friendplay match making. Join and win! +--------------------------------------------------------+ Join Friendplay from now until December 15th and qualify to win ticket of 2 to Bahamas Sweepstakes. http://www.netflush.com/client/yankeelist/20021030 +--------------------------------------------------------+ Lover girls and Guys in your area. +--------------------------------------------------------+ Signup and get access to millions of singles. Join today to enter the Ticket of 2 to Bahamas Sweepstakes. http://www.netflush.com/client/yankeelist/20021030 +--------------------------------------------------------+ Single? Free dates in your area! +--------------------------------------------------------+ Post your profile, search your perfect match and start dating! http://www.netflush.com/client/yankeelist/20021030 ----------------------------------------------------- Subscription Information ----------------------------------------------------- You received this email because you signed up at one of Netflush's websites or you signed up with a party that has contracted with Netflush. To unsubscribe from the Netflush Rewards List, visit http://www.netflush.com/unsub/ To read Netflush privacy policy, visit Privacy Policy at http://www.netflush.com. The products and/or services advertised in this email are the sole responsibility of the advertiser, and questions about this offer should be directed to the advertiser. CID: trk.20021030.yankilist61242 cypherpunks(a)Algebra.COM ========================================================== (c) 2002 Netflush Publishing. All rights reserved.

1 0

UNSUBSCRIBE
by Mark Szewczul 31 Oct '02

31 Oct '02

__________________________________________________ HotJobs - Search new jobs daily now http://hotjobs.yahoo.com/

3 2

Re: patent free(?) anonymous credential system pre-print
by Adam Back 31 Oct '02

31 Oct '02

Some comments on this paper comparing efficiency, and functionality with Camenisch, Chaum, Brands. On Tue, Oct 29, 2002 at 11:49:21PM +0000, Jason Holt wrote: > http://eprint.iacr.org/2002/151/ > > It mentions how to use the blinding technique Ben Laurie describes > in his Lucre paper, which I don't think has been mentioned in the > formal literature, and also describes what I call a non-interactive > cut and choose protocol which is new AFAICT. Thanks again! - efficiency The non-interactive cut and choose protocol results in quite big messages in the issuing and showing protcols to attain good security. The user who wishes to cheat must create n/2 false attributes, and n/2 true attributes. (True attributes being the ones he will try to convince the CA are encoded in all the attributes). The user can in an offline fashion keep trying different combinations of false and true attributes until he finds one where the attributes selected for disclosure during issuing are the n/2 true attributes. Then in the showing protocol he can show the n/2 false attributes. But C(n,n/2) grows sub-exponentially and so the user has to for example encode 132 blinded hashed attributes to provide assurance of work factor of 2^128 to the CA. (C(132,66) ~ 2^128). Without looking in detail at what must be sent I presume each the issuing message for a single credential would be order of 10KB. Similar for the showing protocol. Computational efficiency is probably still better than Camenisch credentials despite the number of attribute copies which must be blinded and unblinded, but of course less efficient than Brands. - functionality The credentials have a relatively inefficient cut-and-choose based issuing and showing protocol. Brands has efficient issuing protocols which support offline showing. Chaum's basic offline credentials are based on interactive cut-and-choose, but there is an efficient variant [1]. As with Brands and Chaum's certificates if they are shown multiple times they are linkable. (Camenisch offers unlinkable multi-show but they are quite inefficient). The credentials can be replayed (as there is no credential private key, a trace of a credential show offers no defense against replay). Brands credentials have a private key so they can defend against this. (Chaum's credentials have the same problem). The credentials unavoidably leave the verifier with a transferable signed trace of the transaction. Brands credentials offer a zero-knowledge option where the verifier can not transfer any information about what he was shown. The credentials support selective disclosure of attributes, but only in a restricted sense. Attributes can be disclosed with AND connectives. However other connectives (OR, +, -, negation, and formulae) are not directly possible. Brands supports all of these. The credentials do not support lending deterence (there is no option to have a secret associated with a credential that must necessarily be revealed to lend the credential as with Brands). The credentials are not suitable for offline use because they offer no possibility for a secret (such as user identity, account number etc) to be revealed if the user spends more times than allowed. Most of these short-falls stem from the analogous short-falls in the Wagner blinding method they are based on. Of course (and the point of the paper) the credentials do offer over the base Wagner credentials (a restrictive) form of selective disclosure which the base credentials do not. On citations: > I've submitted a pre-print of my anonymous credential system to the > IACR ePrint server. Thanks to all of you who responded to the > questions I posted here while working on it. I'd love to hear > feedback from any and all before I sumbit it for publication; > particularly, I want to make sure I haven't forgotten to give proper > attribution for any previous work. Brands discusses the salted hash form of selective disclosure in his book [2], you might want to cite that. He includes some related earlier reference also. I reinvented the same technique before being aware of the Brands reference also -- it seems like an obvious construction for a limited hashing based form of selective disclosure. Adam -- [1] Niels Ferguson, "Single Term Off-Line Coins", eurocrypt 93. [2] Stefan Brands, "Rethinking Public Key Infrastructures and Digital Certificates; Building in Privacy", MIT Press, Aug 2000 viz p27: "Another attempt to protect privacy is for the CA to digitally sign (salted) oneway hashes of attributes, instead of (the concatenation of) the attributes themselves. When transacting or communicating with a verifier, the certificate holder can selectively disclose only those attributes needed. Lamport [244] proposed this hashing construct in the context of one-time signatures." --------------------------------------------------------------------- The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to majordomo(a)wasabisystems.com

1 0

Lose 22.5lbs in 3 weeks for FREE!
by Select Free Offers 31 Oct '02

31 Oct '02

At Last-- You can flush away excess Pounds and Inches BEFORE they attach to your body! FREE 30-DAY SUPPLY Lose up to 22.5lbs in the next 3 weeks CLICK HERE FOR DETAILS! No Crash Diets! No Painful Excercise! http://azjmp.com/az/ch.php?f=113&i=344 UNSUBSCRIBE INSTRUCTIONS: If you no longer wish to receive this newsletter, you can unsubscribe by going here: http://tilw.net/unsub.php?client=selectfree&msgid=30100200018 and entering your email address. TRCK:selectfree;fbskhusxqnv*plqghu!qhw;2;

1 0

RE: E-C Logix: current patent holder for the DigiCash patents?
by Myers Carpenter 31 Oct '02

31 Oct '02

I believe the two critical ones are (with exp dates): 4759064 Blind unanticipated signature systems (19 Jul 2005) 4759063 Blind signature systems (19 Jul 2005) I can't seem to find a database with who currently owns a patent. I suspect it doesn't exist, which is unfortunate, since it is we the people who have given the monopoly on this idea, but we can't find out *who* has that monopoly. myers On Wed, 2002-10-30 at 14:39, John.Winter(a)USPTO.GOV wrote: > FYI > A list of patents that reference digicash > > US 5999625 A USPAT Bellare, Mihir et al. > US 6205435 B1 USPAT Biffar, Peter > US 6047269 A USPAT Biffar, Peter > US 5903880 A USPAT Biffar, Peter C. > US 5870473 A USPAT Boesch, Brian Paul et al. > US 5878140 A USPAT Chaum, David > US 5781631 A USPAT Chaum, David > US 5712913 A USPAT Chaum, David > US 5956400 A USPAT Chaum, David et al. > US 5485520 A USPAT Chaum, David et al. > US 5796841 A USPAT Cordery, Robert A. et al. > US 6282522 B1 USPAT Davis, Virgil M. et al. > US 6021399 A USPAT Demers, Alan J. et al. > US 5952638 A USPAT Demers, Alan J. et al. > US 5857023 A USPAT Demers, Alan J. et al. > US 6138107 A USPAT Elgamal, Taher > US 5671279 A USPAT Elgamal, Taher > US 6378075 B1 USPAT Goldstein, Theodore C. et al. > US 6308270 B1 USPAT Guthery, Scott B. > US 6341353 B1 USPAT Herman, Gary et al. > US 6370543 B2 USPAT Hoffert, Eric M. et al. > US 6282549 B1 USPAT Hoffert, Eric M. et al. > US 5983176 A USPAT Hoffert, Eric M. et al. > US 5903892 A USPAT Hoffert, Eric M. et al. > US 5768391 A USPAT Ichikawa, Bryan K. > US 6446052 B1 USPAT Juels, Ari > US 5729594 A USPAT Klingman, Edwin E. > US 5839119 A USPAT Krsul, Ivan V. et al. > US 5848161 A USPAT Luneau, Greg et al. > US 6119229 A USPAT Martinez, Ronald et al. > US 6157966 A USPAT Montgomery, Michael A. et al. > US 6341351 B1 USPAT Muralidhran, N. et al. > US 5952639 A USPAT Ohki, Masayuki et al. > US 6314409 B1 USPAT Schneck, Paul B. et al. > US 5933498 A USPAT Schneck, Paul B. et al. > US 5903721 A USPAT Sixtus, Timothy > US 5999967 A USPAT Sundsted, Todd > US 6467685 B1 USPAT Teicher, Mordechai > US 6119946 A USPAT Teicher, Mordechai > US 5815665 A USPAT Teper, Jeffrey A. et al. > US 6415271 B1 USPAT Turk, James J. et al. > US 5983207 A USPAT Turk, James J. et al. > US 6272536 B1 USPAT van Hoff, Arthur A et al. > US 5919247 A USPAT Van Hoff, Arthur et al. > US 6267292 B1 USPAT Walker, Jay S. et al. > US 6263505 B1 USPAT Walker, Jay S. et al. > US 5949875 A USPAT Walker, Jay S. et al. > US 5949044 A USPAT Walker, Jay S. et al. > US 5956699 A USPAT Wong, Jacob Y. et al. > US 5937394 A USPAT Wong, Jacob Y. et al. > US 5913203 A USPAT Wong, Jacob Y. et al. > > /john > > -----Original Message----- > From: myers(a)maski.org [mailto:myers@maski.org] > Sent: Wednesday, October 30, 2002 1:33 PM > To: cypherpunks(a)lne.com > Subject: E-C Logix: current patent holder for the DigiCash patents? > > > While poking around the net today I think I might have come across the > new holders of the DigiCash patents, or at least a licensee. As far as > I find other sources about who owns the patents it went from > DigiCash -> eCash Technologies -> InfoSpace > I have not found evidence to link these people from InfoSpace. > > You can find it at http://www.e-clogix.com/ , but prepare to use "view > source" quite a bit if you aren't using IE. > > Some points of interest: > http://www.e-clogix.com/about.html > This appears to be a venture of a Todd Stinson in Lincoln, Nebraska > (you gotta love the photoshop hacked logo on the picture of the building). > The email > crystal(a)e-clogix.com bounced, and I have not attempted to call them. > > A response an editorial on ecash in Barron's published April 23, 2001 > (if anyone has the original please let me know) > http://www.e-clogix.com/editorials/barrons_rebuttal.html > > Interesting links that are 404: > Demo site: http://www.e-clogix.com/Bank/index.html > > Anyone know anyone involved in this? > > myers

1 0

Re: the police state vs. jury nullification
by Steve Schear 30 Oct '02

30 Oct '02

At 06:56 AM 10/30/2002 -0800, you wrote: >South Dakota measure backs 'nullification' - > >http://www.latimes.com/news/nationworld/nation/la-na-jury30oct30.story See also: http://www.ncpa.org/iss/leg/2002/pd082702b.html http://www.mapinc.org/drugnews/v02/n1591/a01.html?999 http://www.freecongress.org/commentaries/021016PW.asp

1 0