Patents by Inventor Charalampos Papamanthou
Charalampos Papamanthou 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).
-
Patent number: 10985902Abstract: Described herein is an efficient, dynamic Symmetric Searchable Encryption (SSE) scheme. A client computing device includes a plurality of files and a dictionary of keywords. An index is generated that indicates, for each keyword and each file, whether a file includes a respective keyword. The index is encrypted and transmitted (with encryptions of the files) to a remote repository. The index is dynamically updateable at the remote repository, and can be utilized to search for files that include keywords in the dictionary without providing the remote repository with information that identifies content of the file or the keyword.Type: GrantFiled: December 5, 2014Date of Patent: April 20, 2021Assignee: Microsoft Technology Licensing, LLCInventors: Seny Fakaba Kamara, Charalampos Papamanthou
-
Patent number: 10409845Abstract: Methods and apparatus are provided for authenticated pattern matching and authenticated exact path queries on outsourced data by a third party server. A source of the outsourced data computes verification information for node and suffix accumulators and sends the data, accumulation values and suffix tree or label trie information to the server; and publishes its public key and the verification digests. The verification may comprise an accumulation tree (AT) or any other public key authentication scheme, such as digital signatures, Merkle Trees and publishing the accumulation values. The server receives the query from a client and the server computes an answer ? to the query and a verification proof that are provided to the client. The client then verifies the answer.Type: GrantFiled: March 15, 2013Date of Patent: September 10, 2019Assignee: EMC IP Holding Company LLCInventors: Charalampos Papamanthou, Roberto Tamassia, Nikolaos Triandopoulos, Dimitrios Papadopoulos, Edward Joseph Tremel
-
Patent number: 10148291Abstract: Certain embodiments of the present invention involve a method of storing an erasure coded copy of block data, and storing newly updated block data into a separate erasure-coded log structure. The method also includes auditing both the erasure copy of block data and the newly updated block data. The erasure copy of block data and the newly updated block data are probabilistically checked during the audit. In certain other embodiments the newly updated block data is stored in a log structure.Type: GrantFiled: April 24, 2015Date of Patent: December 4, 2018Assignees: University of Maryland, College Park, The Regents of the University of CaliforniaInventors: Elaine Shi, Emil Stefanov, Charalampos Papamanthou
-
Publication number: 20150309863Abstract: Certain embodiments of the present invention involve a method of storing an erasure coded copy of block data, and storing newly updated block data into a separate erasure-coded log structure. The method also includes auditing both the erasure copy of block data and the newly updated block data. The erasure copy of block data and the newly updated block data are probabilistically checked during the audit. In certain other embodiments the newly updated block data is stored in a log structure.Type: ApplicationFiled: April 24, 2015Publication date: October 29, 2015Inventors: Elaine SHI, Emil STEFANOV, Charalampos PAPAMANTHOU
-
Patent number: 9152716Abstract: An improved search engine technique allows a user to ensure that an untrusted search engine provides complete and correct search results without requiring large proofs for large data collections. Thus techniques are presented for a trusted crawler to index a distributed collection of documents and create an authenticated search structure that allows an untrusted search server to return reliably complete and correct search results.Type: GrantFiled: December 31, 2012Date of Patent: October 6, 2015Assignee: EMC CorporationInventors: Nikolaos Triandopoulos, Michael T. Goodrich, Duy Nguyen, Olga Ohrimenko, Charalampos Papamanthou, Roberto Tamassia, Cristina Videira Lopes
-
Patent number: 9098725Abstract: 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.Type: GrantFiled: February 26, 2014Date of Patent: August 4, 2015Assignee: Brown UniversityInventors: Charalampos Papamanthou, Roberto Tamassia, Nikolaos Triandopoulos
-
Publication number: 20150156011Abstract: Described herein is an efficient, dynamic Symmetric Searchable Encryption (SSE) scheme. A client computing device includes a plurality of files and a dictionary of keywords. An index is generated that indicates, for each keyword and each file, whether a file includes a respective keyword. The index is encrypted and transmitted (with encryptions of the files) to a remote repository. The index is dynamically updateable at the remote repository, and can be utilized to search for files that include keywords in the dictionary without providing the remote repository with information that identifies content of the file or the keyword.Type: ApplicationFiled: December 5, 2014Publication date: June 4, 2015Inventors: Seny Fakaba Kamara, Charalampos Papamanthou
-
Patent number: 8978155Abstract: 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: GrantFiled: July 24, 2009Date of Patent: March 10, 2015Assignee: Brown UniversityInventors: Charles Christopher Erway, Alptekin Küpçü, Charalampos Papamanthou, Roberto Tamassia
-
Patent number: 8930691Abstract: Described herein is an efficient, dynamic Symmetric Searchable Encryption (SSE) scheme. A client computing device includes a plurality of files and a dictionary of keywords. An index is generated that indicates, for each keyword and each file, whether a file includes a respective keyword. The index is encrypted and transmitted (with encryptions of the files) to a remote repository. The index is dynamically updateable at the remote repository, and can be utilized to search for files that include keywords in the dictionary without providing the remote repository with information that identifies content of the file or the keyword.Type: GrantFiled: August 16, 2011Date of Patent: January 6, 2015Assignee: Microsoft CorporationInventors: Seny Fakaba Kamara, Charalampos Papamanthou
-
Publication number: 20140245006Abstract: 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.Type: ApplicationFiled: February 26, 2014Publication date: August 28, 2014Applicant: Brown UniversityInventors: Charalampos Papamanthou, Roberto Tamassia, Nikolaos Triandopoulos
-
Patent number: 8726034Abstract: 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.Type: GrantFiled: August 28, 2009Date of Patent: May 13, 2014Assignee: Brown UniversityInventors: Charalampos Papamanthou, Roberto Tamassia, Nikolaos Triandopoulos
-
Patent number: 8572385Abstract: 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.Type: GrantFiled: July 29, 2011Date of Patent: October 29, 2013Assignees: Brown University, Boston UniversityInventors: Charalampos Papamanthou, Roberto Tamassia, Nikolaos Triandopoulos
-
Publication number: 20130198854Abstract: 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: ApplicationFiled: July 24, 2009Publication date: August 1, 2013Inventors: Charles Christopher Erway, Alptekin küpçü, Charalampos Papamanthou, Roberto Tamassia
-
Publication number: 20130046974Abstract: Described herein is an efficient, dynamic Symmetric Searchable Encryption (SSE) scheme. A client computing device includes a plurality of files and a dictionary of keywords. An index is generated that indicates, for each keyword and each file, whether a file includes a respective keyword. The index is encrypted and transmitted (with encryptions of the files) to a remote repository. The index is dynamically updateable at the remote repository, and can be utilized to search for files that include keywords in the dictionary without providing the remote repository with information that identifies content of the file or the keyword.Type: ApplicationFiled: August 16, 2011Publication date: February 21, 2013Applicant: Microsoft CorporationInventors: Seny Fakaba Kamara, Charalampos Papamanthou
-
Publication number: 20120030468Abstract: 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.Type: ApplicationFiled: July 29, 2011Publication date: February 2, 2012Inventors: Charalampos Papamanthou, Roberto Tamassia, Nikolaos Triandopoulos
-
Publication number: 20110225429Abstract: 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.Type: ApplicationFiled: August 28, 2009Publication date: September 15, 2011Inventors: Charalampos Papamanthou, Roberto Tamassia, Nikolaos Triandopoulos