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 80 Citations 27,465 340 World Ranking 438 National Ranking 259

Overview

What is he best known for?

The fields of study he is best known for:

  • Cryptography
  • Computer network
  • The Internet

His main research concerns Computer security, Cryptography, Theoretical computer science, Public-key cryptography and Random oracle. His Computer security study is mostly concerned with Adversary, Cryptosystem, Semantic security, Authentication protocol and Probabilistic encryption. His studies deal with areas such as Internet privacy, Discrete logarithm, Encryption, Authentication and Robustness as well as Cryptography.

His work deals with themes such as Cryptographic protocol, Hash chain, Hash function, Key derivation function and Computation, which intersect with Theoretical computer science. His study in Public-key cryptography is interdisciplinary in nature, drawing from both Homomorphic encryption and Kerberos. His Random oracle study combines topics from a wide range of disciplines, such as Digital signature, ElGamal signature scheme, Cryptographic primitive, Group signature and Standard model.

His most cited work include:

  • Polynomial reconstruction based cryptography (1391 citations)
  • Advances in Cryptology - EUROCRYPT 2004 (1247 citations)
  • Perfectly-Secure Key Distribution for Dynamic Conferences (1011 citations)

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

Computer security, Cryptography, Theoretical computer science, Public-key cryptography and Encryption are his primary areas of study. His Computer security study frequently draws connections between related disciplines such as Digital signature. His research investigates the connection with Cryptography and areas like Random oracle which intersect with concerns in Standard model.

His research in Theoretical computer science focuses on subjects like Zero-knowledge proof, which are connected to Discrete mathematics and Gas meter prover. Moti Yung interconnects Key generation, Signature and Server in the investigation of issues within Public-key cryptography. His Semantic security research incorporates themes from Plaintext-aware encryption and Ciphertext indistinguishability.

He most often published in these fields:

  • Computer security (51.50%)
  • Cryptography (42.52%)
  • Theoretical computer science (27.56%)

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

  • Computer security (51.50%)
  • Cryptography (42.52%)
  • Public-key cryptography (23.93%)

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

His primary scientific interests are in Computer security, Cryptography, Public-key cryptography, Encryption and Theoretical computer science. His Computer security research is multidisciplinary, incorporating elements of Internet privacy and Digital signature. His biological study spans a wide range of topics, including Correctness and Distributed computing.

His studies in Public-key cryptography integrate themes in fields like Ciphertext, Standard model, Server and Practical algorithm. The concepts of his Encryption study are interwoven with issues in Cloud computing and Key. He works mostly in the field of Theoretical computer science, limiting it down to topics relating to Random oracle and, in certain cases, Ring signature.

Between 2014 and 2021, his most popular works were:

  • End-To-End Design of a PUF-Based Privacy Preserving Authentication Protocol (47 citations)
  • Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions (47 citations)
  • Cliptography: Clipping the Power of Kleptographic Attacks (42 citations)

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

  • Cryptography
  • Computer network
  • The Internet

Moti Yung mostly deals with Computer security, Cryptography, Theoretical computer science, Adversary and Encryption. In his works, Moti Yung conducts interdisciplinary research on Computer security and Protocol. His work deals with themes such as Digital signature and Public-key cryptography, which intersect with Cryptography.

His study looks at the relationship between Public-key cryptography and fields such as Key generation, as well as how they intersect with chemical problems. His research integrates issues of Cloud storage and Random oracle in his study of Theoretical computer science. His Encryption research is multidisciplinary, relying on both Hash function and Cryptographic primitive.

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

Polynomial reconstruction based cryptography

Aggelos Kiayias;Moti Yung.
selected areas in cryptography (2001)

2257 Citations

Advances in Cryptology - EUROCRYPT 2004

Aggelos Kiayias;Yiannis Tsiounis;Moti Yung.
Springer Berlin Heidelberg (2004)

2033 Citations

Perfectly-Secure Key Distribution for Dynamic Conferences

Carlo Blundo;Alfredo De Santis;Amir Herzberg;Shay Kutten.
international cryptology conference (1992)

1457 Citations

Advances in Cryptology - CRYPTO 2002

Moti Yung.
(2002)

1235 Citations

Universal one-way hash functions and their cryptographic applications

M. Naor;M. Yung.
symposium on the theory of computing (1989)

1186 Citations

Public-key cryptosystems provably secure against chosen ciphertext attacks

M. Naor;M. Yung.
symposium on the theory of computing (1990)

1134 Citations

Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

Amir Herzberg;Stanislaw Jarecki;Stanislaw Jarecki;Hugo Krawczyk;Moti Yung.
international cryptology conference (1995)

1007 Citations

A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks

François-Xavier Standaert;Tal G. Malkin;Moti Yung.
international cryptology conference (2009)

923 Citations

How to withstand mobile virus attacks (extended abstract)

Rafail Ostrovsky;Moti Yung.
principles of distributed computing (1991)

587 Citations

Multi-authority secret-ballot elections with linear work

Ronald Cramer;Matthew Franklin;Berry Schoenmakers;Moti Yung.
theory and application of cryptographic techniques (1996)

517 Citations

Best Scientists Citing Moti Yung

François-Xavier Standaert

François-Xavier Standaert

Université Catholique de Louvain

Publications: 133

Willy Susilo

Willy Susilo

University of Wollongong

Publications: 121

Rafail Ostrovsky

Rafail Ostrovsky

University of California, Los Angeles

Publications: 120

David Pointcheval

David Pointcheval

École Normale Supérieure

Publications: 116

Yvo Desmedt

Yvo Desmedt

The University of Texas at Dallas

Publications: 106

Mihir Bellare

Mihir Bellare

University of California, San Diego

Publications: 106

Jonathan Katz

Jonathan Katz

University of Maryland, College Park

Publications: 96

Yi Mu

Yi Mu

Fujian Normal University

Publications: 96

Huaxiong Wang

Huaxiong Wang

Nanyang Technological University

Publications: 93

Hideki Imai

Hideki Imai

Chuo University

Publications: 84

Ivan Damgård

Ivan Damgård

Aarhus University

Publications: 83

Ran Canetti

Ran Canetti

Boston University

Publications: 76

Yevgeniy Dodis

Yevgeniy Dodis

New York University

Publications: 74

Bart Preneel

Bart Preneel

KU Leuven

Publications: 74

Amit Sahai

Amit Sahai

University of California, Los Angeles

Publications: 73

Reihaneh Safavi-Naini

Reihaneh Safavi-Naini

University of Calgary

Publications: 73

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.