What is he best known for?
The fields of study he is best known for:
- Programming language
- Cryptography
- Algorithm
His scientific interests lie mostly in Theoretical computer science, Cryptography, Encryption, Secure multi-party computation and Cryptographic primitive.
His studies in Theoretical computer science integrate themes in fields like Gas meter prover, Random oracle and Oblivious transfer.
Manoj Prabhakaran has researched Cryptography in several fields, including State, Oracle, Construct, Computer network and Formal verification.
The Encryption study combines topics in areas such as Overhead, Secret sharing and Commitment scheme.
His Secure multi-party computation study integrates concerns from other disciplines, such as Field and String.
In his study, Pseudorandom generator and Communication complexity is inextricably linked to Secure two-party computation, which falls within the broad field of Cryptographic primitive.
His most cited work include:
- Founding Cryptography on Oblivious Transfer --- Efficiently (339 citations)
- The smallest grammar problem (338 citations)
- Attribute-based signatures (298 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Theoretical computer science, Cryptography, Secure multi-party computation, Encryption and Computation.
The study incorporates disciplines such as Protocol, Oblivious transfer, Cryptographic primitive, Reduction and Generalization in addition to Theoretical computer science.
His biological study spans a wide range of topics, including Discrete mathematics and Characterization.
His Cryptography study also includes
- Adversary most often made with reference to Construct,
- Obfuscation together with Formal proof.
The various areas that Manoj Prabhakaran examines in his Secure multi-party computation study include Distributed computing and Pseudorandom generator.
His Computation research includes themes of Completeness and Computer engineering.
He most often published in these fields:
- Theoretical computer science (55.30%)
- Cryptography (36.36%)
- Secure multi-party computation (34.85%)
What were the highlights of his more recent work (between 2016-2020)?
- Computation (23.48%)
- Theoretical computer science (55.30%)
- Encryption (25.00%)
In recent papers he was focusing on the following fields of study:
His main research concerns Computation, Theoretical computer science, Encryption, Cryptography and Secure multi-party computation.
Manoj Prabhakaran combines Computation and Algebraic structure in his studies.
His Theoretical computer science research integrates issues from Homomorphic encryption, Secrecy, Protocol and Permutation.
His work in the fields of Malleability and Ciphertext overlaps with other areas such as As is.
His Cryptography study combines topics in areas such as Completeness and Discrete mathematics.
He interconnects Upper and lower bounds, String, Distributed computing and SIMPLE in the investigation of issues within Secure multi-party computation.
Between 2016 and 2020, his most popular works were:
- Towards Characterizing Securely Computable Two-Party Randomized Functions (5 citations)
- Witness Maps and Applications (4 citations)
- CellTree: A New Paradigm for Distributed Data Repositories. (2 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Cryptography
- Algorithm
Manoj Prabhakaran spends much of his time researching Cryptography, Secure multi-party computation, Discrete mathematics, Computation and Distributed computing.
His Secure multi-party computation study frequently draws connections between adjacent fields such as Computable function.
His research links Witness with Discrete mathematics.
His research in Computation intersects with topics in Symmetric function, Theoretical computer science and Completeness.
Manoj Prabhakaran connects Distributed computing with Bottleneck in his study.
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.
