scispace - formally typeset
T

Tadayoshi Kohno

Researcher at University of Washington

Publications -  236
Citations -  20751

Tadayoshi Kohno is an academic researcher from University of Washington. The author has contributed to research in topics: Encryption & Cryptography. The author has an hindex of 66, co-authored 213 publications receiving 18044 citations. Previous affiliations of Tadayoshi Kohno include University of California, Berkeley & Cigital.

Papers
More filters
Proceedings Article

Physical Adversarial Examples for Object Detectors

TL;DR: In this paper, the authors extend physical attacks to more challenging object detection models, a broader class of deep learning algorithms widely used to detect and label multiple objects within a scene, and demonstrate the transferability of their adversarial perturbations.
Proceedings ArticleDOI

A spotlight on security and privacy risks with future household robots: attacks and lessons

TL;DR: This research experimentally analyze three of today's household robots for security and privacy vulnerabilities and synthesizes the results to construct a set of design questions aimed at facilitating the future development of household robots that are secure and preserve their users' privacy.
Journal Article

Helix : Fast encryption and authentication in a single cryptographic primitive

TL;DR: Helix as discussed by the authors is a high-speed stream cipher with a built-in MAC functionality on a Pentium II CPU it is about twice as fast as Rijn-dael or Twofish, and comparable in speed to RC4.
Proceedings Article

Devices that tell on you: privacy trends in consumer ubiquitous computing

TL;DR: Despite an opportunity to provide significantly more location privacy than existing devices, like RFIDs, it is found that an attacker can trivially exploit the Nike+iPod Sport Kit's design to track users and uncover security issues with the way Microsoft Zunes manage their social relationships.

Hash function balance and its impact on birthday attacks

TL;DR: In this paper, a measure of the "amount of regularity" of a hash function is introduced, and the success rate of the birthday attack is estimated as a function of the balance of the hash function being attacked.