D-Index & Metrics Best Publications

Bryan Parno

Carnegie Mellon University
United States

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Computer Science D-index 36 Citations 10,986 110 World Ranking 6979 National Ranking 3301

Research.com Recognitions

Awards & Achievements

2018 - Fellow of Alfred P. Sloan Foundation

2017 - ACM Senior Member

Overview

What is he best known for?

The fields of study he is best known for:

Operating system
Computer network
Programming language

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 most cited work include:

Non-interactive verifiable computing: outsourcing computation to untrusted workers (892 citations)
Distributed detection of node replication attacks in sensor networks (628 citations)
Flicker: an execution infrastructure for tcb minimization (613 citations)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

Computer security (35.04%)
Cryptography (17.95%)
Software (12.82%)

What were the highlights of his more recent work (between 2018-2021)?

Cryptography (17.95%)
Computer security (35.04%)
Code (11.97%)

In recent papers he was focusing on the following fields 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.

Between 2018 and 2021, his most popular works were:

EverCrypt: A Fast, Verified, Cross-Platform Cryptographic Provider (13 citations)
SoK: Computer-Aided Cryptography (10 citations)
A verified, efficient embedding of a verifiable assembly language (10 citations)

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.

Best Publications

Non-interactive verifiable computing: outsourcing computation to untrusted workers

Rosario Gennaro;Craig Gentry;Bryan Parno.
international cryptology conference (2010)

1275 Citations

Pinocchio: nearly practical verifiable computation

Bryan Parno;Jon Howell;Craig Gentry;Mariana Raykova.
Communications of The ACM (2016)

1048 Citations

Distributed detection of node replication attacks in sensor networks

B. Parno;A. Perrig;V. Gligor.
ieee symposium on security and privacy (2005)

955 Citations

Flicker: an execution infrastructure for tcb minimization

Jonathan M. McCune;Bryan J. Parno;Adrian Perrig;Michael K. Reiter.
european conference on computer systems (2008)

925 Citations

Challenges in Securing Vehicular Networks

Bryan Parno;Adrian Perrig.
(2005)

677 Citations

Quadratic Span Programs and Succinct NIZKs without PCPs

Rosario Gennaro;Craig Gentry;Bryan Parno;Mariana Raykova.
theory and application of cryptographic techniques (2013)

670 Citations

How to delegate and verify in public: verifiable computation from attribute-based encryption

Bryan Parno;Mariana Raykova;Vinod Vaikuntanathan.
theory of cryptography conference (2012)

416 Citations

Securing anti-virus software with virtualization

Jiahe Helen Wang;Jacob R. Lorch;Bryan Jeffrey Parno.
(2007)

405 Citations

Permacoin: Repurposing Bitcoin Work for Data Preservation

Andrew Miller;Ari Juels;Elaine Shi;Bryan Parno.
ieee symposium on security and privacy (2014)

344 Citations

IronFleet: proving practical distributed systems correct

Chris Hawblitzel;Jon Howell;Manos Kapritsos;Jacob R. Lorch.
symposium on operating systems principles (2015)

314 Citations

If you think any of the details on this page are incorrect, let us know.