Yiqun Lisa Yin

Annual International Cryptology Conference · 1995–2005

A researcher in the Science corpus: 3 papers; trusts 6 researchers and is trusted by 7 researchers here, as inferred from the citation graph.

Whom Yiqun Lisa Yin trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Xiaoyun Wang
2. Nick Littlestone
3. Hongbo Yu
4. Leslie G. Valiant

Who trusts Yiqun Lisa Yin overall

1. Frank J. Balbach
2. Andrey Bogdanov
3. M.M.J. Stevens
4. Dennis Hofheinz
5. Xiaoyun Wang
6. Shai Ben-David

Papers from Yiqun Lisa Yin's perspective

Ordered by how strongly the researchers Yiqun Lisa Yin trusts endorse each paper. Same corpus, a different order for every researcher.

1. Efficient Collision Search Attacks on SHA-0 (Annual International Cryptology Conference)
2. Cryptanalysis of the Hash Functions MD4 and RIPEMD (International Conference on the Theory and Application of Cryptographic Techniques)
3. How to Break MD5 and Other Hash Functions (International Conference on the Theory and Application of Cryptographic Techniques)
4. A theory of the learnable
5. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities
6. On the complexity of teaching
7. Pseudo-random generation from one-way functions
8. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
9. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
10. A public key cryptosystem and a signature scheme based on discrete logarithms

Their papers

• Efficient Collision Search Attacks on SHA-0 (2005) — 452 citations
• Finding Collisions in the Full SHA-1 (2005) — 1,657 citations
• Being taught can be faster than asking questions (1995)