PPT-Pass-The-Hash: Gaining Root Access to Your Network

PassTheHash Gaining Root Access to Your Network June 24 2014 Tim Slaybaugh Cyber Incident Analyst Northrop Grumman Information Systems What is PassTheHash Attackers using PtH completely compromise just about every network they hit Pretty much every APT attack team uses them. Mark Russinovich Technical Fellow. Microsoft Azure. Nathan Ide Principal Dev Lead. Microsoft Windows. Pass-the-Hash == Single-Sign On. Pass-the-hash is the use of a saved credential or authenticator . Linear Probing. Uri Zwick. Tel Aviv University. Hashing with open addressing. “Uniform probing”. Insert key . in the first free position among.  . (Sometimes) assumed to be a . permutation. To search, follow the same order. MapReduce. Karim Ibrahim. Anh Pham. 1. Outline. Motivation & Introduction. Benchmarking . study. Optimizing . Hadoop. Motivation. 3. Motivation (. cont. ’). Motivation. :. MapReduce. model is not well suited for one pass analytics.. . Sections 5.3, 5.4, 5.5, 5.6. 2. Designing a Hash Table. Hash function: establishing a key with an indexed location in a hash table.. E.g. . Index = hash(key) % table_size;. Resolve conflicts: . Need to handle case where multiple keys mapped to the same index.. CIS 606. Spring 2010. Hash tables. Many applications require a dynamic set that supports only the . dictionary . operations . INSERT. , SEARCH, and DELETE. Example: a symbol table in a compiler.. A hash table is effective for implementing a dictionary.. (the Page Table). Idan Yaniv. , . Dan . Tsafrir. SIGMETRICS / IFIP 2016. “ Virtual . memory was . invented. in . a time of . scarcity.. Is . it still a good idea. ? ”. Charles Thacker,. ACM . Turing Award Lecture, . By. Ted Stubbersfield. A LITTLE BIT OF SOUL SEARCHING. Before asking HOW we get more support we need to ask WHY we should be supported. A LITTLE BIT OF SOUL SEARCHING. Socrates – An unexamined life is not worth living. By – . Debanjan. . Sadhya. (iwc2011013). Mayank. . Swarnkar. (iwc2011026). Contents. Introduction. Definition. Properties of SHA. SHA Functions. SHA Constants. Preprocessing in SHA. Hashing in SHA. Kai Li, Guo-Jun Qi, Jun Ye, Tuoerhongjiang Yusuph, Kien A. Hua. Department of Computer Science. University of Central Florida. ISM 2016. Presented by . Tuoerhongjiang Yusuph. Introduction. Massive amount of high-dimensional data, high computational costs …. We have:. Discussed techniques for hashing. Discussed mapping down to a given range . 0, ..., . M. – 1. Now we must deal with collisions. Numerous techniques exist. Containers in general. Specifically linked lists. n. . . [from the . techspeak. ] (var. ‘hash clash’) . When used of people, signifies a confusion in associative memory or imagination, especially a persistent one.” . . -. The Hacker's Dictionary . Uri Zwick. Tel Aviv University. Started: . April . 2015. Last update: . January 12, 2017. Hashing with open addressing. “Uniform probing”. Insert key . in the first free position among.  . (Sometimes) assumed to be a . CSE 373: Data Structures and Algorithms. Thanks to Kasey Champion, Ben Jones, Adam Blank, Michael Lee, Evan McCarty, Robbie Weber, Whitaker Brand, Zora Fung, Stuart . Reges. , Justin Hsia, Ruth Anderson, and many others for sample slides and materials .... A common approach is to use a . Distributed Hash Table. (DHT). to organize . nodes. Traditional . hash functions convert a key to a hash value, which can be used as an index into a hash table.. Keys are unique.