G
Gene Tsudik
Researcher at University of California, Irvine
Publications - 465
Citations - 32121
Gene Tsudik is an academic researcher from University of California, Irvine. The author has contributed to research in topics: Authentication & The Internet. The author has an hindex of 90, co-authored 448 publications receiving 30539 citations. Previous affiliations of Gene Tsudik include University of California & University of Southern California.
Papers
More filters
Patent
Personal key archive
TL;DR: In this article, the authors describe an automated management system for managing keys to encrypt and decrypt stored data on the computing system, which includes an authentication server, a key client, a generator, and an encrypted data file memory.
Book ChapterDOI
Towards an analysis of onion routing security
TL;DR: In this paper, the authors present a security analysis of Onion Routing, an application independent infrastructure for traffic-analysis resistant and anonymous Internet connections, including an overview of the current system design, definitions of security goals and new adversary models.
Proceedings ArticleDOI
CLIQUES: a new approach to group key agreement
TL;DR: In this article, a protocol suite, called CLIQUES, is developed by extending the well known Diffie-Hellman key agreement method to support dynamic group operations, which is provably secure and efficient.
Proceedings ArticleDOI
Flooding for reliable multicast in multi-hop ad hoc networks
TL;DR: It is demonstrated that even flooding is insufficient for reliable multicast in ad hoc networks when mobility is very high, and traditional multicast approaches are not appropriate.
Journal ArticleDOI
Efficient and provably secure aggregation of encrypted data in wireless sensor networks
TL;DR: This article proposes a simple and provably secure encryption scheme that allows efficient additive aggregation of encrypted data and constructs an end-to-end aggregate authentication scheme that is secure against outsider-only attacks, based on the indistinguishability property of a pseudorandom function (PRF), a standard cryptographic primitive.