Get Even More Visitors To Your Blog, Upgrade To A Business Listing >>

Metadefender CVEs, Hashes, Application Installers Report: May 8-15

The OPSWAT Metadefender Vulnerability Engine identifies known application vulnerabilities and reports them by severity level. The Vulnerability Engine allows system administrators to identify vulnerabilities in files and data being brought into a secure network and on endpoints within a network, significantly expediting remediation of the issue.

Common Vulnerabilities and Exposures (CVE) is a catalog of publicly known cyber security vulnerabilities that's sponsored by the United States Department of Homeland Security. The first table below lists the new CVEs and product versions for which support was added to the Metadefender database during the week of May 8-15, 2017. The second table lists the hashes and application installers for which support was added.

Learn more about the Metadefender Vulnerability Engine:

LEARN MORE

Newly Supported CVEs and Product Versions as of May 15, 2017

PRODUCT VENDOR VERSION CVE CVE DETAILS CVSS SCORE
Adobe Flash Player Adobe Systems Inc. 25.0.0.163 and prior CVE-2017-3070 https://nvd.nist.gov/vuln/detail/CVE-2017-3070 10
Adobe Flash Player Adobe Systems Inc. 25.0.0.163 and prior CVE-2017-3069 https://nvd.nist.gov/vuln/detail/CVE-2017-3069 10
Adobe Flash Player Adobe Systems Inc. 25.0.0.163 and prior CVE-2017-3068 https://nvd.nist.gov/vuln/detail/CVE-2017-3068 10
Adobe Flash Player Adobe Systems Inc. 25.0.0.163 and prior CVE-2017-3071 https://nvd.nist.gov/vuln/detail/CVE-2017-3071 10
Adobe Flash Player Adobe Systems Inc. 25.0.0.163 and prior CVE-2017-3072 https://nvd.nist.gov/vuln/detail/CVE-2017-3072 10
Adobe Flash Player Adobe Systems Inc. 25.0.0.163 and prior CVE-2017-3073 https://nvd.nist.gov/vuln/detail/CVE-2017-3073 10
Adobe Flash Player Adobe Systems Inc. 25.0.0.163 and prior CVE-2017-3074 https://nvd.nist.gov/vuln/detail/CVE-2017-3074 10
IrfanView Irfan Skiljan 4.44 and prior CVE-2017-7721 https://nvd.nist.gov/vuln/detail/CVE-2017-7721 2.6
Python Python Software Foundation 3.6 and prior CVE-2016-2183 https://nvd.nist.gov/vuln/detail/CVE-2016-2183 5
Google Chrome Google Inc. 57.0.2987.75 and prior CVE-2017-5031 https://nvd.nist.gov/vuln/detail/CVE-2017-5031 6.8

Newly Supported Hashes and Installers as of May 15, 2017

HASH PRODUCT SIGNATURE PRODUCT VERSION DESCRIPTION FILE NAME
BFC98B82D38CE7A736AAD745A8AF64245853D5F1 - - - smb2.sys file of the Windows 7 srv2_windows_7_smb2.sys
BFC98B82D38CE7A736AAD745A8AF64245853D5F1 - - - smb2.sys file of the Windows 7 srv2_windows_7_smb2.sys
BFC98B82D38CE7A736AAD745A8AF64245853D5F1 - - - smb2.sys file of the Windows 7 srv2_windows_7_smb2.sys
BFC98B82D38CE7A736AAD745A8AF64245853D5F1 - - - smb2.sys file of the Windows 7 srv2_windows_7_smb2.sys
BFC98B82D38CE7A736AAD745A8AF64245853D5F1 - - - smb2.sys file of the Windows 7 srv2_windows_7_smb2.sys
BFC98B82D38CE7A736AAD745A8AF64245853D5F1 - - - smb2.sys file of the Windows 7 srv2_windows_7_smb2.sys
00104387CC7501593A39E6FC1671EF27E7232739 - - - Smb 2.0 Server Driver File of the Windows 8.1 Enterprise Win8.1_Enterprise_srv2.sys
00104387CC7501593A39E6FC1671EF27E7232739 - - - Smb 2.0 Server Driver File of the Windows 8.1 Enterprise Win8.1_Enterprise_srv2.sys
00104387CC7501593A39E6FC1671EF27E7232739 - - - Smb 2.0 Server Driver File of the Windows 8.1 Enterprise Win8.1_Enterprise_srv2.sys
00104387CC7501593A39E6FC1671EF27E7232739 - - - Smb 2.0 Server Driver File of the Windows 8.1 Enterprise Win8.1_Enterprise_srv2.sys
00104387CC7501593A39E6FC1671EF27E7232739 - - - Smb 2.0 Server Driver File of the Windows 8.1 Enterprise Win8.1_Enterprise_srv2.sys
00104387CC7501593A39E6FC1671EF27E7232739 - - - Smb 2.0 Server Driver File of the Windows 8.1 Enterprise Win8.1_Enterprise_srv2.sys
Vulnerabilities
Vulnerability Engine
CVEs
JS: 
var stIsIE = /*@cc_on!@*/false; sorttable = { init: function() { // quit if this function has already been called if (arguments.callee.done) return; // flag this function so we don't do the same thing twice arguments.callee.done = true; // kill the timer if (_timer) clearInterval(_timer); if (!document.createElement || !document.getElementsByTagName) return; sorttable.DATE_RE = /^(\d\d?)[\/\.-](\d\d?)[\/\.-]((\d\d)?\d\d)$/; forEach(document.getElementsByTagName('table'), function(table) { if (table.className.search(/\bsortable\b/) != -1) { sorttable.makeSortable(table); } }); }, makeSortable: function(table) { if (table.getElementsByTagName('thead').length == 0) { // table doesn't have a tHead. Since it should have, create one and // put the first table row in it. the = document.createElement('thead'); the.appendChild(table.rows[0]); table.insertBefore(the,table.firstChild); } // Safari doesn't support table.tHead, sigh if (table.tHead == null) table.tHead = table.getElementsByTagName('thead')[0]; if (table.tHead.rows.length != 1) return; // can't cope with two header rows // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as // "total" rows, for example). This is B&R, since what you're supposed // to do is put them in a tfoot. So, if there are sortbottom rows, // for backwards compatibility, move them to tfoot (creating it if needed). sortbottomrows = []; for (var i=0; i5' : ' ▴'; this.appendChild(sortrevind); return; } if (this.className.search(/\bsorttable_sorted_reverse\b/) != -1) { // if we're already sorted by this column in reverse, just // re-reverse the table, which is quicker sorttable.reverse(this.sorttable_tbody); this.className = this.className.replace('sorttable_sorted_reverse', 'sorttable_sorted'); this.removeChild(document.getElementById('sorttable_sortrevind')); sortfwdind = document.createElement('span'); sortfwdind.id = "sorttable_sortfwdind"; sortfwdind.innerHTML = stIsIE ? '&nbsp6' : ' ▾'; this.appendChild(sortfwdind); return; } // remove sorttable_sorted classes theadrow = this.parentNode; forEach(theadrow.childNodes, function(cell) { if (cell.nodeType == 1) { // an element cell.className = cell.className.replace('sorttable_sorted_reverse',''); cell.className = cell.className.replace('sorttable_sorted',''); } }); sortfwdind = document.getElementById('sorttable_sortfwdind'); if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); } sortrevind = document.getElementById('sorttable_sortrevind'); if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); } this.className += ' sorttable_sorted'; sortfwdind = document.createElement('span'); sortfwdind.id = "sorttable_sortfwdind"; sortfwdind.innerHTML = stIsIE ? '&nbsp6' : ' ▾'; this.appendChild(sortfwdind); // build an array to sort. This is a Schwartzian transform thing, // i.e., we "decorate" each row with the actual sort key, // sort based on the sort keys, and then put the rows back in order // which is a lot faster because you only do getInnerText once per row row_array = []; col = this.sorttable_columnindex; rows = this.sorttable_tbody.rows; for (var j=0; j 12) { // definitely dd/mm return sorttable.sort_ddmm; } else if (second > 12) { return sorttable.sort_mmdd; } else { // looks like a date, but we can't tell which, so assume // that it's dd/mm (English imperialism!) and keep looking sortfn = sorttable.sort_ddmm; } } } } return sortfn; }, getInnerText: function(node) { // gets the text we want to use for sorting for a cell. // strips leading and trailing whitespace. // this is *not* a generic getInnerText function; it's special to sorttable. // for example, you can override the cell text with a customkey attribute. // it also gets .value for fields. if (!node) return ""; hasInputs = (typeof node.getElementsByTagName == 'function') && node.getElementsByTagName('input').length; if (node.getAttribute("sorttable_customkey") != null) { return node.getAttribute("sorttable_customkey"); } else if (typeof node.textContent != 'undefined' && !hasInputs) { return node.textContent.replace(/^\s+|\s+$/g, ''); } else if (typeof node.innerText != 'undefined' && !hasInputs) { return node.innerText.replace(/^\s+|\s+$/g, ''); } else if (typeof node.text != 'undefined' && !hasInputs) { return node.text.replace(/^\s+|\s+$/g, ''); } else { switch (node.nodeType) { case 3: if (node.nodeName.toLowerCase() == 'input') { return node.value.replace(/^\s+|\s+$/g, ''); } case 4: return node.nodeValue.replace(/^\s+|\s+$/g, ''); break; case 1: case 11: var innerText = ''; for (var i = 0; i =0; i--) { tbody.appendChild(newrows[i]); } delete newrows; }, /* sort functions each sort function takes two parameters, a and b you are comparing a[0] and b[0] */ sort_numeric: function(a,b) { aa = parseFloat(a[0].replace(/[^0-9.-]/g,'')); if (isNaN(aa)) aa = 0; bb = parseFloat(b[0].replace(/[^0-9.-]/g,'')); if (isNaN(bb)) bb = 0; return aa-bb; }, sort_alpha: function(a,b) { if (a[0]==b[0]) return 0; if (a[0] 0 ) { var q = list[i]; list[i] = list[i+1]; list[i+1] = q; swap = true; } } // for t--; if (!swap) break; for(var i = t; i > b; --i) { if ( comp_func(list[i], list[i-1]) "); var script = document.getElementById("__ie_onload"); script.onreadystatechange = function() { if (this.readyState == "complete") { sorttable.init(); // call the onload handler } }; /*@end @*/ /* for Safari */ if (/WebKit/i.test(navigator.userAgent)) { // sniff var _timer = setInterval(function() { if (/loaded|complete/.test(document.readyState)) { sorttable.init(); // call the onload handler } }, 10); } /* for other browsers */ window.onload = sorttable.init; // written by Dean Edwards, 2005 // with input from Tino Zijdel, Matthias Miller, Diego Perini // http://dean.edwards.name/weblog/2005/10/add-event/ function dean_addEvent(element, type, handler) { if (element.addEventListener) { element.addEventListener(type, handler, false); } else { // assign each event handler a unique ID if (!handler.$$guid) handler.$$guid = dean_addEvent.guid++; // create a hash table of event types for the element if (!element.events) element.events = {}; // create a hash table of event handlers for each element/event pair var handlers = element.events[type]; if (!handlers) { handlers = element.events[type] = {}; // store the existing event handler (if there is one) if (element["on" + type]) { handlers[0] = element["on" + type]; } } // store the event handler in the hash table handlers[handler.$$guid] = handler; // assign a global event handler to do all the work element["on" + type] = handleEvent; } }; // a counter used to create unique IDs dean_addEvent.guid = 1; function removeEvent(element, type, handler) { if (element.removeEventListener) { element.removeEventListener(type, handler, false); } else { // delete the event handler from the hash table if (element.events && element.events[type]) { delete element.events[type][handler.$$guid]; } } }; function handleEvent(event) { var returnValue = true; // grab the event object (IE uses a global event object) event = event || fixEvent(((this.ownerDocument || this.document || this).parentWindow || window).event); // get a reference to the hash table of event handlers var handlers = this.events[event.type]; // execute each event handler for (var i in handlers) { this.$$handleEvent = handlers[i]; if (this.$$handleEvent(event) === false) { returnValue = false; } } return returnValue; }; function fixEvent(event) { // add W3C standard event methods event.preventDefault = fixEvent.preventDefault; event.stopPropagation = fixEvent.stopPropagation; return event; }; fixEvent.preventDefault = function() { this.returnValue = false; }; fixEvent.stopPropagation = function() { this.cancelBubble = true; } // Dean's forEach: http://dean.edwards.name/base/forEach.js /* forEach, version 1.0 Copyright 2006, Dean Edwards License: http://www.opensource.org/licenses/mit-license.php */ // array-like enumeration if (!Array.forEach) { // mozilla already supports this Array.forEach = function(array, block, context) { for (var i = 0; i


This post first appeared on OPSWAT, please read the originial post: here

Share the post

Metadefender CVEs, Hashes, Application Installers Report: May 8-15

×

Subscribe to Opswat

Get updates delivered right to your inbox!

Thank you for your subscription

×