The present disclosure relates to the technical field of encryption and decryption methods and apparatus as applied to computing systems. More particularly, the present invention is in the technical field of homomorphic encryption methods and apparatus.
The present invention is a system and/or method for secure web browsing using a homomorphically encrypted query within an end-to-end secure web browser system that uses homomorphic encryption. The system and/or method includes static web pages loaded into data sources of content that support homomorphically encrypted queries. The system and/or method securely executes a user request and/or query using homomorphic encryption techniques, via embedded web browser techniques.
Various embodiments of the present technology include a method of receiving at the client an action via a web browser; converting the action to a query; encrypting the query using a homomorphic encryption scheme at the client; sending the encrypted query from the client to the server. The method further includes receiving at a server an encrypted query from a client, the query encrypted using a homomorphic encryption scheme, the encrypted query received without a key for decrypting the query; evaluating the encrypted query over web content D without decrypting the encrypted query to produce an encrypted response; and sending the encrypted response from the server to the client for decryption at the client. The method further includes receiving at the client the encrypted response from the server; decrypting the response to produce an unencrypted result at the client; and using the unencrypted result at the web browser.
Various embodiments of the present technology include a system including a browser configured to receive an action from a user. The system further includes a client configured to convert the action to a query, encrypt the query using a homomorphic encryption scheme and an encryption key, send the encrypted query to a server without the encryption key, and decrypt an encrypted response using the homomorphic encryption scheme and the key. The system further includes a server configured to receive the encrypted query without the encryption key from the client via a network, evaluate the encrypted query over web content D to generate an encrypted response without decrypting the encrypted query and without decrypting the encrypted response, and send the encrypted response to the client.
Various embodiments of the present technology include a non-transitory computer readable storage media having a program embodied thereon, the program being executable by a processor at a client to perform a method for secure queries of web content D, the method comprising receiving the action from a web browser; converting an action to a query; encrypting the query using a homomorphic encryption scheme and a public encryption key; sending the encrypted query to one or more servers without a corresponding private encryption key. The method further includes receiving an encrypted response from the one or more servers, the encrypted response generated from an evaluation of the encrypted query over the web content D at the one or more servers, the evaluation having been performed without decrypting the encrypted query and without decrypting the encrypted response. The method further includes decrypting the encrypted response to generate an unencrypted result of the action over the web content D and providing the unencrypted result to a web browser for use by the web browser.
Certain embodiments of the present technology are illustrated by the accompanying figures. It will be understood that the figures are not necessarily to scale and that details not necessary for an understanding of the technology or that render other details difficult to perceive may be omitted. It will be understood that the technology is not necessarily limited to the particular embodiments illustrated herein.
Homomorphic encryption is a form of encryption in which a specific algebraic operation (generally referred to as addition or multiplication) performed on data is equivalent to another operation performed on the encrypted form of data. For example, in Partially Homomorphic Encryption (PHE) schemes, multiplication performed on data such as ciphertext may be equal to addition of the same values in plaintext. Thus, a specific operation performed on homomorphically encrypted data (e.g., a web action or web operation) may generate an encrypted response, which, when decrypted, allows recovery of the result of the operation as if it had been performed on the unencrypted data. For example, a homomorphically encrypted web action such as a query may be evaluated over web content to generate an encrypted response including resulting web content. The encrypted response may be decrypted, and the decrypted response may be used to recover the resulting web content from evaluation of the encrypted query as if unencrypted query had been evaluated over the web content.
Homomorphic encryption can also be used to securely chain together multiple operations on homomorphically encrypted data without exposing unencrypted data. The result of the multiple chained operations can then be recovered as if the multiple operations had been performed on the unencrypted data. It is noteworthy that if web browsing includes multiple operations using homomorphic encryption, the results of the operations performed on homomorphically encrypted data may be recovered as if the operations had been performed on unencrypted data. For example, a homomorphically encrypted query may include a chain of operations to be evaluated over web content to generate an encrypted query response. The unencrypted result of the chain of operations may be web content and/or analytics of the web content. The result of the query evaluation may be recovered using decryption of the encrypted query response as if the query operations had been performed on web content using an unencrypted query.
In various embodiments, the client 102 resides in computing environments that include shared computing architectures, hybrid architectures, distinct architectures such as those in a cloud computing environment, and/or the like. The client 102 and the web browser 104 of
There may be multiple servers 110 having data 112 that are available for access from the client 102 using the web browser 104, as illustrated in
An action over the web content D may be specified by a user via the web browser 104. The client 102 may receive the action from the web browser 104. The action may be a single operation (e.g., fetch of an object) or a chain of actions (e.g., database search and classification of search results). The client 102 may convert the action into a query Q to be executed over the web content D. Using the homomorphic encryption scheme E, the encryption system 100 may encode the query Q as a homomorphically encrypted query Q_E using the homomorphic encryption module 202 and encryption key 206. In various embodiments, the query Q_E is encoded as a homomorphic query vector, a homomorphic query matrix, homomorphic query parameters, and/or the like. The encrypted query Q_E is completely encrypted. The query Q cannot be recovered from encrypted query Q_E without using the encryption key 206, which is associated with encryption scheme E. The homomorphic decryption module 204 is configured to use the encryption key 206 to evaluate an operation K{Q_E, E}, which decrypts the encrypted query Q_E using the encryption scheme E and encryption key 206. In some embodiments, the homomorphic decryption module 204 uses a private key of the encryption key 206 to evaluate an operation K{Q_E, E}, which decrypts the encrypted query Q_E using the encryption scheme E and the private key.
The client 102 may send the encrypted query Q_E to one or more servers 110 containing the web content D in data 112. However, the client 102 does not send the encryption key 206 to any of the servers 110. Thus, servers 110 are not able to recover the query Q from the encrypted query Q_E, without the encryption key 206.
Using techniques of the homomorphic encryption scheme E, one or more server 110 evaluates the encrypted query Q_E 302 over web content D, which resides within the one or more of, respective, data 112. The evaluation may produce an encrypted response E(R).
The operation of evaluating the encrypted query Q_E 302 is performed without decrypting the encrypted query Q_E 302 at the server 110, and without revealing the unencrypted query Q to the owner of the data 112, an observer, or an attacker. Further, the operation of evaluating the encrypted query Q_E 302 is also performed without decrypting the encrypted response E(R), or revealing the contents R of the encrypted response E(R) to the owner of the data 112, an observer, or an attacker. This is because encryption key 206 is not available at any of the one or more servers 110.
The server 110 sends the encrypted response E(R) to the client 102. Using the encryption key 206 associated with encrypted query Q_E 302, the homomorphic decryption module 204 of the client 102 may apply the operation K{E(R), E} to decrypt the encrypted response E(R) to obtain the results R of the query Q. The results R may be used and/or displayed by the web browser 104.
In general, a server (e.g., server(s) 110) comprises one or more programs that share their resources with clients (e.g., client 102). Server programs may be implemented on one or more computers. A client may request content (e.g., web content D) from a server or may request the server to perform a service function while not sharing any of the client's resources. Whether a computer is a client, a server, or both, is determined by the nature of the application that requires the service functions.
While a single client 102 is illustrated in the encryption system 100 of
In some embodiments, the client 102 and/or servers 110 may implement an application programming interface (API) to formalize data exchange. Both client 102 and server 110 may reside in the same system, and client software may communicate with server software within the same computer.
In some instances, the functions of the client 102 and/or servers 110 are implemented within a cloud-based computing environment, not illustrated. The client 102 and/or servers 110 may be communicatively coupled via the network 122 with a cloud based computing environment. In general, a cloud-based computing environment is an internet resource that typically combines the computational power of a large model of processors and/or that combines the storage capacity of a large model of computer memories or storage devices. For example, systems that provide a cloud resource may be utilized exclusively by their owners; or such systems may be accessible to outside users who deploy applications within the computing infrastructure to obtain the benefit of large computational or storage resources.
The method 400 further comprises a step 410 of evaluating the encrypted query Q_E over web content D to generate an encrypted response E(R). The web content D may reside in data 112 at one or more servers 110. The encrypted query may be evaluated without decrypting the encrypted query Q_E 302 and without exposing the unencrypted query Q at the server 110 to the owner of the data 112, an observer, or an attacker. The encrypted query may also be evaluated over web content D without decrypting the encrypted response E(R) and without exposing the unencrypted results R of the encrypted response E(R) at the server 110 to the owner of the data 112, an observer, or an attacker.
The method 400 further comprises a step 412 of sending the encrypted response E(R) to the client 102. The encrypted response E(R) may be sent from one or more servers 110 to the client 102 via the network 122. The method 400 also comprises a step 414 of decrypting the encrypted response E(R) received from the one or more servers 110 at the client 102. The decryption of the encrypted response E(R) generates an unencrypted result R of the evaluation of the encrypted query Q_E over the web content D, as if the unencrypted query Q had been evaluated over the web content D. The method 400 further comprises a step 416 of using the unencrypted result at a web browser. The unencrypted result may be displayed or otherwise used at the web browser 104.
Thus, using the method 400, the query may be evaluated over the web content D in a completely secure and private manner. Moreover, neither the contents nor the results of the query are revealed by the method 400 to the owner of the web content D, an observer, or an attacker.
The example computer system 500 includes a processor or multiple processor(s) 502 (e.g., a central processing unit (CPU), a graphics processing unit (GPU), or both), and a main memory 506 and static memory 508, which communicate with each other via a bus 522. The computer system 500 may further include a video display 512 (e.g., a liquid crystal display (LCD)). The computer system 500 may also include an alpha-numeric input device(s) 514 (e.g., a keyboard), a cursor control device (e.g., a mouse, trackball, touchpad, touch screen, etc.), a voice recognition or biometric verification unit (not shown), a disk drive unit 516 (also referred to as disk drive unit), a signal generation device 520 (e.g., a speaker), and a network interface device 510. The computer system 500 may further include a data encryption module (shown elsewhere herein) to encrypt data.
The disk drive unit 516 includes a computer or machine-readable medium 518 on which is stored one or more sets of instructions and data structures (e.g., instructions 504) embodying or utilizing any one or more of the methodologies or functions described herein. The instructions 504 may also reside, completely or at least partially, within the main memory 506 and/or within the processor(s) 502 during execution thereof by the computer system 500. The main memory 506 and the processor(s) 502 may also constitute machine-readable media.
The instructions 504 may further be transmitted or received over a network (e.g., network 122, see also
The corresponding structures, materials, acts, and equivalents of any means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present technology has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the present technology in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the present technology. Exemplary embodiments were chosen and described in order to best explain the principles of the present technology and its practical application, and to enable others of ordinary skill in the art to understand the present technology for various embodiments with various modifications as are suited to the particular use contemplated.
Aspects of the present technology are described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the present technology. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present technology. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular embodiments, procedures, techniques, etc. in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art with this disclosure before them that the present invention may be practiced in other embodiments that depart from these specific details.
Reference throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment” or “according to one embodiment” (or other phrases having similar import) at various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. Furthermore, depending on the context of discussion herein, a singular term may include its plural forms and a plural term may include its singular form. Similarly, a hyphenated term (e.g., “co-located”) may be occasionally interchangeably used with its non-hyphenated version (e.g., “co-located”), a capitalized entry (e.g., “Software”) may be interchangeably used with its non-capitalized version (e.g., “software”), a plural term may be indicated with or without an apostrophe (e.g., PE's or PEs), and an italicized term (e.g., “N+1”) may be interchangeably used with its non-italicized version (e.g., “N+1”). Such occasional interchangeable uses shall not be considered inconsistent with each other.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is noted at the outset that the terms “coupled,” “connected,” “connecting,” “electrically connected,” etc., are used interchangeably herein to generally refer to the condition of being electrically/electronically connected. Similarly, a first entity is considered to be in “communication” with a second entity (or entities) when the first entity electrically sends and/or receives (whether through wireline or wireless means) information signals (whether containing data information or non-data/control information) to the second entity regardless of the type (analog or digital) of those signals. It is further noted that various figures (including component diagrams) shown and discussed herein are for illustrative purpose only, and are not drawn to scale.
While specific embodiments of, and examples for, the system are described above for illustrative purposes, various equivalent modifications are possible within the scope of the system, as those skilled in the relevant art will recognize. For example, while processes or steps are presented in a given order, alternative embodiments may perform routines having steps in a different order, and some processes or steps may be deleted, moved, added, subdivided, combined, and/or modified to provide alternative or sub-combinations. Each of these processes or steps may be implemented in a variety of different ways. Also, while processes or steps are at times shown as being performed in series, these processes or steps may instead be performed in parallel, or may be performed at different times.
While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. The descriptions are not intended to limit the scope of the invention to the particular forms set forth herein. To the contrary, the present descriptions are intended to cover such alternatives, modifications, and equivalents as may be included within the spirit and scope of the invention as defined by the appended claims and otherwise appreciated by one of ordinary skill in the art. Thus, the breadth and scope of a preferred embodiment should not be limited by any of the above-described exemplary embodiments.
This application claims the benefit and priority of U.S. Provisional Application Ser. No. 62/448,916, filed on Jan. 20, 2017; U.S. Provisional Application Ser. No. 62/448,883, filed on Jan. 20, 2017; U.S. Provisional Application 62/448,885, filed on Jan. 20, 2017; and U.S. Provisional Application Ser. No. 62/462,818, filed on Feb. 23, 2017, all of which are hereby incorporated by reference herein, including all references and appendices, for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
5732390 | Katayanagi et al. | Mar 1998 | A |
6178435 | Schmookler | Jan 2001 | B1 |
6745220 | Hars | Jun 2004 | B1 |
6748412 | Ruehle | Jun 2004 | B2 |
6910059 | Lu et al. | Jun 2005 | B2 |
7712143 | Comlekoglu | May 2010 | B2 |
7937270 | Smaragdis et al. | May 2011 | B2 |
8515058 | Gentry | Aug 2013 | B1 |
8565435 | Gentry et al. | Oct 2013 | B2 |
8781967 | Tehranchi et al. | Jul 2014 | B2 |
8832465 | Gulati et al. | Sep 2014 | B2 |
9059855 | Johnson et al. | Jun 2015 | B2 |
9094378 | Yung et al. | Jul 2015 | B1 |
9189411 | Mckeen et al. | Nov 2015 | B2 |
9215219 | Krendelev et al. | Dec 2015 | B1 |
9288039 | Monet et al. | Mar 2016 | B1 |
9491111 | Roth et al. | Nov 2016 | B1 |
9503432 | El Emam et al. | Nov 2016 | B2 |
9514317 | Martin et al. | Dec 2016 | B2 |
9565020 | Camenisch et al. | Feb 2017 | B1 |
9577829 | Roth et al. | Feb 2017 | B1 |
9652609 | Kang et al. | May 2017 | B2 |
9846787 | Johnson et al. | Dec 2017 | B2 |
9852306 | Cash et al. | Dec 2017 | B2 |
9942032 | Kornaropoulos et al. | Apr 2018 | B1 |
9946810 | Trepetin et al. | Apr 2018 | B1 |
9973334 | Hibshoosh et al. | May 2018 | B2 |
10027486 | Liu | Jul 2018 | B2 |
10055602 | Deshpande et al. | Aug 2018 | B2 |
10073981 | Arasu et al. | Sep 2018 | B2 |
10075288 | Khedr et al. | Sep 2018 | B1 |
10129028 | Kamakari et al. | Nov 2018 | B2 |
10148438 | Evancich et al. | Dec 2018 | B2 |
10181049 | El Defrawy et al. | Jan 2019 | B1 |
10210266 | Antonopoulos et al. | Feb 2019 | B2 |
10235539 | Ito et al. | Mar 2019 | B2 |
10255454 | Kamara et al. | Apr 2019 | B2 |
10333715 | Chu et al. | Jun 2019 | B2 |
10375042 | Chaum | Aug 2019 | B2 |
10396984 | French et al. | Aug 2019 | B2 |
10423806 | Cerezo Sanchez | Sep 2019 | B2 |
10489604 | Yoshino et al. | Nov 2019 | B2 |
10496631 | Tschudin et al. | Dec 2019 | B2 |
10644876 | Williams et al. | May 2020 | B2 |
10693627 | Carr | Jun 2020 | B2 |
10721057 | Carr | Jul 2020 | B2 |
10728018 | Williams et al. | Jul 2020 | B2 |
10790960 | Williams et al. | Sep 2020 | B2 |
10817262 | Carr et al. | Oct 2020 | B2 |
10873568 | Williams | Dec 2020 | B2 |
10880275 | Williams | Dec 2020 | B2 |
10902133 | Williams et al. | Jan 2021 | B2 |
10903976 | Williams et al. | Jan 2021 | B2 |
20020032712 | Miyasaka et al. | Mar 2002 | A1 |
20020073316 | Collins et al. | Jun 2002 | A1 |
20020104002 | Nishizawa et al. | Aug 2002 | A1 |
20030037087 | Rarick | Feb 2003 | A1 |
20030059041 | MacKenzie et al. | Mar 2003 | A1 |
20030110388 | Pavlin et al. | Jun 2003 | A1 |
20040167952 | Gueron et al. | Aug 2004 | A1 |
20050008152 | MacKenzie | Jan 2005 | A1 |
20050076024 | Takatsuka et al. | Apr 2005 | A1 |
20050259817 | Ramzan | Nov 2005 | A1 |
20060008080 | Higashi et al. | Jan 2006 | A1 |
20060008081 | Higashi et al. | Jan 2006 | A1 |
20070053507 | Smaragdis et al. | Mar 2007 | A1 |
20070095909 | Chaum | May 2007 | A1 |
20070140479 | Wang et al. | Jun 2007 | A1 |
20070143280 | Wang et al. | Jun 2007 | A1 |
20090037504 | Hussain | Feb 2009 | A1 |
20090083546 | Staddon et al. | Mar 2009 | A1 |
20090193033 | Ramzan et al. | Jul 2009 | A1 |
20090268908 | Bikel et al. | Oct 2009 | A1 |
20090279694 | Takahashi et al. | Nov 2009 | A1 |
20090287837 | Felsher | Nov 2009 | A1 |
20100202606 | Almeida | Aug 2010 | A1 |
20100205430 | Chiou et al. | Aug 2010 | A1 |
20100241595 | Felsher | Sep 2010 | A1 |
20110026781 | Osadchy et al. | Feb 2011 | A1 |
20110107105 | Hada | May 2011 | A1 |
20110110525 | Gentry | May 2011 | A1 |
20110243320 | Halevi et al. | Oct 2011 | A1 |
20110283099 | Nath et al. | Nov 2011 | A1 |
20120039469 | Mueller et al. | Feb 2012 | A1 |
20120054485 | Tanaka | Mar 2012 | A1 |
20120066510 | Weinman | Mar 2012 | A1 |
20120201378 | Nabeel et al. | Aug 2012 | A1 |
20120265794 | Niel | Oct 2012 | A1 |
20120265797 | Niel | Oct 2012 | A1 |
20130010950 | Kerschbaum | Jan 2013 | A1 |
20130051551 | El Aimani | Feb 2013 | A1 |
20130054665 | Felch | Feb 2013 | A1 |
20130114811 | Boufounos | May 2013 | A1 |
20130148868 | Troncoso Pastoriza et al. | Jun 2013 | A1 |
20130170640 | Gentry | Jul 2013 | A1 |
20130191650 | Balakrishnan et al. | Jul 2013 | A1 |
20130195267 | Alessio et al. | Aug 2013 | A1 |
20130198526 | Goto | Aug 2013 | A1 |
20130216044 | Gentry et al. | Aug 2013 | A1 |
20130230168 | Takenouchi | Sep 2013 | A1 |
20130237242 | Oka | Sep 2013 | A1 |
20130246813 | Mori et al. | Sep 2013 | A1 |
20130326224 | Yavuz | Dec 2013 | A1 |
20130339722 | Krendelev et al. | Dec 2013 | A1 |
20130339751 | Sun et al. | Dec 2013 | A1 |
20130346741 | Kim et al. | Dec 2013 | A1 |
20130346755 | Nguyen et al. | Dec 2013 | A1 |
20140164758 | Ramamurthy et al. | Jun 2014 | A1 |
20140189811 | Taylor et al. | Jul 2014 | A1 |
20140233727 | Rohloff et al. | Aug 2014 | A1 |
20140281511 | Kaushik et al. | Sep 2014 | A1 |
20140355756 | Iwamura et al. | Dec 2014 | A1 |
20150100785 | Joye et al. | Apr 2015 | A1 |
20150100794 | Joye et al. | Apr 2015 | A1 |
20150205967 | Naedele et al. | Jul 2015 | A1 |
20150215123 | Kipnis et al. | Jul 2015 | A1 |
20150227930 | Quigley et al. | Aug 2015 | A1 |
20150229480 | Joye et al. | Aug 2015 | A1 |
20150244517 | Nita | Aug 2015 | A1 |
20150248458 | Sakamoto | Sep 2015 | A1 |
20150304736 | Lal et al. | Oct 2015 | A1 |
20150358152 | Ikarashi et al. | Dec 2015 | A1 |
20150358153 | Gentry | Dec 2015 | A1 |
20160004874 | Ioannidis et al. | Jan 2016 | A1 |
20160036826 | Pogorelik et al. | Feb 2016 | A1 |
20160072623 | Joye et al. | Mar 2016 | A1 |
20160105402 | Kupwade-Patil et al. | Apr 2016 | A1 |
20160105414 | Bringer et al. | Apr 2016 | A1 |
20160119346 | Chen et al. | Apr 2016 | A1 |
20160140348 | Nawaz et al. | May 2016 | A1 |
20160179945 | Lastra Diaz et al. | Jun 2016 | A1 |
20160182222 | Rane | Jun 2016 | A1 |
20160323098 | Bathen | Nov 2016 | A1 |
20160335450 | Yoshino et al. | Nov 2016 | A1 |
20160344557 | Chabanne et al. | Nov 2016 | A1 |
20160350648 | Gilad-Bachrach et al. | Dec 2016 | A1 |
20170070340 | Hibshoosh et al. | Mar 2017 | A1 |
20170070351 | Yan | Mar 2017 | A1 |
20170099133 | Gu et al. | Apr 2017 | A1 |
20170134158 | Pasol et al. | May 2017 | A1 |
20170185776 | Robinson et al. | Jun 2017 | A1 |
20170264426 | Joye et al. | Sep 2017 | A1 |
20180091466 | Friedman et al. | Mar 2018 | A1 |
20180139054 | Chu et al. | May 2018 | A1 |
20180198601 | Laine et al. | Jul 2018 | A1 |
20180204284 | Cerezo Sanchez | Jul 2018 | A1 |
20180212751 | Williams et al. | Jul 2018 | A1 |
20180212752 | Williams et al. | Jul 2018 | A1 |
20180212753 | Williams | Jul 2018 | A1 |
20180212754 | Williams et al. | Jul 2018 | A1 |
20180212755 | Williams et al. | Jul 2018 | A1 |
20180212757 | Carr | Jul 2018 | A1 |
20180212758 | Williams et al. | Jul 2018 | A1 |
20180212759 | Williams et al. | Jul 2018 | A1 |
20180212775 | Williams | Jul 2018 | A1 |
20180212933 | Williams | Jul 2018 | A1 |
20180224882 | Carr | Aug 2018 | A1 |
20180234254 | Camenisch et al. | Aug 2018 | A1 |
20180267981 | Sirdey et al. | Sep 2018 | A1 |
20180270046 | Carr | Sep 2018 | A1 |
20180276417 | Cerezo Sanchez | Sep 2018 | A1 |
20180343109 | Koseki et al. | Nov 2018 | A1 |
20180349632 | Bent et al. | Dec 2018 | A1 |
20180359097 | Lindell | Dec 2018 | A1 |
20180373882 | Veugen | Dec 2018 | A1 |
20190013950 | Becker et al. | Jan 2019 | A1 |
20190042786 | Williams et al. | Feb 2019 | A1 |
20190108350 | Bohli et al. | Apr 2019 | A1 |
20190158272 | Chopra et al. | May 2019 | A1 |
20190229887 | Ding et al. | Jul 2019 | A1 |
20190238311 | Zheng | Aug 2019 | A1 |
20190251553 | Ma et al. | Aug 2019 | A1 |
20190251554 | Ma et al. | Aug 2019 | A1 |
20190253235 | Zhang et al. | Aug 2019 | A1 |
20190260585 | Kawai et al. | Aug 2019 | A1 |
20190280880 | Zhang et al. | Sep 2019 | A1 |
20190312728 | Poeppelmann | Oct 2019 | A1 |
20190327078 | Zhang et al. | Oct 2019 | A1 |
20190334716 | Kocsis et al. | Oct 2019 | A1 |
20190349191 | Soriente et al. | Nov 2019 | A1 |
20190371106 | Kaye | Dec 2019 | A1 |
20200134200 | Williams et al. | Apr 2020 | A1 |
20200150930 | Carr et al. | May 2020 | A1 |
20200204341 | Williams et al. | Jun 2020 | A1 |
20200382274 | Williams et al. | Dec 2020 | A1 |
20200396053 | Williams et al. | Dec 2020 | A1 |
20210034765 | Williams et al. | Feb 2021 | A1 |
Number | Date | Country |
---|---|---|
2873186 | Mar 2018 | EP |
5680007 | Mar 2015 | JP |
101386294 | Apr 2014 | KR |
WO2014105160 | Jul 2014 | WO |
WO2015094261 | Jun 2015 | WO |
WO2016003833 | Jan 2016 | WO |
WO2016018502 | Feb 2016 | WO |
WO2018091084 | May 2018 | WO |
WO2018136801 | Jul 2018 | WO |
WO2018136804 | Jul 2018 | WO |
WO2018136811 | Jul 2018 | WO |
Entry |
---|
“International Search Report” and “Written Opinion of the International Searching Authority,” Patent Cooperation Treaty Application No. PCT/US2018/014535, dated Apr. 19, 2018, 9 pages. |
“International Search Report” and “Written Opinion of the International Searching Authority,” Patent Cooperation Treaty Application No. PCT/US2018/014530, dated Apr. 23, 2018, 7 pages. |
“International Search Report” and “Written Opinion of the International Searching Authority,” Patent Cooperation Treaty Application No. PCT/US2018/014551, dated Apr. 24, 2018, 8 pages. |
Petition to Insitute Derivation Proceeding Pursuant to 35 USC 135; Case No. DER2019-00009, US Patent and Trademark Office Patent Trial and Appeal Board; Jul. 26, 2019, 272 pages. (2 PDFs). |
SCAMP Working Paper L29/11, “A Woods Hole Proposal Using Striping,” Dec. 2011, 14 pages. |
O'Hara, Michael James, “Shovel-ready Private Information Retrieval,” Dec. 2015, 4 pages. |
Carr, Benjamin et al., “Proposed Laughing Owl,” NSA Technical Report, Jan. 5, 2016, 18 pages. |
Carr, Benjamin et al., “A Private Stream Search Technique,” NSA Technical Report, Dec. 1, 2015, 18 pages. |
Drucker et al., “Paillier-encrypted databases with fast aggregated queries,” 2017 14th IEEE Annual Consumer Communications & Networking Conference (CCNC), Jan. 8-11, 2017, pp. 848-853. |
Tu et al., “Processing Analytical Queries over Encrypted Data,” Proceedings of the VLDB Endowment, vol. 6, Issue No. 5, Mar. 13, 2013. pp. 289-300. |
Boneh et al., “Private Database Queries Using Somewhat Homomorphic Encryption”, Cryptology ePrint Archive: Report 2013/422, Standford University [online], Jun. 27, 2013, [retrieved on Dec. 9, 2019], 22 pages. |
Chen et al., “Efficient Multi-Key Homomorphic Encryption with Packed Ciphertexts with Application to Oblivious Neural Network Inference”, CCS '19 Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, May 19, 2019. pp. 395-412. |
Armknecht et al., “A Guide to Fully Homomorphic Encryption” IACR Cryptology ePrint Archive: Report 2015/1192 [online], Dec. 14, 2015, 35 pages. |
Bayar et al., “A Deep Learning Approach to Universal Image Manipulation Detection Using a New Convolutional Layer”, IH&MMSec 2016, Jun. 20-22, 2016. pp. 5-10. |
Juvekar et al. “Gazelle: A Low Latency Framework for Secure Neural Network Inference”, 27th USENIX Security Symposium, Aug. 15-17, 2018. pp. 1650-1668. |
Bösch et al., “SOFIR: Securely Outsourced Forensic Recognition,” 2014 IEEE International Conference on Acoustic, Speech and Signal Processing (ICASSP), IEEE 978-1-4799-4/14, 2014, pp. 2713-2717. |
Waziri et al., “Big Data Analytics and Data Security in the Cloud via Fullly Homomorphic Encryption,” World Academy of Science, Engineering and Technology International Journal of Computer, Electrical, Automation, Control and Information Engineering, vol. 9, No. 3, 2015, pp. 744-753. |
Bajpai et al., “A Fully Homomorphic Encryption Implementation on Cloud Computing,” International Journal of Information & Computation Technology, ISSN 0974-2239 vol. 4, No. 8, 2014, pp. 811-816. |
Williams, Ellison Anne et al., “Wideskies: Scalable Private Information Retrieval,” Jun. 8, 2016, 14 pages. |
Viejo et al., “Asymmetric homomorphisms for secure aggregation in heterogeneous scenarios,” Information Fusion 13, Elsevier B.V., Mar. 21, 2011, pp. 285-295. |
Patil et al, “Big Data Privacy Using Fully Homomorphic Non-Deterministic Encryption,” IEEE 7th International Advance Computing Conference, Jan. 5-7, 2017, 15 pages. |
Panda et al., “FPGA Prototype of Low Latency BBS PRNG,” IEEE International Symposium on Nanoelectronic and Information Systems, Dec. 2015, pp. 118-123, 7 pages. |
Sahu et al., “Implementation of Modular Multiplication for RSA Algorithm,” 2011 International Conference on Communication Systems and Network Technologies, 2011, pp. 112-114, 3 pages. |
Drucker et al., “Achieving trustworthy Homomorphic Encryption by combining it with a Trusted Execution Environment,” Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Application (JoWUA), Mar. 2018, pp. 86-99. |
Google Scholar, search results for “trusted execution environment database”, 2 pages, Aug. 1, 2020. |
Number | Date | Country | |
---|---|---|---|
20180212756 A1 | Jul 2018 | US |
Number | Date | Country | |
---|---|---|---|
62448916 | Jan 2017 | US | |
62448883 | Jan 2017 | US | |
62448885 | Jan 2017 | US | |
62462818 | Feb 2017 | US |