Saturday, November 30, 2002
Can you read the word above? Could a computer?
Manuel Blum won his Turing Award in 1995 for his work in computational complexity and its applications to cryptography.
The theory of much of modern-day cryptography uses the assumption that certain problems are not easily computable to create unbreakable codes and protocols.
These days Blum is working on another project that also uses the assumption that some problems are hard computationally. The idea is to use
problems that humans can solve easier than computers to prevent automated registration, voting, etc. Check out the
CAPTCHA project web site.
Wednesday, November 27, 2002
One last reminder that today is the submission deadline for the 2003 Conference on Computational Complexity. Good luck to all submitters.
Have a great Thanksgiving everyone!
Monday, November 25, 2002
Dan Boneh gave a talk at Princeton today about some recent developments in cryptography based on algebraic geometry. One of these tools is identity-based encryption which is public-key encryption where the public key is just a user's identity such as their email address.
Dan's group has an implementation of the system for Outlook, Yahoo Mail and some other systems. If you want to be the first on your block using the latest and greatest encryption or just want more information check out the IBE web site.
Personally, I send all my email in cleartext. If anyone goes through the hassle of capturing it they will only discover what a boring person I am.
on the search for a new director of the Institute for Advanced Study discusses
the changing nature of the institute.
The faculty member in computer science mentioned in the article is
complexity theorist Avi Wigderson. It was a coup for
complexity and all of computer science when he was appointed a faculty
member in 1999. With a large collection of postdocs, visitors
and students he has made the institute quite an exciting place for
theoretical computer science
and discrete math.