Anonymity and cryptographic protocols
Mikhail Atallah - CERIAS /Purdue CS Department
Jan 29, 1999
AbstractWe survey some cryptographic techniques for achieving electronic anonymity while performing useful tasks. Anonymous message broadcast, communication with untraceability of sender and receiver, foiling network traffic analysis, lead to the dining cryptographers problem and its variants. We also discuss anonymity of electronic money (i.e., without an audit trail --- unlike credit cards) and how to achieve it with cryptographic techniques like blind signatures, secret splitting, challenge-response techniques, etc. The talk is self-contained, and no previous background in this area is assumed.
About the SpeakerMike Atallah is one of the senior professors associated with the CERIAS. He is a professor with the
CS department. He brews a potent pot of espresso.
The views, opinions and assumptions expressed in these videos are those of the presenter and do not necessarily reflect the official policy or position of CERIAS or Purdue University. All content included in these videos, are the property of Purdue University, the presenter and/or the presenter’s organization, and protected by U.S. and international copyright laws. The collection, arrangement and assembly of all content in these videos and on the hosting website exclusive property of Purdue University. You may not copy, reproduce, distribute, publish, display, perform, modify, create derivative works, transmit, or in any other way exploit any part of copyrighted material without permission from CERIAS, Purdue University.
- Ultra-Secure, Ultra-Reliable Trusted Microelectronics Development Project to Focus on Hardware First
- Purdue’s Garimella Gets U.S. Presidential Nod for National Science Board
- More News »