December 2003 - cypherpunks-legacy

RC1 and RC3 ??
by Nobuki Nakatuji 17 Dec '03

17 Dec '03

Why doesn't it have RC1 and RC3 though there are RC2, RC4 and RC5 of RSADSI RC series ? ______________________________________________________ Get Your Private, Free Email at http://www.hotmail.com

2 1

$50 encryption policy contest
by Dr. Alan Sherman 17 Dec '03

17 Dec '03

$50 www Contest I will pay $50 to the best www page created by 12noon EST, February 15, 1998, meeting the enclosed specifications. In short, the page must have a form through which anyone may enter a question, which will be automatically entered onto a list of submitted questions displayed on another page. I will use the winning entry to collect questions for the upcoming March 6 talk on encryption policy by Barry Smith (FBI). How to enter: email a url of your entry to sherman(a)cs.umbc.edu include the phrase "Barry Smith Contest Entry" in the subject header. All URL's for all entries will be listed from http://www.cs.umbc.edu/events/spring98/crypto2.shtml Rules: 1. The page must work from the CMSC computing environment, but initial judging will take place on the designer's server. 2. Anyone in the world may enter. 3. If no one submits an adequate entry by February 15, a $20 prize will be awarded to the best entry that meets a restricted set of specifications. In this case, the contest will be extended for one more week, with a reduced prize of $30 for the best full entry received by 12noon EST, February 22, 1998. 4. Entries will be judged on the basis of satisfying the specifications, robustness, creativity, ease of use, and visual appeal. 5. Group work is allowed and encouraged. 6. I will be the sole final judge of the winner. Specifications: A. $20 Restricted Specifications 1. The form must include entries for a restricted-length question (at most 500 ascii characters), an email address, and optionally a name. 2. The form must include a submit button, which when clicked, will automatically append the question to a list of questions on a separate www page. Each displayed question must include the author's email and name (if provided). B. $50 Full Specifications In addition to the $20 specifications, the forum must also meet the following sp[ecifications: 3. (**important**) The page of submitted questions must have a means by which anyone can score the quality of the question on a scale of 1 to 5 (say, by clicking on the appropriate score button), with 5 being the highest score. For each question, its median score must be displayed. Questions must be listed in order of decreasing median scores. 4. The form must have an entry for optional URLs. These URLs must be posted with the question in such a way that they are active. 5. There must be an entry for sender status (selection from a list of options, such as cypherpunk, NSA employee, UMBC student, other student, government employee, faculty, industrial engineer, ...) 6. (optional) For each question, also list the number of votes entered for each score in addition to the median score. 7. (optional) Reject any question containing a vulgar word. 8. (optional) Feel free to add other appropriate constructive functionality.

2 1

Get More Orders For Anything You Sell
by 65982672＠hk.super.net 17 Dec '03

17 Dec '03

EMAIL USA Mass E-Mail Discount Program *************************************************** Advertise your Business or Website , with our Mass e-mail program. Fast * Affordable * Very Effective EMail USA will send out your message to a vast amount of potential customers in one day. Even if your website is in the top 10 you can't get the traffic that you would as if you targeted everyone that sees your ad. Why is our bulk e-mail program so effective? Our bulk e-mail service provides businesses & individuals the most inexpensive, and most effective way to reach millions of people over the internet. We currently have over 40 million addresses to offer, and counting. *******Special Offers******* Send your ad to 100,000 people for only $100 Send your ad to 225,000 people for only $200 Special discounts for larger runs. Ask About Our -Targeted List- Advertising Program. ****Lowest prices guaranteed**** Special discounts for larger runs. For more info on advertising with EMail USA please call (201)865-8919 * * * * * * * * * * * * * * * * * * * If you received this message in error, please accept our apology. Just type Remove, and reply to vx2001(a)hotmail.com Your name will be permanantly removed from our database. Thank You.

1 0

PipeNet description
by Wei Dai 17 Dec '03

17 Dec '03

I just got a couple of requests for information about PipeNet and I realized that I never did make my final description of it public. The attached informal write-up was done shortly after Crypto '96 as a result of discussions with Hal Finney, David Wagner, and Eric Hughes. I haven't worked on it since then, mostly because the Onion Routing project is doing similar work and appears to be much better funded (I did send them a copy of this write-up per their request). --- The Model Consider a network of processors which send messages to each other asynchronously. We assume that each node is identified by its public key, and that links between nodes are secure. The adversary may control a fixed subset of the nodes. However all messages between any two honest nodes are confidential and always arrive (unmodified) in the order sent (this can be achieved with a standard transport level security protocol). The Protocol The protocol is based on the idea of virtual link encryption. After an anonymous connection is established, the originating node sends a constant stream of (constant size) packets to a second node at a fixed rate. The second node shuffles the packets it receives during a time unit and forwards them in random order to others. A connection is a path in the network. The first node in the path is the caller, and the last node is the receiver. The rest are called switches. Anonymity in this scheme is asymmetric - the caller is anonymous, but not the receiver. Each node in the path shares a key with the caller and knows the nodes immediately in front of and behind it. Every pair of adjacent nodes shares a link id. Each switch in the path therefore has a key and two associated ids. Call the id that it shares with the previous node (the one closer to the caller) type A, and call the other id type B. For each id, the switch expects exactly one packet tagged with that id in each time unit. When it receives a packet tagged with a type A id, it decrypts that packet with the associated key, tags it with the corresponding type B id, and forwards it to the next node. When it receives a packet tagged with a type B id, it encrypts the packet with the associated key, tags it with the corresponding type A id, and forwards it to the previous node. The forwarding is always done at the end of the time unit, and the order in which packets are sent is random. For each packet going from the caller to the receiver, the caller must multi-encrypt it with the keys it shares with each of the nodes in the path, starting with the receiver. It then sends the packet to the first switch tagged with the appropriate link id. Each switch will strip a layer of encryption and forward the packet to the next node. For a packet going from the receiver to the caller, the receiver encrypts it with the key it shares with the caller and sends it to the last switch in the path. Each switch will add a layer of encryption and forward the packet to the previous node. To establish a connection, the caller (N0) performs the following steps: 1. Select a node (N1) at random and establish a key (K1) and link id (S1) with N1. 2. Select another node (N2) at random. 3. Request that N1 establish a link id (S2) with N2. 4. Establish a key (K2) with N2 through N1. 5. Request that N1 use K1 to decrypt all messages tagged with S1, tag the decrypted message with S2 and forward them to N2. Also request that N1 use K1 to encrypt all messages tagged with S2, tag the encrypted messages with S1 and forward them to N0. 6. Repeat steps 2 to 4 l-2 times. (Name the i-th node, key, and id Ni, Ki, and Si respectively.) 7. Repeat steps 2 to 4 a final time, but with the receiver node (Nl) instead of a random node. Timing We assumed earlier that communications links between honest nodes are vulnerable to delay attacks. Therefore we must ensure that link delays do not reveal traffic information. Each node expects one packet from each link id in each time unit. Extra packets are queued for processing in later time units. However, if it does not receive a packet for a link id in a particular time unit, it stops normal processing of packets for that time unit and queues all packets. This ensures that any delay is propagated through the entire network and cannot be used to trace a particular connection. The process of making and breaking connections must also not leak information. This can be done by using a protocol analogous to mix-net. Link forming/destroying requests are queued and performed in batches in a way similar to queuing and mixing of e-mail in a mix-net.

1 0

Re: (eternity) Eternity as a secure filesystem/backup medium
by Bill Stewart 17 Dec '03

17 Dec '03

At 09:33 AM 1/18/98 EST, Ryan Lackey wrote: >Documents by specification last only as long as someone is willing to pay >to keep them up. This is not necessarily forever. But it can be, and the costs of doing so aren't much higher than storing it for the first couple of years. Depends on what service the customer wants to buy. And there are applications that require more than 100 years of data protection, e.g. ownership of copyrights which last 50 years beyond the author's death. But for Matt Barrie's question, any permanent document will do. >> Can we assume that using Moore's law this is at >> least 1 bit every 18 months for symmetric crypto? >Do the math, though, for 128bit. There are traditional analyses >which include the amount of silicon on the earth, the number of atoms >in the universe, etc. The general consensus is that traditional >techniques are not feasible for brute forcing 128bit ciphers before >the heat death of the universe. Hard to say. Assuming that Quantum Cryptography doesn't allow finite-sized computers to do large exponentially complex calculations in short finite time, you're probably limited by the number of atoms in the available supply of planets, and Heisenberg may still get you if that's not a low enough limit. Moore's law isn't forever. But there's no particular reason to limit RC4 or RC5 to 128 bits; those are convenient sizes for MD5 hashes of passphrases. So if you're paranoid, use RC4-256 and superencrypt with 5-DES. Thanks! Bill Bill Stewart, bill.stewart(a)pobox.com PGP Fingerprint D454 E202 CBC8 40BF 3C85 B884 0ABE 4639

1 0

API Specification for the AES
by Bill Stewart 17 Dec '03

17 Dec '03

>Date: Fri, 16 Jan 1998 14:59:37 -0500 >To: smid(a)csmes.ncsl.nist.gov >From: Jim Foti <jfoti(a)nist.gov> >Subject: API Specification for the AES > >Hello- > >As promised, we have placed on our AES Home Page a specification of the API >to be used for AES submissions (for both Java and ANSI C implementations). >It is available at <http://csrc.nist.gov/encryption/aes/api/api.htm>. > >As with past messages, this is being sent to all persons who have expressed >an interest in the AES development effort (one way or another) within the >last year. > >Regards, >Jim > > >******************************************************************* >Jim Foti > >Security Technology Group >Computer Security Division >National Institute of Standard and Technology (NIST) > >TEL: (301) 975-5237 >FAX: (301) 948-1233 > >******************************************************************* > >

1 0

BRAND NEW $10 MATRIX
by Vi.Sion＠19109.com 17 Dec '03

17 Dec '03

$$$$$$ PRE-LAUNCH $10 ULTIMATE MATRIX SYSTEM $$$$$$ ABSOLUTELY "BRAND NEW" JAN 1ST 1998 #$#$ JUST $10 ONE-TIME GETS YOU IN #$#$ NO SPONSORING EVER #$#$ NO DISKS, NO CODES, JUST CASH http://www.replinets.com/users/ce462043/ums.html

1 0

Financial Cryptography '98 Preliminary Program
by Ray Hirschfeld 17 Dec '03

17 Dec '03

Financial Cryptography '98 Second International Conference February 23-25, 1998, Anguilla, BWI CONFERENCE PROGRAM General Information: Financial Cryptography '98 (FC98) is a conference on the security of digital financial transactions. Meetings alternate between the island of Anguilla in the British West Indies and other locations. This second meeting will be held in Anguilla on February 23-25, 1998. FC98 aims to bring together persons involved in both the financial and data security fields to foster cooperation and exchange of ideas. Original papers were solicited on all aspects of financial data security and digital commerce in general. Program Committee: Matt Blaze, AT&T Laboratories--Research, Florham Park, NJ, USA Antoon Bosselaers, Katholieke Universiteit Leuven, Leuven, Belgium Yves Carlier, Bank for International Settlements, Basel, Switzerland Walter Effross, Washington College of Law, American U., Washington DC, USA Matthew Franklin (Co-Chair), AT&T Laboratories--Research, Florham Park, NJ, USA Michael Froomkin, U. Miami School of Law, Coral Gables, FL, USA Rafael Hirschfeld (Chair), Unipay Technologies, Amsterdam, The Netherlands Alain Mayer, Bell Laboratories/Lucent Technologies, Murray Hill, NJ, USA Moni Naor, Weizmann Institute of Science, Rehovot, Israel Frank Trotter, Mark Twain Ecash/Mercantile Bank, St. Louis, MO, USA Doug Tygar, Carnegie Mellon University, Pittsburgh, PA, USA Moti Yung, CertCo LLC (formerly: Bankers Trust E-Commerce), New York, NY, USA Conference Program for FC98: Monday 23 February 1998 800 -- 820 Breakfast 820 -- 830 Welcome 830 -- 905 Micropayments via Efficient Coin-Flipping Richard J. Lipton (Princeton University, Princeton, NJ, USA) Rafail Ostrovsky (Bellcore, Morristown, NJ, USA) 905 -- 940 X-Cash: Executable Digital Cash Markus Jakobsson (Bell Laboratories, Murray Hill, NJ, USA) Ari Juels (RSA Laboratories, Bedford, MA, USA) 940 -- 1015 Billing Without Paper...Or Billing Without Billers? Caveat Biller: 3rd Party Concentrators Could Come Between You and Your Customers Richard K. Crone (CyberCash, Reston, VA, USA) 1015 -- 1045 Coffee Break 1045 -- 1120 A Platform for Privately Defined Currencies, Loyalty Credits, and Play Money David P. Maher (AT&T Labs--Research, Florham Park, NJ, USA) 1120 -- 1155 Assessment of Threats for Smart Card Based Electronic Cash Kazuo J. Ezawa, Gregory Napiorkowski (Mondex International, Florham Park, NJ, USA) 1155 -- 1230 Using a High-Performance, Programmable Secure Coprocessor Sean W. Smith, Elaine R. Palmer, Steve Weingart (IBM T.J. Watson Research Center, Yorktown Heights, NY, USA) 1230 -- 1330 Lunch 1800 -- 1930 Cocktail Reception (at Mariners Hotel) Tuesday 24 February 1998 800 -- 830 Breakfast 830 -- 905 Secure Group Barter: Multi-Party Fair Exchange with Semi-Trusted Neutral Parties Matt Franklin (AT&T Labs--Research, Florham Park, NJ, USA) Gene Tsudik (USC Information Sciences Institute, Marina del Rey, CA, USA) 905 -- 940 A Payment Scheme Using Vouchers Ernest Foo, Colin Boyd (Queensland University of Technology, Brisbane, Australia) 940 -- 1015 A Formal Specification of Requirements for Payment Transactions in the SET Protocol Catherine Meadows, Paul Syverson (Naval Research Laboratory, Washington, DC, USA) 1015 -- 1045 Coffee Break 1045 -- 1120 On Assurance Structures for WWW Commerce Markus Jakobsson (Bell Laboratories, Murray Hill, NJ, USA) Moti Yung (CertCo, New York, NY, USA) 1120 -- 1230 Panel Discussion Certificate Revocation: Mechanics and Meaning Barb Fox (Microsoft, Redmond, WA, USA), moderator Joan Feigenbaum (AT&T Labs--Research, Florham Park, NJ, USA) Paul Kocher (Valicert, Palo Alto, CA, USA) Michael Myers (Verisign, Mountain View, CA, USA) Ron Rivest (MIT Laboratory for Computer Science, Cambridge, MA, USA) 1230 -- 1330 Lunch 2000 -- 2200 Rump Session Wednesday 25 February 1998 800 -- 830 Breakfast 830 -- 930 Invited Speaker Private Signatures and E-commerce David Chaum (DigiCash, Palo Alto, CA, USA) 930 -- 1005 Group Blind Digital Signatures: A Scalable Solution to Electronic Cash Anna Lysyanskaya, Zulfikar Ramzan (MIT Laboratory for Computer Science, Cambridge, MA, USA) 1005 -- 1045 Coffee Break 1045 -- 1120 Curbing Junk E-Mail via Secure Classification Eran Gabber, Markus Jakobsson, Yossi Matias, Alain Mayer (Bell Laboratories, Murray Hill, NJ, USA) 1120 -- 1155 Publicly Verifiable Lotteries: Applications of Delaying Functions David M. Goldschlag (Divx, Herndon, VA, USA) Stuart G. Stubblebine (AT&T Labs--Research, Florham Park, NJ, USA) 1155 -- 1230 Security of Digital Watermarks Lesley R. Matheson, Stephen G. Mitchell, Talal G. Shamoon, Robert E. Tarjan, Francis X. Zane (STAR Lab, InterTrust Technologies, Sunnyvale, CA, USA) 1230 -- 1330 Lunch 1330 -- 1405 Security in the Java Electronic Commerce Framework Surya Koneru, Ted Goldstein (JavaSoft, Palo Alto, CA, USA) 1405 -- 1440 Beyond Identity: Warranty-Based Digital Signature Transactions Yair Frankel, David W. Kravitz, Charles T. Montgomery, Moti Yung (CertCo, New York, NY, USA) 1440 -- 1515 Compliance Checking in the PolicyMaker Trust Management System Matt Blaze, Joan Feigenbaum, Martin Strauss (AT&T Labs--Research, Florham Park, NJ, USA) 1515 -- 1545 Coffee Break 1545 -- 1620 An Efficient Fair Off-Line Electronic Cash System with Extensions to Checks and Wallets with Observers Aymeric de Solages, Jacque Traore (France Telecom--CNET, Caen, France) 1620 -- 1655 An Efficient Untraceable Electronic Money System Based on Partially Blind Signatures of the Discrete Logarithm Problem Shingo Mayazaki, Kouichi Sakurai (Kyushu University, Fukuoka, Japan) 1655 -- 1700 Closing The conference schedule and additional information is available at the URL http://www.cwi.nl/conferences/FC98/. Breakfast and lunch are provided at the conference. The conference organizers have left time open for corporate sponsored events, for networking, and for recreational activities on the resort island of Anguilla. Participants are encouraged to bring their families. Workshop: A 40-hour workshop, intended for anyone with commercial software development experience who wants hands-on familiarity with the issues and technology of financial cryptography, is planned in conjunction with FC98, to be held during the week following the conference. For more information on the workshop, please see the URL http://www.cs.berkeley.edu/~iang/fc98/workshop.html. For workshop registration, see the URL http://fc98.ai/. Special Attraction: On Thursday, February 26, 1998, there will be a total eclipse of the sun. The narrow zone of 100% totality will pass just south of Anguilla. A boat excursion to the center of the eclipse zone is planned, for an optimal view of the eclipse. The excursion is included in the conference registration; additional tickets can be purchased for accompanying persons. Venue: The Inter-Island Hotel is a small 14-room guest house with a large, comfortable 150-seat conference facility and additional space for a small 10-booth exhibition. The Inter-Island is on Road Bay, near Sandy Ground Village, in the South Hill section of Anguilla. The conference, workshop, and exhibition will have TCP/IP internet access. Shuttle service to the conference will be available. Air Transportation and Hotels: Air travel to Anguilla is typically done through San Juan for US flights, or St. Maarten/Martin for flights from Europe and the US. There are also connections via Antigua. Anguillan import duties are not imposed on hardware or software which will leave the island again. There are no other taxes--or cryptography import/export restrictions--on Anguilla. Hotels range from spartan to luxurious, and more information about hotels on Anguilla can be obtained from your travel agent, or at the URL http://fc98.ai/. A block reservation has been made at Mariners, and this is the recommended hotel except for those seeking budget accomodations. General Chairs: Robert Hettinga, Shipwright, Boston, MA, USA email: rah(a)shipwright.com Vincent Cate, Offshore Information Services, Anguilla, BWI email: vince(a)offshore.com.ai Exhibits and Sponsorship Manager: Blanc Weber, Seattle, WA, USA email: blancw(a)cnw.com Workshop Leader: Ian Goldberg, Berkeley, CA, USA email: iang(a)cs.berkeley.edu Registration: You can register and pay for conference admission via the World Wide Web at the URL http://fc98.ai/. The cost of the FC98 Conference is US$1,000. There are reduced rates of US$250 and US$100 for full-time academics and students. Booths for the exhibition start at US$5,000 and include two conference tickets. For more information about exhibit space, contact Blanc Weber, blancw(a)cnw.com. Sponsorship opportunities for FC98 are still available. The cost of the workshop is US$5000, and includes meals but not lodging. You can register for the workshop, which runs the week after the conference, at the URL http://fc98.ai/. Financial Cryptography '98 is held in cooperation with the International Association for Cryptologic Research. It is sponsored by: RSA Data Security Inc. <http://www.rsa.com> C2NET, Inc. <http://www.c2.net> Hansa Bank & Trust Company Limited, Anguilla <http://www.hansa.net/> Sicherheit und Privat- International Bank <mailto:spbank@schloss.li> Offshore Information Services <http://www.offshore.com.ai/> e$ <http://www.shipwright.com>

1 0

Re: $50 encryption policy contest
by Dr. Alan Sherman 17 Dec '03

17 Dec '03

On Tue, 20 Jan 1998, Lucky Green wrote: > Given that the majority of the serious people on the list charge upwards > of $100/hour (I charge $250/hour for even looking at a problem), $50 seems > to be insufficient to generate much interest. Your point is well taken. I should have explained that I am seeking assistance for altruism from someone who is interested in crypto policy. For example, no one is compensating me for the many hours I've volunteered to pull off this two-part lecture series (and it was quite a challenge to get anyone with government connections to go on stage with John Gilmore). See http://www.cs.umbc.edu/events/fall97/crypto.shtml I'm also trying to help students by suggesting a concrete, worthwhile, interesting project through which to learn about www programming. I am open to the idea of a prize fund: I will augment the prize with 100% of all prize donations mailed to me. If each of 200 people send me $1, the prize fund will grow to $250. (make out check to "UMBC") Dr. Alan T. Sherman Dept. of CSEE UMBC 1000 Hilltop Circle Baltimore, MD 21250

1 0

FDA bans human cloning [CNN]
by Jim Choate 17 Dec '03

17 Dec '03

Forwarded message: > FDA: NO HUMAN CLONING WITHOUT AGENCY APPROVAL > > Cloning graphic January 19, 1998 > Web posted at: 9:18 p.m. EST (0218 GMT) > > WASHINGTON (AP) -- The Food and Drug Administration has a warning > for the Chicago physicist who wants to clone a human: The agency > will shut down anyone who tries without its permission. > > Richard Seed's cloning plans have sparked a public outcry and a race > by Congress and more than a dozen states to ban cloning. With the > FDA filling what critics had called a regulatory vacuum, scientists > say lawmakers should take more time to ensure vaguely worded > anti-cloning bills don't also ban lifesaving medical research. > > "It's been a public and media assumption that there is nothing on > the books that would even slow or stop Dr. Seed," said Carl Feldbaum > of the Biotechnology Industry Organization, which represents > biotechnologists involved in cloning research. FDA intervention > "creates at least some breathing space." > > FDA investigators plan to make clear to Seed that federal > regulations require that he file for FDA approval to attempt cloning > -- permission highly unlikely. > > "We're not only able to move, we're prepared to move," said Dr. > Michael Friedman, FDA's acting commissioner, noting the agency can > go to court to stop unauthorized cloning attempts. > [text deleted] ____________________________________________________________________ | | | The most powerful passion in life is not love or hate, | | but the desire to edit somebody elses words. | | | | Sign in Ed Barsis' office | | | | _____ The Armadillo Group | | ,::////;::-. Austin, Tx. USA | | /:'///// ``::>/|/ http://www.ssz.com/ | | .', |||| `/( e\ | | -====~~mm-'`-```-mm --'- Jim Choate | | ravage(a)ssz.com | | 512-451-7087 | |____________________________________________________________________|

1 0