What is he best known for?
The fields of study he is best known for:
- Cryptography
- Programming language
- Computer network
His scientific interests lie mostly in Theoretical computer science, Distributed key generation, Computer security, Encryption and Secure multi-party computation.
His Theoretical computer science research incorporates themes from Protocol and Schnorr signature.
His work in Distributed key generation addresses issues such as Discrete logarithm, which are connected to fields such as Secrecy, Correctness and ElGamal encryption.
Key generation is the focus of his Computer security research.
His Secure multi-party computation research integrates issues from Verifiable secret sharing and Oblivious transfer.
His Verifiable secret sharing research is multidisciplinary, incorporating elements of Adversary, Probabilistic encryption and Secret sharing.
His most cited work include:
- Proactive Secret Sharing Or: How to Cope With Perpetual Leakage (657 citations)
- Proactive Secret Sharing Or: How to Cope With Perpetual Leakage (657 citations)
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries (523 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Computer security, Public-key cryptography, Theoretical computer science, Encryption and Cryptography.
Password, Authentication, Key, Random oracle and Secret sharing are among the areas of Computer security where the researcher is concentrating his efforts.
Stanislaw Jarecki combines subjects such as Homomorphic encryption, Schnorr signature and Secure multi-party computation, Protocol, Commitment scheme with his study of Theoretical computer science.
As part of the same scientific family, Stanislaw Jarecki usually focuses on Encryption, concentrating on Database and intersecting with Web page and Data structure.
His work deals with themes such as ElGamal encryption and Discrete logarithm, which intersect with Cryptography.
His Distributed key generation research is multidisciplinary, incorporating perspectives in Digital Signature Algorithm and Secrecy.
He most often published in these fields:
- Computer security (54.87%)
- Public-key cryptography (25.66%)
- Theoretical computer science (24.78%)
What were the highlights of his more recent work (between 2017-2021)?
- Password (21.24%)
- Computer security (54.87%)
- Dictionary attack (13.27%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Password, Computer security, Dictionary attack, Key and Key exchange.
His research integrates issues of Authenticated Key Exchange, Server and Authentication in his study of Password.
Stanislaw Jarecki integrates many fields, such as Computer security and Sphinx, in his works.
Stanislaw Jarecki focuses mostly in the field of Key, narrowing it down to topics relating to Protocol and, in certain cases, Orders of magnitude.
The Password management study which covers Cryptography that intersects with Theoretical computer science.
His Theoretical computer science research incorporates themes from Secure multi-party computation and Computation.
Between 2017 and 2021, his most popular works were:
- OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-computation Attacks (33 citations)
- Two-Factor Authentication with End-to-End Password Security (8 citations)
- Efficient Covert Two-Party Computation (7 citations)
In his most recent research, the most cited papers focused on:
- Cryptography
- Computer network
- Programming language
Stanislaw Jarecki focuses on Key management, Computer security, Computation, Protocol and Secure multi-party computation.
Within one scientific family, he focuses on topics pertaining to Service under Key management, and may sometimes address concerns connected to Public-key cryptography.
His Computer security study focuses mostly on Dictionary attack, Key exchange, Key and Salt.
The study incorporates disciplines such as Discrete mathematics, Theoretical computer science and Orders of magnitude in addition to Computation.
His Secure multi-party computation study combines topics from a wide range of disciplines, such as Round complexity, Binary logarithm, Latency, Security parameter and Oblivious ram.
His Message authentication code research is multidisciplinary, incorporating elements of Password and Server.
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.
