Patents by Inventor Alptekin küpçü

Alptekin küpçü has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Apparatus, methods, and computer program products providing dynamic provable data possession
    Patent number: 8978155
    Abstract: In one exemplary embodiment, a method includes: storing data for a file, organized as blocks, each having a portion of the file; and maintaining a skip list for the data. The skip list is an ordered tree structure having a root node, internal nodes and leaf nodes. Each leaf node corresponds to a block. Each node has a rank value corresponding to size of a subtree rooted at the node. The skip list employs a hashing scheme. The hash value of the root node and internal nodes is computed from a level of the node, the rank value and an interval between the node and another linked node to the right of or below the node. The hash value of the leaf nodes is computed from a level of the node, the rank value and an interval associated with the node.
    Type: Grant
    Filed: July 24, 2009
    Date of Patent: March 10, 2015
    Assignee: Brown University
    Inventors: Charles Christopher Erway, Alptekin Küpçü, Charalampos Papamanthou, Roberto Tamassia
  • APPARATUS, METHODS, AND COMPUTER PROGRAM PRODUCTS PROVIDING DYNAMIC PROVABLE DATA POSSESSION
    Publication number: 20130198854
    Abstract: In one exemplary embodiment, a method includes: storing data for a file, organized as blocks, each having a portion of the file; and maintaining a skip list for the data. The skip list is an ordered tree structure having a root node, internal nodes and leaf nodes. Each leaf node corresponds to a block. Each node has a rank value corresponding to size of a subtree rooted at the node. The skip list employs a hashing scheme. The hash value of the root node and internal nodes is computed from a level of the node, the rank value and an interval between the node and another linked node to the right of or below the node. The hash value of the leaf nodes is computed from a level of the node, the rank value and an interval associated with the node.
    Type: Application
    Filed: July 24, 2009
    Publication date: August 1, 2013
    Inventors: Charles Christopher Erway, Alptekin küpçü, Charalampos Papamanthou, Roberto Tamassia