Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Charalampos
Charalampos Andrianakis, Crete GR
| Patent application number | Description | Published |
|---|---|---|
| 20110099620 | Malware Detector - A transparent proxy for malware detection includes a monitor module, a protocol determination module, a challenge generation module, a response determination module, and a data control module. The monitor module examines data originating from an application towards a remote server. The protocol determination module identifies the protocol type used for the data. The challenge generation module produces a challenge for the application based upon the protocol type, sends the challenge to the application, and maintains a state related to the data and the challenge. The response determination module makes a determination if an automatic non-interactive application response is received in response to the challenge from the application. The data control module allows the first data to continue to the remote server when the determination is valid. The data control module reports malware detection and blocks the data to continue to the remote server when the determination is invalid. | 04-28-2011 |
Charalampos Andrianakis, Fairfax, VA US
| Patent application number | Description | Published |
|---|---|---|
| 20110164506 | Inferring Packet Management Rules - Embodiments of the present invention include a system or method for inferring packet management rules of a packet management device. A probing device is used to extract at least one of port number and IP address from a packet management configuration file. The probing device classifies extracted numbers and selectively transmits packets to a packet management device. A packet analyzer notifies the probing device when a packet passes through the packet management device. Based on the notification, the probing device is able to transmit packets to the packet management device in a non-exhaustive manner and determine a port range corresponding to a packet management rule. | 07-07-2011 |
Charalampos Kosmas, Illioupolis GR
Charalampos Papamanthou, Providence, RI US
| Patent application number | Description | Published |
|---|---|---|
| 20110225429 | CRYPTOGRAPHIC ACCUMULATORS FOR AUTHENTICATED HASH TABLES - In one exemplary embodiment, an apparatus includes a memory storing data and a processor performing operations. The apparatus generates or maintains an accumulation tree for the stored data—an ordered tree structure with a root node, leaf nodes and internal nodes. Each leaf node corresponds to a portion of the data. A depth of the tree remains constant. A bound on a degree of each internal node is a function of a number of leaf nodes of a subtree rooted at the internal node. Each node of the tree has an accumulation value. Accumulation values of the root and internal nodes are determined by hierarchically employing an accumulator over the accumulation values of the nodes lying one level below the node in question. The accumulation value of the root node is a digest for the tree. | 09-15-2011 |
Charalampos Papamanthou, Berkeley, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20120030468 | SYSTEM AND METHOD FOR OPTIMAL VERIFICATION OF OPERATIONS ON DYNAMIC SETS - A system and method for cryptographically checking the correctness of outsourced set operations performed by an untrusted server over a dynamic collection of sets that are owned (and updated) by a trusted source is disclosed. The system and method provides new authentication mechanisms that allow any entity to publicly verify a proof attesting the correctness of primitive set operations such as intersection, union, subset and set difference. Based on a novel extension of the security properties of bilinear-map accumulators as well as on a primitive called accumulation tree, the system and method achieves optimal verification and proof complexity, as well as optimal update complexity, while incurring no extra asymptotic space overhead. The method provides an efficient proof construction, adding a logarithmic overhead to the computation of the answer of a set-operation query. Applications of interest include efficient verification of keyword search and database queries. | 02-02-2012 |
Charalampos Pozidie, Gattikon CH
| Patent application number | Description | Published |
|---|---|---|
| 20080225676 | Data storage device and control - The present invention provides data storage devices, systems and methods. An example device includes: a storage medium for storing data in the form of marks; and at least one probe. The probe(s) and storage medium are operable to move relative to each other, with each probe comprising a tip facing the storage medium and having a force creating unit associated thereto. The force creating units are operable to create a force acting between the tip and said storage medium. The data storage device is operable to erase an indentation mark in the storage medium by way of controlling the force creating unit for creating at least one erase force pulse with a force rise time being less than or equal to the order of 1 microsecond. | 09-18-2008 |