Doug Tygar was born and raised in California. He received his AB from the University of California, Berkeley. He received a PhD in computer science at Harvard University, working with Michael Rabin on secure operating systems.
Doug Tygar then joined the faculty at Carnegie Mellon, where he is currently a (tenured) associate professor. Doug Tygar has worked on electronic commerce, computer security, distributed systems, and applied algorithms. He is currently supervising the following systems projects:
His previous systems work includes
Other research work by Doug Tygar has included topics as diverse as super-fast parallel provably-strong pseudo-random number generation, geometric representation of variable resistor networks, better versions of quicksort, randomized super-fast algorithms for matrix inversion, privacy protection for library patron data, and complexity theoretic representations of chaos theory.
Doug Tygar as written over 50 technical papers and given more than 150 invited talks. He has produced five PhD students (and several MS and BS students), and is currently supervising five more PhD students. Prizes include a NSF Presidential Young Investigator Fellowship, several best-paper awards, invited talks (including invited talks at Harvard's 100th anniversary of its Graduate School of Arts and Sciences and CMU's 25th anniversary of its computer science program), being named "favorite professor" for teaching in Carnege Mellon Magazine, and the first university grant by the National Computer Security Center.
Further information on Doug Tygar can be found from links off his home page.