Gene Tsudik
Artificial Intelligence · 2000–2016
A researcher in the Science corpus: 20 papers; trusts 60 researchers and is trusted by 59 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 110 citations into it; #4,160 of 35,345 by trust here, #4,722 by citations
- Computer Networks and Communications — 77 citations into it; #1,119 of 9,886 by trust here, #774 by citations
- Information Systems — 37 citations into it; #2,546 of 8,771 by trust here, #2,203 by citations
- Signal Processing — 32 citations into it; #6,292 of 7,572 by trust here, #2,990 by citations
- Privacy & Security — 22 citations into it; #653 of 709 by trust here, #615 by citations
- Computer Vision and Pattern Recognition — 20 citations into it
- Computational Theory and Mathematics — 19 citations into it; #4,060 of 12,182 by trust here, #4,850 by citations
- Hardware and Architecture — 17 citations into it
Whom Gene Tsudik trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Gildas Avoine
- Mihir Bellare
- Michael J. Freedman
- David A. Molnar
- Dan Boneh
- Carmit Hazay
- Claus-Peter Schnorr
- R. Rivest
- Pascal Paillier
- Stanislaw Jarecki
Who trusts Gene Tsudik overall
- Alex Davidson
- Jonathan Katz
- Jan Camenisch
- Benny Pinkas
- Lingjuan Lyu
- Giuseppe Ateniese
- Yongdae Kim
- George Danezis
- Yan Huang
- Seyit Ahmet Camtepe
Papers from Gene Tsudik's perspective
Ordered by how strongly the researchers Gene Tsudik trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- New Directions in Cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Protocols for secure computations
- Handbook of Applied Cryptography
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Untraceable electronic mail, return addresses, and digital pseudonyms
- Private information retrieval
Their papers
- A minimalist approach to Remote Attestation (2014) — 146 citations
- Practical Private Set Intersection Protocols with Linear Complexity (2010) — 447 citations
- A Privacy-Preserving Index for Range Queries (2004) — 510 citations
- Countering GATTACA: efficient and secure testing of fully-sequenced human genomes (2011) — 279 citations
- C-FLAT: Control-Flow Attestation for Embedded Systems Software (2016) — 324 citations
- Looking ahead in pervasive computing: Challenges and opportunities in the era of cyber-physical convergence (2012) — 306 citations
- SMART: Secure and Minimal Architecture for (Establishing Dynamic) Root of Trust (2012) — 363 citations
- Fast and Private Computation of Cardinality of Set Intersection and Union (2012) — 249 citations
- Privacy-Oriented Cryptography (Dagstuhl Seminar 12381) (2012)
- Named Data Networking (NDN) Project (2010) — 1,034 citations
- Scalable and efficient provable data possession (2008) — 1,512 citations
- YA-TRAP: yet another trivial RFID authentication protocol (2006) — 322 citations
- Authentication and integrity in outsourced databases (2006) — 482 citations
- Efficient aggregation of encrypted data in wireless sensor networks (2005) — 619 citations
- Tree-based group key agreement (2004) — 587 citations
- Towards an Analysis of Onion Routing Security (2000) — 395 citations
- New multiparty authentication services and key agreement protocols (2000) — 338 citations
- A Practical and Provably Secure Coalition-Resistant Group Signature Scheme (2000) — 913 citations
- Key Agreement in Dynamic Peer Groups (2000) — 668 citations
- Simple and fault-tolerant key agreement for dynamic collaborative groups (2000) — 557 citations