default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamir Tassa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j48]Tamir Tassa, Avishay Yanai:
The Multiple Millionaires' Problem: New Algorithmic Approaches and Protocols. Proc. Priv. Enhancing Technol. 2024(4): 784-796 (2024)- [j47]Dana Pessach
, Tamir Tassa, Erez Shmueli:
Fairness-Driven Private Collaborative Machine Learning. ACM Trans. Intell. Syst. Technol. 15(2): 27:1-27:30 (2024) - [c30]Tamir Tassa, Lihi Dery:
Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules. ARES 2024: 18:1-18:11 - [i9]Tamir Tassa, Avishay Yanai:
The Multiple Millionaires' Problem. IACR Cryptol. ePrint Arch. 2024: 5 (2024) - [i8]Aviad Ben Arie, Tamir Tassa:
Distributed Protocols for Oblivious Transfer and Polynomial Evaluation. IACR Cryptol. ePrint Arch. 2024: 9 (2024) - 2023
- [j46]Pablo Kogan, Tamir Tassa, Tal Grinshpoun:
Privacy preserving solution of DCOPs by mediation. Artif. Intell. 319: 103916 (2023) - [c29]Aviad Ben Arie, Tamir Tassa:
Distributed Protocols for Oblivious Transfer and Polynomial Evaluation. INDOCRYPT (2) 2023: 62-83 - 2022
- [j45]Tamir Tassa, Alon Ben Horin:
Privacy-preserving Collaborative Filtering by Distributed Mediation. ACM Trans. Intell. Syst. Technol. 13(6): 102:1-102:26 (2022) - [c28]Pablo Kogan, Tamir Tassa, Tal Grinshpoun:
Privacy Preserving DCOP Solving by Mediation. CSCML 2022: 487-498 - [i7]Tamir Tassa, Lihi Dery:
Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules. CoRR abs/2205.10580 (2022) - 2021
- [j44]Tamir Tassa, Tal Grinshpoun, Avishay Yanai:
PC-SyncBB: A privacy preserving collusion secure DCOP algorithm. Artif. Intell. 297: 103501 (2021) - [j43]Lihi Dery, Tamir Tassa, Avishay Yanai:
Fear not, vote truthfully: Secure Multiparty Computation of score based rules. Expert Syst. Appl. 168: 114434 (2021) - [c27]Lihi Dery, Tamir Tassa, Avishay Yanai, Arthur Zamarin:
DEMO: A Secure Voting System for Score Based Elections. CCS 2021: 2399-2401 - [c26]Alon Ben Horin, Tamir Tassa:
Privacy Preserving Collaborative Filtering by Distributed Mediation. RecSys 2021: 332-341 - [i6]Dana Pessach, Tamir Tassa, Erez Shmueli:
Fairness-Driven Private Collaborative Machine Learning. CoRR abs/2109.14376 (2021) - 2020
- [j42]Bora Edizel, Francesco Bonchi, Sara Hajian, André Panisson, Tamir Tassa:
FaiRecSys: mitigating algorithmic bias in recommender systems. Int. J. Data Sci. Anal. 9(2): 197-213 (2020) - [j41]Erez Shmueli, Tamir Tassa:
Mediated Secure Multi-Party Protocols for Collaborative Filtering. ACM Trans. Intell. Syst. Technol. 11(2): 15:1-15:25 (2020)
2010 – 2019
- 2019
- [j40]Tal Grinshpoun, Tamir Tassa, Vadim Levit, Roie Zivan:
Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs. Artif. Intell. 266: 27-50 (2019) - [j39]Guy Barshap, Tamir Tassa:
Privacy-Preserving Planarity Testing of Distributed Graphs. Trans. Data Priv. 12(2): 117-144 (2019) - [c25]Tamir Tassa, Tal Grinshpoun, Avishay Yanai:
A Privacy Preserving Collusion Secure DCOP Algorithm. IJCAI 2019: 4774-4780 - [i5]Lihi Dery, Tamir Tassa:
Secure Voting Protocols with Perfect Ballot Secrecy. CoRR abs/1903.06472 (2019) - [i4]Tamir Tassa, Tal Grinshpoun, Avishay Yanai:
A Privacy Preserving Collusion Secure DCOP Algorithm. CoRR abs/1905.09013 (2019) - 2018
- [c24]Guy Barshap, Tamir Tassa:
Privacy-Preserving Planarity Testing of Distributed Graphs. DBSec 2018: 131-147 - 2017
- [j38]Tamir Tassa, Tal Grinshpoun, Roie Zivan:
Privacy Preserving Implementation of the Max-Sum Algorithm and its Variants. J. Artif. Intell. Res. 59: 311-349 (2017) - [c23]Erez Shmueli, Tamir Tassa:
Secure Multi-Party Protocols for Item-Based Collaborative Filtering. RecSys 2017: 89-97 - [c22]Gilad Asharov, Francesco Bonchi, David García-Soriano, Tamir Tassa:
Secure Centrality Computation Over Multiple Networks. WWW 2017: 957-966 - 2016
- [j37]Tal Grinshpoun, Tamir Tassa:
P-SyncBB: A Privacy Preserving Branch and Bound DCOP Algorithm. J. Artif. Intell. Res. 57: 621-660 (2016) - [j36]Michal Davidson, Tamir Tassa, Ehud Gudes:
Content sharing schemes in DRM systems with enhanced performance and privacy preservation. J. Comput. Secur. 24(6): 667-688 (2016) - [j35]Sara Hajian, Tamir Tassa, Francesco Bonchi:
Individual privacy in social influence networks. Soc. Netw. Anal. Min. 6(1): 2:1-2:14 (2016) - [c21]Rica Gonen, Tamir Tassa:
Privacy Preserving Computations for Viral Marketing: The Case of Rational Players. ARES 2016: 677-686 - [c20]Tamir Tassa, Roie Zivan, Tal Grinshpoun:
Preserving Privacy in Region Optimal DCOP Algorithms. IJCAI 2016: 496-502 - 2015
- [j34]Javier Herranz, Jordi Nin, Pablo Rodríguez, Tamir Tassa:
Revisiting distance-based record linkage for privacy-preserving release of statistical datasets. Data Knowl. Eng. 100: 78-93 (2015) - [j33]Erez Shmueli, Tamir Tassa:
Privacy by diversity in sequential releases of databases. Inf. Sci. 298: 344-372 (2015) - [c19]Tamir Tassa, Roie Zivan, Tal Grinshpoun:
Max-Sum Goes Private. IJCAI 2015: 425-431 - [c18]Dan Feldman, Tamir Tassa:
More Constraints, Smaller Coresets: Constrained Matrix Approximation of Sparse Big Data. KDD 2015: 249-258 - 2014
- [j32]Ben Ezair, Tamir Tassa, Zvi Shiller:
Planning high order trajectories with general initial and final conditions and asymmetric bounds. Int. J. Robotics Res. 33(6): 898-916 (2014) - [j31]Mark Last, Tamir Tassa, Alexandra Zhmudyak, Erez Shmueli:
Improving accuracy of classification models induced from anonymized datasets. Inf. Sci. 256: 138-161 (2014) - [j30]Francesco Bonchi, Aristides Gionis, Tamir Tassa:
Identity obfuscation in graphs through the information theoretic lens. Inf. Sci. 275: 232-256 (2014) - [j29]Erez Shmueli, Tomer Zrihen, Ran Yahalom, Tamir Tassa:
Constrained obfuscation of relational databases. Inf. Sci. 286: 35-62 (2014) - [j28]Tamir Tassa:
Secure Mining of Association Rules inHorizontally Distributed Databases. IEEE Trans. Knowl. Data Eng. 26(4): 970-983 (2014) - [c17]Tal Grinshpoun, Tamir Tassa:
A privacy-preserving algorithm for distributed constraint optimization. AAMAS 2014: 909-916 - [c16]Michal Davidson, Ehud Gudes, Tamir Tassa:
Efficient and Enhanced Solutions for Content Sharing in DRM Systems. DBSec 2014: 373-381 - [c15]Tamir Tassa, Francesco Bonchi:
Privacy Preserving Estimation of Social Influence. EDBT 2014: 559-570 - 2013
- [j27]Tamir Tassa, Ayman Jarrous, Yonatan Ben-Ya'akov:
Oblivious evaluation of multivariate polynomials. J. Math. Cryptol. 7(1): 1-29 (2013) - [j26]Tamir Tassa:
Addendum to "Finding all maximally-matchable edges in a bipartite graph" [Theoret. Comput. Sci. 423 (2012) 50-58]. Theor. Comput. Sci. 491: 136 (2013) - [j25]Chris Clifton, Tamir Tassa:
On Syntactic Anonymity and Differential Privacy. Trans. Data Priv. 6(2): 161-183 (2013) - [j24]Tamir Tassa, Dror J. Cohen:
Anonymization of Centralized and Distributed Social Networks by Sequential Clustering. IEEE Trans. Knowl. Data Eng. 25(2): 311-324 (2013) - [c14]Chris Clifton, Tamir Tassa:
On syntactic anonymity and differential privacy. ICDE Workshops 2013: 88-93 - 2012
- [j23]Batya Kenig, Tamir Tassa:
A practical approximation algorithm for optimal k-anonymity. Data Min. Knowl. Discov. 25(1): 134-168 (2012) - [j22]Erez Shmueli, Tamir Tassa, Raz Wasserstein, Bracha Shapira, Lior Rokach:
Limiting disclosure of sensitive data in sequential releases of databases. Inf. Sci. 191: 98-127 (2012) - [j21]Paolo Boldi, Francesco Bonchi, Aristides Gionis, Tamir Tassa:
Injecting Uncertainty in Graphs for Identity Obfuscation. Proc. VLDB Endow. 5(11): 1376-1387 (2012) - [j20]Tamir Tassa:
Finding all maximally-matchable edges in a bipartite graph. Theor. Comput. Sci. 423: 50-58 (2012) - [j19]Tamir Tassa, Arnon Mazza, Aristides Gionis:
k-Concealment: An Alternative Model of k-Type Anonymity. Trans. Data Priv. 5(1): 189-222 (2012) - [j18]Tamir Tassa, Ehud Gudes:
Secure distributed computation of anonymized views of shared databases. ACM Trans. Database Syst. 37(2): 11:1-11:43 (2012) - [i3]Paolo Boldi, Francesco Bonchi, Aristides Gionis, Tamir Tassa:
Injecting Uncertainty in Graphs for Identity Obfuscation. CoRR abs/1208.4145 (2012) - 2011
- [j17]Tamir Tassa:
Generalized oblivious transfer by secret sharing. Des. Codes Cryptogr. 58(1): 11-21 (2011) - [c13]Francesco Bonchi, Aristides Gionis, Tamir Tassa:
Identity obfuscation in graphs through the information theoretic lens. ICDE 2011: 924-935 - [i2]Tamir Tassa:
Secure Mining of Association Rules in Horizontally Distributed Databases. CoRR abs/1106.5113 (2011) - [i1]Tamir Tassa:
Finding All Allowed Edges in a Bipartite Graph. CoRR abs/1107.4711 (2011) - 2010
- [j16]Jacob Goldberger, Tamir Tassa:
Efficient Anonymizations with Enhanced Utility. Trans. Data Priv. 3(2): 149-175 (2010)
2000 – 2009
- 2009
- [j15]Tamir Tassa, Jorge L. Villar:
On proper secrets, ( t , k )-bases and linear codes. Des. Codes Cryptogr. 52(2): 129-154 (2009) - [j14]Tamir Tassa, Nira Dyn:
Multipartite Secret Sharing by Bivariate Interpolation. J. Cryptol. 22(2): 227-258 (2009) - [j13]Aristides Gionis, Tamir Tassa:
k-Anonymization with Minimal Loss of Information. IEEE Trans. Knowl. Data Eng. 21(2): 206-219 (2009) - [c12]Jacob Goldberger, Tamir Tassa:
Efficient Anonymizations with Enhanced Utility. ICDM Workshops 2009: 106-113 - 2008
- [j12]Oded Blayer, Tamir Tassa:
Improved versions of Tardos' fingerprinting scheme. Des. Codes Cryptogr. 48(1): 79-103 (2008) - [j11]Jacob Goldberger, Tamir Tassa:
A hierarchical clustering algorithm based on the Hungarian method. Pattern Recognit. Lett. 29(11): 1632-1638 (2008) - [j10]Amos Beimel, Tamir Tassa, Enav Weinreb:
Characterizing Ideal Weighted Threshold Secret Sharing. SIAM J. Discret. Math. 22(1): 360-397 (2008) - [c11]Aristides Gionis, Arnon Mazza, Tamir Tassa:
k-Anonymization Revisited. ICDE 2008: 744-753 - 2007
- [j9]Tamir Tassa:
Hierarchical Threshold Secret Sharing. J. Cryptol. 20(2): 237-264 (2007) - [c10]Aristides Gionis, Tamir Tassa:
k -Anonymization with Minimal Loss of Information. ESA 2007: 439-450 - 2006
- [j8]Leah Epstein, Tamir Tassa:
Vector assignment schemes for asymmetric settings. Acta Informatica 42(6-7): 501-514 (2006) - [j7]Leah Epstein, Tamir Tassa:
Optimal preemptive scheduling for general target functions. J. Comput. Syst. Sci. 72(1): 132-162 (2006) - [j6]Noam Kogan, Tamir Tassa:
Improved efficiency for revocation schemes via Newton interpolation. ACM Trans. Inf. Syst. Secur. 9(4): 461-486 (2006) - [c9]Tamir Tassa, Nira Dyn:
Multipartite Secret Sharing by Bivariate Interpolation. ICALP (2) 2006: 288-299 - [c8]Alexander Jaffe, Mor Naaman, Tamir Tassa, Marc Davis:
Generating summaries and visualization for large collections of geo-referenced photographs. Multimedia Information Retrieval 2006: 89-98 - [c7]Alexander Jaffe, Mor Naaman, Tamir Tassa, Marc Davis:
Generating summaries for large collections of geo-referenced photographs. WWW 2006: 853-854 - 2005
- [j5]Tamir Tassa:
Low Bandwidth Dynamic Traitor Tracing Schemes. J. Cryptol. 18(2): 167-183 (2005) - [c6]Amos Beimel, Tamir Tassa, Enav Weinreb:
Characterizing Ideal Weighted Threshold Secret Sharing. TCC 2005: 600-619 - 2004
- [j4]Leah Epstein, Tamir Tassa:
Approximation schemes for the Min-Max Starting Time Problem. Acta Informatica 40(9): 657-674 (2004) - [c5]Leah Epstein, Tamir Tassa:
Optimal Preemptive Scheduling for General Target Functions. MFCS 2004: 562-573 - [c4]Tamir Tassa:
Hierarchical Threshold Secret Sharing. TCC 2004: 473-490 - 2003
- [j3]Leah Epstein, Tamir Tassa:
Vector assignment problems: a general framework. J. Algorithms 48(2): 360-384 (2003) - [c3]Leah Epstein, Tamir Tassa:
Approximation Schemes for the Min-Max Starting Time Problem. MFCS 2003: 408-418 - 2002
- [c2]Leah Epstein, Tamir Tassa:
Vector Assignment Problems: A General Framework. ESA 2002: 461-472 - 2001
- [j2]Amos Fiat, Tamir Tassa:
Dynamic Traitor Tracing. J. Cryptol. 14(3): 211-223 (2001)
1990 – 1999
- 1999
- [c1]Amos Fiat, Tamir Tassa:
Dynamic Traitor Training. CRYPTO 1999: 354-371 - 1997
- [j1]Tamir Tassa:
Homogenization of Two-Dimensional Linear Flows with Integral Invariance. SIAM J. Appl. Math. 57(5): 1390-1405 (1997)
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-08-03 20:15 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:
