What is he best known for?
The fields of study he is best known for:
- Programming language
- Cryptography
- Algorithm
The scientist’s investigation covers issues in Theoretical computer science, Cryptography, Computer security, Hash function and Protocol.
His Theoretical computer science study integrates concerns from other disciplines, such as Distributed computing, Random oracle, Function, One-way function and Secure two-party computation.
Rafael Pass studies Cryptography, focusing on Commitment scheme in particular.
In the subject of general Computer security, his work in Cryptographic protocol and Zero-knowledge proof is often linked to Consensus, Protocol and Snow, thereby combining diverse domains of study.
His work carried out in the field of Hash function brings together such families of science as Discrete mathematics, Security of cryptographic hash functions and Constant.
The Protocol study which covers Asynchronous communication that intersects with State machine replication.
His most cited work include:
- Analysis of the Blockchain Protocol in Asynchronous Networks (300 citations)
- Universally composable protocols with relaxed set-up assumptions (221 citations)
- Universally composable security with global setup (221 citations)
What are the main themes of his work throughout his whole career to date?
His scientific interests lie mostly in Theoretical computer science, Cryptography, Discrete mathematics, Mathematical economics and Computer security.
His Theoretical computer science research integrates issues from Protocol, Commitment scheme, Zero-knowledge proof, Hash function and Computation.
His Protocol research includes elements of Blockchain and Asynchronous communication.
Rafael Pass combines subjects such as Adversary and Bounded function with his study of Cryptography.
His Discrete mathematics study incorporates themes from Function, Class, Mathematical proof and Constant.
His research in Computer security intersects with topics in Scheme and The Internet.
He most often published in these fields:
- Theoretical computer science (32.14%)
- Cryptography (26.07%)
- Discrete mathematics (22.86%)
What were the highlights of his more recent work (between 2017-2021)?
- Discrete mathematics (22.86%)
- Cryptography (26.07%)
- Computer security (16.07%)
In recent papers he was focusing on the following fields of study:
His primary areas of study are Discrete mathematics, Cryptography, Computer security, Bounded function and Theoretical computer science.
His studies deal with areas such as Function, Class, Mathematical proof and Search problem as well as Discrete mathematics.
His work in Cryptography addresses issues such as Adversary, which are connected to fields such as Signature.
When carried out as part of a general Computer security research project, his work on Adaptive security is frequently linked to work in Too quickly, therefore connecting diverse disciplines of study.
His research on Bounded function also deals with topics like
- Polynomial that connect with fields like Cryptographic protocol and Limit,
- Time complexity which connect with Mathematical economics, Repeated game, Folk theorem, Bounded rationality and Turing machine,
- Digital signature that intertwine with fields like Reduction.
Rafael Pass usually deals with Theoretical computer science and limits it to topics linked to Construct and Cryptographic primitive.
Between 2017 and 2021, his most popular works were:
- Thunderella: Blockchains with Optimistic Instant Confirmation (103 citations)
- Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake (52 citations)
- Communication Complexity of Byzantine Agreement, Revisited (18 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Cryptography
His main research concerns Computer security, Discrete mathematics, Cryptography, Simple and Theoretical computer science.
The concepts of his Computer security study are interwoven with issues in The Internet and Partition.
His research integrates issues of Function, Computation, Round complexity and Verifiable secret sharing in his study of Discrete mathematics.
His Cryptography research incorporates elements of Adversary and Bounded function.
His biological study spans a wide range of topics, including Blockchain, Computer network, Protocol, Asynchronous communication and Finite-state machine.
His Theoretical computer science research is multidisciplinary, incorporating elements of Construct and Obfuscation.
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.
