Patents by Inventor Ido SHAHAF

Ido SHAHAF 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).

  • Searchable symmetric encryption with enhanced locality via balanced allocations
    Patent number: 10331913
    Abstract: A method for searchable symmetric encryption. The method includes: accessing a computerized database that comprises keyword lists, each of the keyword lists comprising memory addresses of electronic documents that all contain a respective keyword; binning the memory addresses by performing balanced allocation of the memory addresses into ordered bins, such that at least some of the ordered bins each contains memory addresses of electronic documents that contain different keywords; encrypting each of the memory addresses with an encryption key that is derived from the keyword of the respective memory address; and storing the ordered bins at consecutive locations in a non-transient computer-readable memory, wherein the consecutive locations preserve the order of the ordered bins.
    Type: Grant
    Filed: January 19, 2017
    Date of Patent: June 25, 2019
    Assignees: Yissum Research Development Company of the Hebrew University of Jerusalem Ltd., Yeda Research and Development Co. Ltd.
    Inventors: Gil Segev, Ido Shahaf, Gilad Asharov, Moni Naor
  • SEARCHABLE SYMMETRIC ENCRYPTION WITH ENHANCED LOCALITY VIA BALANCED ALLOCATIONS
    Publication number: 20190026502
    Abstract: A method for searchable symmetric encryption. The method includes: accessing a computerized database that comprises keyword lists, each of the keyword lists comprising memory addresses of electronic documents that all contain a respective keyword; binning the memory addresses by performing balanced allocation of the memory addresses into ordered bins, such that at least some of the ordered bins each contains memory addresses of electronic documents that contain different keywords; encrypting each of the memory addresses with an encryption key that is derived from the keyword of the respective memory address; and storing the ordered bins at consecutive locations in a non-transient computer-readable memory, wherein the consecutive locations preserve the order of the ordered bins.
    Type: Application
    Filed: January 19, 2017
    Publication date: January 24, 2019
    Applicants: Yissum Research Development Company of the Hebrew University of Jerusalem Ltd., Yeda Research and Development Co. Ltd.
    Inventors: Gil SEGEV, Ido SHAHAF, Gilad ASHAROV, Moni NAOR