A
Anton Mityagin
Researcher at Microsoft
Publications - 40
Citations - 1431
Anton Mityagin is an academic researcher from Microsoft. The author has contributed to research in topics: Authenticated Key Exchange & Key (cryptography). The author has an hindex of 17, co-authored 40 publications receiving 1345 citations. Previous affiliations of Anton Mityagin include University of California, San Diego & University of California, Los Angeles.
Papers
More filters
Patent
Detecting zero-result search queries
Anton Mityagin,Kumar Chellapilla +1 more
TL;DR: A processing device and method for determining whether a zero search result may be produced with respect to a search for a document including all words of a word group is presented in this article.
Proceedings ArticleDOI
GigaHash: scalable minimal perfect hashing for billions of urls
TL;DR: A scalable high performance algorithm based on random graphs for constructing minimal perfect hash functions (MPHFs) that is easy to parallelize and scales well to very large data sets encountered in internet search applications.
Posted Content
Stronger Security of Authenticated Key Exchange.
TL;DR: This work extends the Canetti-Krawczyk model for AKE security by providing significantly greater powers to the adversary and introduces a new AKE protocol called NAXOS to prove that it is secure against these stronger adversaries.
Book ChapterDOI
Hard instances of the constrained discrete logarithm problem
TL;DR: In this article, the authors study explicit construction of sets for which the constrained discrete logarithm problem is hard and develop geometric tools such as generalized Menelaus theorem for proving lower bounds on the complexity of the constrained DLP.
Patent
Minimal perfect hash functions using double hashing
Kumar Chellapilla,Anton Mityagin +1 more
TL;DR: In this paper, a hash table is constructed by double hashing each of the strings in a set of strings, and a computed double hash value is utilized to identify an empty location in the hash table for each string.