We are entering an era when hardware accelerators for cryptographic operations will be widely distributed in computing devices and throughout the communications infrastructure. Cryptographic operations will become fast, cheap, and easy. But it is not yet clear whether, or how, such cryptographic abundance will be translated into benefits for businesses or individuals. Users rarely want cryptography as an end in itself. Rather they employ cryptography to achieve some larger goals of trust, confidentiality, or control. Will our increasing technical abilities make a difference? How? When? What obstacles lie in the way?
This workshop will consider cryptographic abundance in the context of three likely applications: micropayments, digital property rights, and secure multicast.
Speakers are encouraged to address technical, social, and economic promises of cryptographic abundance, and especially to identify barriers to the translation of technical possibility into user benefit.
This workshop is a follow-up to the 2000 PARC Symposium on Life in an Era of Cryptographic Abundance. That workshop was a presentation of the paradigm to a general audience. This workshop will be a discussion among active workers.
By a happy chance Alice Silverberg, Visiting Scholar at PARC, will give a one-hour popular lecture on Fermat's Last Theorem at 4PM on the day of our workshop. We will adjourn in time to attend her lecture.
| 9:00 | Workshop Assembles |
| 9:15 | Context and Key Questions (Tom Berson, Xerox PARC) |
| 9:30 | Making SSL work with the existing network infrastructure (Dan Boneh, Stanford) |
| 10:30 | Break |
| 10:45 | Will Cryptographic Abundance Sink Security of Scale? (Matt Franklin, UC Davis delivered by Diana Smetters, Xerox PARC) |
| 11:15 | Self-Healing Key Distribution (Jessica Staddon, Xerox PARC) |
| 11:45 | Lunch in the PARC Cafeteria (no host) |
| 1:00 | Short Signatures from the Weil Pairing (Ben Lynn, Stanford) |
| 1:30 | Cryptographic Tools and Realistic Models for DRM (Tomas Sander, Intertrust STAR Lab) |
| 2:30 | CPRM - Content Protection for Recordable Media (Jeff Lotspiech, IBM Almaden) |
| 3:00 | Discussion and Cookies |
| 3:45 | Workshop Adjourns |
| 4:00 | PARC Forum (A Public Lecture Series) Fermat's Last Theorem, Elliptic Curves, And Beyond (Alice Silverberg, Xerox PARC and Ohio State) |
| 5:00 | PARC Forum Ends |
Sorry. No new registrations are being accepted. The size of this workshop has reached the capacity of the meeting room. A waiting list has been established. To join the waiting list, email your name to the workshop registrar.
Here's a map. There is limited visitors' parking in front, and plenty of parking out back. Please come to the upper entrance (near the flagpoles). The receptionist there will give you a badge. We will appreciate your arriving promptly at 9:00 because we need to escort you.