Tamir Tassa

According to our database1, Tamir Tassa
  • authored at least 64 papers between 1997 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Privacy Preserving Implementation of the Max-Sum Algorithm and its Variants.
J. Artif. Intell. Res., 2017

Secure Centrality Computation Over Multiple Networks.
Proceedings of the 26th International Conference on World Wide Web, 2017

Secure Multi-Party Protocols for Item-Based Collaborative Filtering.
Proceedings of the Eleventh ACM Conference on Recommender Systems, 2017

2016
Individual privacy in social influence networks.
Social Netw. Analys. Mining, 2016

Content sharing schemes in DRM systems with enhanced performance and privacy preservation.
Journal of Computer Security, 2016

P-SyncBB: A Privacy Preserving Branch and Bound DCOP Algorithm.
J. Artif. Intell. Res., 2016

Preserving Privacy in Region Optimal DCOP Algorithms.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Privacy Preserving Computations for Viral Marketing: The Case of Rational Players.
Proceedings of the 11th International Conference on Availability, Reliability and Security, 2016

2015
Privacy by diversity in sequential releases of databases.
Inf. Sci., 2015

Revisiting distance-based record linkage for privacy-preserving release of statistical datasets.
Data Knowl. Eng., 2015

More Constraints, Smaller Coresets: Constrained Matrix Approximation of Sparse Big Data.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Max-Sum Goes Private.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Secure Mining of Association Rules inHorizontally Distributed Databases.
IEEE Trans. Knowl. Data Eng., 2014

Constrained obfuscation of relational databases.
Inf. Sci., 2014

Improving accuracy of classification models induced from anonymized datasets.
Inf. Sci., 2014

Identity obfuscation in graphs through the information theoretic lens.
Inf. Sci., 2014

Planning high order trajectories with general initial and final conditions and asymmetric bounds.
I. J. Robotics Res., 2014

Privacy Preserving Estimation of Social Influence.
Proceedings of the 17th International Conference on Extending Database Technology, 2014

Efficient and Enhanced Solutions for Content Sharing in DRM Systems.
Proceedings of the Data and Applications Security and Privacy XXVIII, 2014

A privacy-preserving algorithm for distributed constraint optimization.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Anonymization of Centralized and Distributed Social Networks by Sequential Clustering.
IEEE Trans. Knowl. Data Eng., 2013

On Syntactic Anonymity and Differential Privacy.
Trans. Data Privacy, 2013

Addendum to "Finding all maximally-matchable edges in a bipartite graph" [Theoret. Comput. Sci. 423 (2012) 50-58]
Theor. Comput. Sci., 2013

Oblivious evaluation of multivariate polynomials.
J. Mathematical Cryptology, 2013

On syntactic anonymity and differential privacy.
Proceedings of the Workshops Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

2012
Secure distributed computation of anonymized views of shared databases.
ACM Trans. Database Syst., 2012

k-Concealment: An Alternative Model of k-Type Anonymity.
Trans. Data Privacy, 2012

Finding all maximally-matchable edges in a bipartite graph.
Theor. Comput. Sci., 2012

Injecting Uncertainty in Graphs for Identity Obfuscation.
PVLDB, 2012

Limiting disclosure of sensitive data in sequential releases of databases.
Inf. Sci., 2012

A practical approximation algorithm for optimal k-anonymity.
Data Min. Knowl. Discov., 2012

Injecting Uncertainty in Graphs for Identity Obfuscation
CoRR, 2012

2011
Generalized oblivious transfer by secret sharing.
Des. Codes Cryptography, 2011

Finding All Allowed Edges in a Bipartite Graph
CoRR, 2011

Secure Mining of Association Rules in Horizontally Distributed Databases
CoRR, 2011

Identity obfuscation in graphs through the information theoretic lens.
Proceedings of the 27th International Conference on Data Engineering, 2011

2010
Efficient Anonymizations with Enhanced Utility.
Trans. Data Privacy, 2010

2009
k-Anonymization with Minimal Loss of Information.
IEEE Trans. Knowl. Data Eng., 2009

Multipartite Secret Sharing by Bivariate Interpolation.
J. Cryptology, 2009

On proper secrets, ( t , k )-bases and linear codes.
Des. Codes Cryptography, 2009

Efficient Anonymizations with Enhanced Utility.
Proceedings of the ICDM Workshops 2009, 2009

2008
Characterizing Ideal Weighted Threshold Secret Sharing.
SIAM J. Discrete Math., 2008

A hierarchical clustering algorithm based on the Hungarian method.
Pattern Recognition Letters, 2008

Improved versions of Tardos' fingerprinting scheme.
Des. Codes Cryptography, 2008

k-Anonymization Revisited.
Proceedings of the 24th International Conference on Data Engineering, 2008

2007
Hierarchical Threshold Secret Sharing.
J. Cryptology, 2007

k -Anonymization with Minimal Loss of Information.
Proceedings of the Algorithms, 2007

2006
Improved efficiency for revocation schemes via Newton interpolation.
ACM Trans. Inf. Syst. Secur., 2006

Optimal preemptive scheduling for general target functions.
J. Comput. Syst. Sci., 2006

Vector assignment schemes for asymmetric settings.
Acta Inf., 2006

Generating summaries for large collections of geo-referenced photographs.
Proceedings of the 15th international conference on World Wide Web, 2006

Generating summaries and visualization for large collections of geo-referenced photographs.
Proceedings of the 8th ACM SIGMM International Workshop on Multimedia Information Retrieval, 2006

Multipartite Secret Sharing by Bivariate Interpolation.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Low Bandwidth Dynamic Traitor Tracing Schemes.
J. Cryptology, 2005

Characterizing Ideal Weighted Threshold Secret Sharing.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

2004
Approximation schemes for the Min-Max Starting Time Problem.
Acta Inf., 2004

Hierarchical Threshold Secret Sharing.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Optimal Preemptive Scheduling for General Target Functions.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003
Vector assignment problems: a general framework.
J. Algorithms, 2003

Approximation Schemes for the Min-Max Starting Time Problem.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002
Vector Assignment Problems: A General Framework.
Proceedings of the Algorithms, 2002

2001
Dynamic Traitor Tracing.
J. Cryptology, 2001

1999
Dynamic Traitor Training.
Proceedings of the Advances in Cryptology, 1999

1997
Homogenization of Two-Dimensional Linear Flows with Integral Invariance.
SIAM Journal of Applied Mathematics, 1997


  Loading...