ABRAHAM; Ittai
Patent Applications and Registrations
Patent applications and USPTO patent grants for ABRAHAM; Ittai.The latest application filed is for "flexible byzantine fault tolerance".
Company Profile
17.19.31
- ABRAHAM; Ittai - Tel Aviv IL
- Abraham; Ittai - Herzliya IL
- Abraham; Ittai - San Francisco CA US
- Abraham; Ittai - Jerusalem IL
Patent Activity
| Patent | Date |
|---|---|
| Flexible Byzantine Fault Tolerance App 20220276938 - ABRAHAM; Ittai ; et al. | 2022-09-01 |
| Byzantine fault tolerance with verifiable secret sharing at constant overhead Grant 11,354,199 - Basu , et al. June 7, 2 | 2022-06-07 |
| Flexible byzantine fault tolerance Grant 11,341,004 - Abraham , et al. May 24, 2 | 2022-05-24 |
| Byzantine Agreement Using Communications Having Linear Complexity App 20220138062 - Abraham; Ittai ; et al. | 2022-05-05 |
| Robust Input Verification for Secure Multi-Party Computation (MPC) with Clients App 20220069979 - Yanai; Avishay ; et al. | 2022-03-03 |
| Byzantine agreement using communications having linear complexity Grant 11,256,581 - Abraham , et al. February 22, 2 | 2022-02-22 |
| Flexible Byzantine Fault Tolerance App 20210334177 - ABRAHAM; Ittai ; et al. | 2021-10-28 |
| Synchronous State Machine Replication For Achieving Consensus App 20210279255 - NAYAK; Kartik Ravidas ; et al. | 2021-09-09 |
| Providing Real-world Time In A Replicated State-machine Environment App 20210281433 - Fink; Bryan ; et al. | 2021-09-09 |
| System and method for anonymous message broadcasting Grant 11,102,179 - Yanai , et al. August 24, 2 | 2021-08-24 |
| System And Method For Anonymous Message Broadcasting App 20210226924 - YANAI; Avishay ; et al. | 2021-07-22 |
| Methods and systems that efficiently and securely store encryption keys Grant 11,070,374 - Kariv , et al. July 20, 2 | 2021-07-20 |
| Bounding cost of flushes in buffer trees Grant 11,061,881 - Johnson , et al. July 13, 2 | 2021-07-13 |
| Methods and systems that efficiently and securely store data Grant 11,057,209 - Kariv , et al. July 6, 2 | 2021-07-06 |
| Asynchronous Boosting Of State Machine Replication App 20210160152 - SPIEGELMAN; Alexander ; et al. | 2021-05-27 |
| Reducing write amplification in buffer trees Grant 10,997,144 - Johnson , et al. May 4, 2 | 2021-05-04 |
| Balancing write amplification and space amplification in buffer trees Grant 10,824,610 - Johnson , et al. November 3, 2 | 2020-11-03 |
| Key-value stores implemented using fragmented log-structured merge trees Grant 10,795,871 - Velayudhan Pillai , et al. October 6, 2 | 2020-10-06 |
| Linear View-Change BFT App 20200301794 - Abraham; Ittai ; et al. | 2020-09-24 |
| Linear view-change BFT with optimistic responsiveness Grant 10,747,629 - Abraham , et al. A | 2020-08-18 |
| Linear view-change BFT Grant 10,713,133 - Abraham , et al. | 2020-07-14 |
| Byzantine Fault Tolerance with Verifiable Secret Sharing at Constant Overhead App 20200151066 - Basu; Soumya ; et al. | 2020-05-14 |
| Bounding Cost Of Flushes In Buffer Trees App 20200151268 - Johnson; Robert T. ; et al. | 2020-05-14 |
| Balancing Write Amplification And Space Amplification In Buffer Trees App 20200089788 - Johnson; Robert T. ; et al. | 2020-03-19 |
| Byzantine Agreement Using Communications Having Linear Complexity App 20200081805 - Abraham; Ittai ; et al. | 2020-03-12 |
| Byzantine fault tolerance with verifiable secret sharing at constant overhead Grant 10,572,352 - Basu , et al. Feb | 2020-02-25 |
| Reducing Write Amplification In Buffer Trees App 20200012735 - Johnson; Robert T ; et al. | 2020-01-09 |
| Linear View-change Bft App 20190377648 - Abraham; Ittai ; et al. | 2019-12-12 |
| Linear View-Change BFT with Optimistic Responsiveness App 20190377645 - Abraham; Ittai ; et al. | 2019-12-12 |
| Byzantine agreement using communications having linear complexity Grant 10,503,614 - Abraham , et al. Dec | 2019-12-10 |
| Methods And Systems That Efficiently And Securely Store Encryption Keys App 20190268149 - Kariv; Asaf ; et al. | 2019-08-29 |
| Byzantine Fault Tolerance with Verifiable Secret Sharing at Constant Overhead App 20190129809 - Basu; Soumya ; et al. | 2019-05-02 |
| Byzantine Agreement Using Communications Having Linear Complexity App 20180307573 - Abraham; Ittai ; et al. | 2018-10-25 |
| Fairness Preserving Byzantine Agreements App 20180308091 - Malkhi; Dahlia ; et al. | 2018-10-25 |
| Key-value Stores Implemented Using Fragmented Log-structured Merge Trees App 20180089244 - VELAYUDHAN PILLAI; Vijaychidambaram ; et al. | 2018-03-29 |
| Providing questions to entity groups Grant 9,792,827 - Abraham , et al. October 17, 2 | 2017-10-17 |
| Identifying subgraphs in transformed social network graphs Grant 9,439,053 - Abraham , et al. September 6, 2 | 2016-09-06 |
| Identifying Subgraphs In Transformed Social Network Graphs App 20140214936 - Abraham; Ittai ; et al. | 2014-07-31 |
| Determining alternative routes Grant 8,583,363 - Abraham , et al. November 12, 2 | 2013-11-12 |
| Providing Questions To Entity Groups App 20130260352 - Abraham; Ittai ; et al. | 2013-10-03 |
| Double-hub Indexing In Location Services App 20130144524 - Abraham; Ittai ; et al. | 2013-06-06 |
| Link Recommendation And Densification App 20130041876 - Dow; Paul Alexander ; et al. | 2013-02-14 |
| Hub Label Based Routing In Shortest Path Determination App 20120250535 - Delling; Daniel ; et al. | 2012-10-04 |
| Shortest Path Determination In Databases App 20120254153 - Abraham; Ittai ; et al. | 2012-10-04 |
| Determining Alternative Routes App 20110295497 - Abraham; Ittai ; et al. | 2011-12-01 |
| Internet Latencies Through Prediction Trees App 20080304421 - Ramasubramanian; Venugopalan Saraswati ; et al. | 2008-12-11 |
uspto.report is an independent third-party trademark research tool that is not affiliated, endorsed, or sponsored by the United States Patent and Trademark Office (USPTO) or any other governmental organization. The information provided by uspto.report is based on publicly available data at the time of writing and is intended for informational purposes only.
While we strive to provide accurate and up-to-date information, we do not guarantee the accuracy, completeness, reliability, or suitability of the information displayed on this site. The use of this site is at your own risk. Any reliance you place on such information is therefore strictly at your own risk.
All official trademark data, including owner information, should be verified by visiting the official USPTO website at www.uspto.gov. This site is not intended to replace professional legal advice and should not be used as a substitute for consulting with a legal professional who is knowledgeable about trademark law.
| 