The Algorand Foundation’s Technical Advisory Committee Welcomes Dr. Dan Boneh

The Technical Advisory Committee (TAC) plays a key role in the continual technical evolution of the Algorand network. With responsibility for the technical aspects of the Algorand ecosystem and protocol, the committee will be comprised of experts in blockchain, cryptography, computer science and more.

Today, we are excited to announce Dr. Dan Boneh is joining the TAC. This comes on the heels of an earlier announcement that Brian Parno of Carnegie Mello University, ACM, IEEE, and Microsoft Research will also join the TAC. We look forward to the contributions that the TAC members will make to the Algorand ecosystem.

Image for post
Image for post
Dan Boneh: Member, Technical Advisory Committee, Algorand Foundation

Dr. Boneh is a Professor of Computer Science at Stanford University where he heads the applied cryptography group, co-directs the computer security lab, and co-directs the new center for blockchain research (CBR). Dr. Boneh’s research focuses on applications of cryptography to computer security. His work includes cryptosystems with novel properties, cryptography for blockchains, web security, and cryptanalysis. He is the author of over a 150 publications in the field and is a recipient of the 2014 ACM prize, the 2013 Godel prize, the RSA award in mathematics, and six best paper awards. In 2016 Dr. Boneh was elected to the National Academy of Engineering.

Image for post
Image for post
Bryan Parno: Member, Technical Advisory Committee, Algorand Foundation

Bryan Parno is an Associate Professor with a joint appointment in Carnegie Mellon University’s Computer Science Department and Electrical & Computer Engineering Department, and a Senior Member of ACM and IEEE. After receiving a Bachelor’s degree from Harvard College, he completed his PhD working with Adrian Perrig at Carnegie Mellon University, where his dissertation won the 2010 ACM Doctoral Dissertation Award. He then spent six years as a Researcher in Microsoft Research before returning to CMU.

Bryan’s research is primarily focused on investigating long-term, fundamental improvements in how to design and build secure systems. In 2011, he was selected for Forbes’ 30-Under-30 Science List. He formalized and worked to optimize verifiable computation, receiving a Best Paper Award at the IEEE Symposium on Security and Privacy for his advances. He coauthored a book on Bootstrapping Trust in Modern Computers, and his work in that area has been incorporated into the latest security enhancements in Intel CPUs. His research into security for new application models was incorporated into Windows and received Best Paper Awards at the IEEE Symposium on Security and Privacy and the USENIX Symposium on Networked Systems Design and Implementation. He has recently extended his interest in bootstrapping trust to the problem of building practical, formally verified secure systems, for which he received a Distinguished Paper Award at the USENIX Security Symposium. His other research interests include user authentication, secure network protocols, and security in constrained environments (e.g., RFID tags, sensor networks, or vehicles).

Please follow the foundation’s official social channels for more news and announcements from the TAC!

Twitter

LinkedIn

Facebook

Telegram

Algorand Foundation

Building trusted infrastructure for the borderless economy.

Medium is an open platform where 170 million readers come to find insightful and dynamic thinking. Here, expert and undiscovered voices alike dive into the heart of any topic and bring new ideas to the surface. Learn more

Follow the writers, publications, and topics that matter to you, and you’ll see them on your homepage and in your inbox. Explore

If you have a story to tell, knowledge to share, or a perspective to offer — welcome home. It’s easy and free to post your thinking on any topic. Write on Medium

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store