D-Index & Metrics Best Publications

Moti Yung

Columbia University
United States

D-Index & Metrics 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.

Discipline name Citations Publications World Ranking National Ranking

Computer Science D-index 82 Citations 31,678 445 World Ranking 545 National Ranking 314

Overview

What is he best known for?

The fields of study Moti Yung is best known for:

Public-key cryptography
Digital signature
Schnorr signature

His study on Geometry is interrelated to topics such as Mathematical proof and Signature (topology). In his research, Moti Yung undertakes multidisciplinary study on Mathematical proof and Geometry. His research on Computer security frequently connects to adjacent areas such as Key (lock). His Key (lock) study frequently links to other fields, such as Computer security. His study ties his expertise on Alternative medicine together with the subject of Protocol (science). His Alternative medicine study frequently draws connections between related disciplines such as Pathology. His research on Pathology often connects related areas such as Protocol (science). Computer network is often connected to Key exchange in his work. His study in Oakley protocol extends to Key exchange with its themes.

His most cited work include:

Scalable Protocols for Authenticated Group Key Exchange (319 citations)
Strong Key-Insulated Signature Schemes (177 citations)
The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures (63 citations)

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

His Mathematical analysis research is intertwined with Scheme (mathematics) and Polynomial. With his scientific publications, his incorporates both Computer security and Internet privacy. Moti Yung integrates Internet privacy with Computer security in his research. Moti Yung combines topics linked to Homomorphic encryption with his work on Encryption. His research on Homomorphic encryption often connects related topics like Encryption. Moti Yung integrates several fields in his works, including Public-key cryptography and Blind signature. Many of his studies on Blind signature apply to Hash function as well. Many of his studies involve connections with topics such as Ring signature and Hash function. Moti Yung merges many fields, such as Ring signature and Digital signature, in his writings.

Moti Yung most often published in these fields:

Computer security (90.00%)
Encryption (65.00%)
Public-key cryptography (55.00%)

What were the highlights of his more recent work (between 2016-2020)?

Computer security (100.00%)
Programming language (100.00%)
Computer network (50.00%)

In recent works Moti Yung was focusing on the following fields of study:

Computer network and Encryption are fields of study that intersect with his Computer security study. Moti Yung combines Computer network and Computer security in his studies. His research combines Substitution (logic) and Programming language. His study in Secure multi-party computation extends to Computation with its themes. In his research, Moti Yung performs multidisciplinary study on Theoretical computer science and Computation. With his scientific publications, his incorporates both Algorithm and Programming language.

Between 2016 and 2020, his most popular works were:

Proactive Secure Multiparty Computation with a Dishonest Majority (11 citations)
Subvert KEM to Break DEM: Practical Algorithm-Substitution Attacks on Public-Key Encryption (10 citations)

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)

2197 Citations

Advances in Cryptology - EUROCRYPT 2004

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

1970 Citations

Perfectly-Secure Key Distribution for Dynamic Conferences

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

1476 Citations

Universal one-way hash functions and their cryptographic applications

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

1269 Citations

Public-key cryptosystems provably secure against chosen ciphertext attacks

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

1260 Citations

Advances in Cryptology - CRYPTO 2002

Moti Yung.
(2002)

1192 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)

1047 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)

1018 Citations

How to withstand mobile virus attacks (extended abstract)

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

627 Citations

Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords

Jonathan Katz;Rafail Ostrovsky;Moti Yung.
theory and application of cryptographic techniques (2001)

551 Citations

If you think any of the details on this page are incorrect, let us know.