default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRotem Tsabary
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c9]Rotem Tsabary:
Candidate Witness Encryption from Lattice Techniques. CRYPTO (1) 2022: 535-559- 2021
- [j1]Benny Applebaum, Zvika Brakerski, Rotem Tsabary:
Perfect Secure Computation in Two Rounds. SIAM J. Comput. 50(1): 68-97 (2021) - 2020
- [c8]Naty Peter, Rotem Tsabary, Hoeteck Wee:
One-One Constrained Pseudorandom Functions. ITC 2020: 13:1-13:22 - [c7]Zvika Brakerski, Sanjam Garg, Rotem Tsabary:
FHE-Based Bootstrapping of Designated-Prover NIZK. TCC (1) 2020: 657-683 - [i8]Naty Peter, Rotem Tsabary, Hoeteck Wee:
One-One Constrained Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2020: 714 (2020) - [i7]Zvika Brakerski, Sanjam Garg
, Rotem Tsabary:
FHE-Based Bootstrapping of Designated-Prover NIZK. IACR Cryptol. ePrint Arch. 2020: 1168 (2020)
2010 – 2019
- 2019
- [c6]Rotem Tsabary:
Fully Secure Attribute-Based Encryption for t-CNF from LWE. CRYPTO (1) 2019: 62-85 - [c5]Benny Applebaum, Zvika Brakerski, Rotem Tsabary:
Degree 2 is Complete for the Round-Complexity of Malicious MPC. EUROCRYPT (2) 2019: 504-531 - [i6]Benny Applebaum, Zvika Brakerski, Rotem Tsabary:
Degree 2 is Complete for the Round-Complexity of Malicious MPC. IACR Cryptol. ePrint Arch. 2019: 200 (2019) - [i5]Rotem Tsabary:
Fully Secure Attribute-Based Encryption for t-CNF from LWE. IACR Cryptol. ePrint Arch. 2019: 365 (2019) - 2018
- [c4]Benny Applebaum, Zvika Brakerski, Rotem Tsabary:
Perfect Secure Computation in Two Rounds. TCC (1) 2018: 152-174 - [i4]Benny Applebaum, Zvika Brakerski, Rotem Tsabary:
Perfect Secure Computation in Two Rounds. IACR Cryptol. ePrint Arch. 2018: 894 (2018) - 2017
- [c3]Zvika Brakerski, Rotem Tsabary, Vinod Vaikuntanathan, Hoeteck Wee:
Private Constrained PRFs (and More) from LWE. TCC (1) 2017: 264-302 - [c2]Rotem Tsabary:
An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both. TCC (2) 2017: 489-518 - [i3]Rotem Tsabary:
An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both. IACR Cryptol. ePrint Arch. 2017: 723 (2017) - [i2]Zvika Brakerski, Rotem Tsabary, Vinod Vaikuntanathan, Hoeteck Wee:
Private Constrained PRFs (and More) from LWE. IACR Cryptol. ePrint Arch. 2017: 795 (2017) - 2016
- [c1]Zvika Brakerski, David Cash, Rotem Tsabary, Hoeteck Wee:
Targeted Homomorphic Attribute-Based Encryption. TCC (B2) 2016: 330-360 - [i1]Zvika Brakerski, David Cash, Rotem Tsabary, Hoeteck Wee:
Targeted Homomorphic Attribute Based Encryption. IACR Cryptol. ePrint Arch. 2016: 691 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
