D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index 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. Citations Publications World Ranking National Ranking
Computer Science D-index 50 Citations 14,212 113 World Ranking 2943 National Ranking 1554

Overview

What is he best known for?

The fields of study he is best known for:

  • Operating system
  • Computer network
  • The Internet

His primary areas of investigation include Computer security, Encryption, Password, Password strength and S/KEY. Fabian Monrose has researched Computer security in several fields, including The Internet and World Wide Web. The study incorporates disciplines such as Exploit kit and Code reuse in addition to The Internet.

While the research belongs to areas of Encryption, Fabian Monrose spends his time largely on the problem of Network packet, intersecting his research to questions surrounding Network security, Voice over IP, Identification and Traffic generation model. In his research on the topic of One-time password, Operating system and Input device is strongly related with Human–computer interaction. In his study, which falls under the umbrella issue of Authentication, Internet privacy is strongly linked to Biometrics.

His most cited work include:

  • The design and analysis of graphical passwords (728 citations)
  • Keystroke dynamics as a biometric for authentication (621 citations)
  • A multifaceted approach to understanding the botnet phenomenon (546 citations)

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

Fabian Monrose mainly investigates Computer security, Encryption, Exploit, The Internet and Network security. His work in Computer security is not limited to one particular discipline; it also encompasses Internet privacy. His Encryption research is multidisciplinary, incorporating elements of Hidden Markov model, Keystroke dynamics and Network packet.

His study focuses on the intersection of Network packet and fields such as Voice over IP with connections in the field of Speech recognition. His The Internet research is multidisciplinary, incorporating perspectives in Code reuse and Cache. In his work, Machine learning and Artificial intelligence is strongly intertwined with Key, which is a subfield of Password.

He most often published in these fields:

  • Computer security (49.65%)
  • Encryption (14.89%)
  • Exploit (13.48%)

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

  • Computer security (49.65%)
  • Code reuse (7.80%)
  • Exploit (13.48%)

In recent papers he was focusing on the following fields of study:

Fabian Monrose mainly focuses on Computer security, Code reuse, Exploit, Code and Artificial intelligence. His studies in Computer security integrate themes in fields like Overhead, Compiler and Hypervisor. His Code reuse research is multidisciplinary, incorporating elements of Return-oriented programming, Byte, Address space layout randomization and Gadget.

His Exploit research is multidisciplinary, relying on both Adversary, The Internet, Enterprise information security architecture and Backward compatibility. In his study, Inference and Keystroke logging is inextricably linked to Machine learning, which falls within the broad field of Artificial intelligence. His Encryption research incorporates elements of Password and Cloud computing.

Between 2015 and 2021, his most popular works were:

  • SoK: Security Evaluation of Home-Based IoT Deployments (88 citations)
  • Virtual U: defeating face liveness detection by building virtual models from your public photos (46 citations)
  • Practical Attacks Against Graph-based Clustering (41 citations)

In his most recent research, the most cited papers focused on:

  • Operating system
  • Computer network
  • The Internet

The scientist’s investigation covers issues in Computer security, Exploit, Adversary, Authentication and Network security. His Computer security study incorporates themes from Software, Computer network and Scalability. Fabian Monrose combines subjects such as Correctness, Computer hardware, Central processing unit and Microarchitecture with his study of Exploit.

His research in Adversary intersects with topics in Backward compatibility, The Internet and Enterprise information security architecture. His research integrates issues of Password and Encryption in his study of Authentication. His work carried out in the field of Network security brings together such families of science as Unsupervised learning, Clustering coefficient, Cluster analysis and Feature vector.

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

The design and analysis of graphical passwords

Ian Jermyn;Alain Mayer;Fabian Monrose;Michael K. Reiter.
usenix security symposium (1999)

1095 Citations

Keystroke dynamics as a biometric for authentication

Fabian Monrose;Aviel D. Rubin.
Future Generation Computer Systems (2000)

994 Citations

A multifaceted approach to understanding the botnet phenomenon

Moheeb Abu Rajab;Jay Zarfoss;Fabian Monrose;Andreas Terzis.
internet measurement conference (2006)

912 Citations

Password hardening based on keystroke dynamics

Fabian Monrose;Michael K. Reiter;Susanne Wetzel.
International Journal of Information Security (2002)

694 Citations

All your iFRAMEs point to Us

Niels Provos;Panayiotis Mavrommatis;Moheeb Abu Rajab;Fabian Monrose.
usenix security symposium (2008)

669 Citations

Authentication via keystroke dynamics

Fabian Monrose;Aviel Rubin.
computer and communications security (1997)

666 Citations

On user choice in graphical password schemes

Darren Davis;Fabian Monrose;Michael K. Reiter.
usenix security symposium (2004)

656 Citations

Cryptographic key generation from voice

F. Monrose;M.K. Reiter;Qi Li;S. Wetzel.
ieee symposium on security and privacy (2001)

513 Citations

Just-In-Time Code Reuse: On the Effectiveness of Fine-Grained Address Space Layout Randomization

K. Z. Snow;F. Monrose;L. Davi;A. Dmitrienko.
ieee symposium on security and privacy (2013)

495 Citations

Achieving efficient conjunctive keyword searches over encrypted data

Lucas Ballard;Seny Kamara;Fabian Monrose.
international conference on information and communication security (2005)

388 Citations

Best Scientists Citing Fabian Monrose

Thorsten Holz

Thorsten Holz

Ruhr University Bochum

Publications: 52

Ahmad-Reza Sadeghi

Ahmad-Reza Sadeghi

TU Darmstadt

Publications: 43

Wenke Lee

Wenke Lee

Georgia Institute of Technology

Publications: 36

Christopher Kruegel

Christopher Kruegel

University of California, Santa Barbara

Publications: 35

Lucas Davi

Lucas Davi

University of Duisburg-Essen

Publications: 32

Shui Yu

Shui Yu

University of Technology Sydney

Publications: 29

Giovanni Vigna

Giovanni Vigna

University of California, Santa Barbara

Publications: 29

Angelos D. Keromytis

Angelos D. Keromytis

Georgia Institute of Technology

Publications: 28

Paul C. van Oorschot

Paul C. van Oorschot

Carleton University

Publications: 28

Herbert Bos

Herbert Bos

Vrije Universiteit Amsterdam

Publications: 27

William Kress Bodin

William Kress Bodin

IBM (United States)

Publications: 26

Michalis Polychronakis

Michalis Polychronakis

Stony Brook University

Publications: 24

Lorrie Faith Cranor

Lorrie Faith Cranor

Carnegie Mellon University

Publications: 24

Peng Liu

Peng Liu

Chinese Academy of Sciences

Publications: 23

Nicolas Christin

Nicolas Christin

Carnegie Mellon University

Publications: 22

Paul C. van Oorschot

Paul C. van Oorschot

Carleton University

Publications: 22

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-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.

Contact us
Something went wrong. Please try again later.