M. Yung
Artificial Intelligence · 1992–2019
A researcher in the Science corpus: 19 papers; trusts 50 researchers and is trusted by 65 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 111 citations into it; #4,533 of 36,961 by trust here, #4,263 by citations
- Privacy & Security — 51 citations into it
- Computer Networks and Communications — 43 citations into it; #4,317 of 9,996 by trust here, #5,434 by citations
- Information Systems — 32 citations into it; #3,891 of 9,233 by trust here, #7,803 by citations
- Computer Vision and Pattern Recognition — 30 citations into it; #5,930 of 21,973 by trust here, #7,659 by citations
- Computational Theory and Mathematics — 23 citations into it; #10,903 of 12,489 by trust here, #9,011 by citations
- Discrete Mathematics and Combinatorics — 13 citations into it
- Algorithms & Complexity — 12 citations into it
Whom M. Yung trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Shafi Goldwasser
- Mihir Bellare
- Ran Canetti
- Silvio Micali
- R. Rivest
- Oded Goldreich
- Eiichiro Fujisaki
- Benny Chor
- Aggelos Kiayias
- Adi Shamir
Who trusts M. Yung overall
- Yuval Ishai
- Jens Groth
- Aggelos Kiayias
- Cécile Delerablée
- Dan Boneh
- Xavier Boyen
- Michel Abdalla
- Fangguo Zhang
- Jan Camenisch
- Douglas Wikström
Papers from M. Yung's perspective
Ordered by how strongly the researchers M. Yung trusts endorse each paper. Same corpus, a different order for every researcher.
- New Directions in Cryptography
- Probabilistic Encryption
- Random oracles are practical: a paradigm for designing efficient protocols
- A method for obtaining digital signatures and public-key cryptosystems
- How to share a secret
- Handbook of Applied Cryptography
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Gradient-based learning applied to document recognition
- How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract)
- The Knowledge Complexity of Interactive Proof Systems
Their papers
- On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications (2019) — 51 citations
- Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions (2017) — 102 citations
- Key-Insulated Public Key Cryptosystems (2002) — 412 citations
- Decoding of Interleaved Reed Solomon Codes over Noisy Data (2003) — 118 citations
- Differentially-Private "Draw and Discard" Machine Learning (2018) — 39 citations
- A New Randomness Extraction Paradigm for Hybrid Encryption (2009) — 380 citations
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks (extended version) (2009) — 993 citations
- Traceable Signatures (2004) — 1,383 citations
- Scalable Protocols for Authenticated Group Key Exchange (2003) — 544 citations
- Backdoor Attacks on Black-Box Ciphers Exploiting Low-Entropy Plaintexts (2003) — 16 citations
- Traitor Tracing with Constant Transmission Rate (2002) — 677 citations
- Advances in Cryptology — CRYPTO 2002 (2002) — 772 citations
- Self Protecting Pirates and Black-Box Traitor Tracing (2001) — 1,137 citations
- Secure Games with Polynomial Expressions (2001) — 49 citations
- Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords (2001) — 440 citations
- Polynomial Reconstruction Based Cryptography (2001) — 1,338 citations
- Non-interactive cryptocomputing for NC/sup 1/ (1999)
- Proactive Secret Sharing Or: How to Cope With Perpetual Leakage (1995)
- Communication complexity of secure computation (extended abstract) (1992)