2018 - Fellow of Alfred P. Sloan Foundation
2017 - ACM Senior Member
Bryan Parno mostly deals with Computer network, Computer security, Verifiable computing, Theoretical computer science and Distributed computing. His work carried out in the field of Computer network brings together such families of science as Scheme and Software deployment. His Computer security research incorporates elements of Bandwidth and Flow network.
He combines subjects such as Homomorphic encryption, Computation and Cryptography with his study of Verifiable computing. His work deals with themes such as Toolchain and Public-key cryptography, which intersect with Cryptography. He has researched Theoretical computer science in several fields, including Class and Quadratic equation.
His primary areas of study are Computer security, Cryptography, Software, Operating system and Distributed computing. His research in Computer security intersects with topics in Computer network, World Wide Web and Internet privacy. His Cryptography study combines topics from a wide range of disciplines, such as Theoretical computer science, Mathematical proof, Compiler, Correctness and Computation.
His work deals with themes such as Verifiable computing and Verifiable secret sharing, which intersect with Theoretical computer science. His Operating system research is multidisciplinary, incorporating perspectives in Isolation, Embedded system and Code. In general Distributed computing, his work in State machine replication and Liveness is often linked to Scale linking many areas of study.
Bryan Parno mainly focuses on Cryptography, Computer security, Code, Correctness and Software engineering. The Cryptography study combines topics in areas such as Cross-platform, Computer-aided and Embedded system. Bryan Parno integrates Computer security with Space in his research.
He works mostly in the field of Code, limiting it down to topics relating to Assembly language and, in certain cases, Hoare logic, Mathematical proof, Domain-specific language and Satisfiability modulo theories. His research integrates issues of Standardization, Focus, Data science and Taxonomy in his study of Correctness. The study incorporates disciplines such as Replication, Alias analysis, Semantics and Reduction in addition to Software engineering.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Non-interactive verifiable computing: outsourcing computation to untrusted workers
Rosario Gennaro;Craig Gentry;Bryan Parno.
international cryptology conference (2010)
Distributed detection of node replication attacks in sensor networks
B. Parno;A. Perrig;V. Gligor.
ieee symposium on security and privacy (2005)
Flicker: an execution infrastructure for tcb minimization
Jonathan M. McCune;Bryan J. Parno;Adrian Perrig;Michael K. Reiter.
european conference on computer systems (2008)
Pinocchio: Nearly Practical Verifiable Computation
Bryan Parno;Jon Howell;Craig Gentry;Mariana Raykova.
ieee symposium on security and privacy (2013)
Challenges in Securing Vehicular Networks
Bryan Parno;Adrian Perrig.
Quadratic Span Programs and Succinct NIZKs without PCPs
Rosario Gennaro;Craig Gentry;Bryan Parno;Mariana Raykova.
theory and application of cryptographic techniques (2013)
How to delegate and verify in public: verifiable computation from attribute-based encryption
Bryan Parno;Mariana Raykova;Vinod Vaikuntanathan.
theory of cryptography conference (2012)
Securing anti-virus software with virtualization
Jiahe Helen Wang;Jacob R. Lorch;Bryan Jeffrey Parno.
Phoolproof phishing prevention
Bryan Parno;Cynthia Kuo;Adrian Perrig.
financial cryptography (2006)
User-Driven Access Control: Rethinking Permission Granting in Modern Operating Systems
F. Roesner;T. Kohno;A. Moshchuk;B. Parno.
ieee symposium on security and privacy (2012)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: