Tamir Tassa

ACM Trans. Intell. Syst. Technol., April, 2024

The Multiple Millionaires' Problem: New Algorithmic Approaches and Protocols.

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., 2024

The Multiple Millionaires' Problem.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Distributed Protocols for Oblivious Transfer and Polynomial Evaluation.

[BibT_eX]

[DOI]

Aviad Ben Arie

IACR Cryptol. ePrint Arch., 2024

Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules.

[BibT_eX]

[DOI]

Lihi Dery

Proceedings of the 19th International Conference on Availability, Reliability and Security, 2024

2023

Privacy preserving solution of DCOPs by mediation.

[BibT_eX]

[DOI]

Pablo Kogan

Artif. Intell., June, 2023

2022

Privacy-preserving Collaborative Filtering by Distributed Mediation.

[BibT_eX]

[DOI]

Alon Ben Horin

ACM Trans. Intell. Syst. Technol., 2022

Privacy Preserving DCOP Solving by Mediation.

[BibT_eX]

[DOI]

Pablo Kogan

Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

2021

Fear not, vote truthfully: Secure Multiparty Computation of score based rules.

[BibT_eX]

[DOI]

Lihi Dery

Expert Syst. Appl., 2021

PC-SyncBB: A privacy preserving collusion secure DCOP algorithm.

[BibT_eX]

[DOI]

Artif. Intell., 2021

DEMO: A Secure Voting System for Score Based Elections.

[BibT_eX]

[DOI]

Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020

Mediated Secure Multi-Party Protocols for Collaborative Filtering.

[BibT_eX]

[DOI]

ACM Trans. Intell. Syst. Technol., 2020

FaiRecSys: mitigating algorithmic bias in recommender systems.

[BibT_eX]

[DOI]

Int. J. Data Sci. Anal., 2020

2019

Privacy-Preserving Planarity Testing of Distributed Graphs.

[BibT_eX]

[DOI]

Guy Barshap

Trans. Data Priv., 2019

Secure Voting Protocols with Perfect Ballot Secrecy.

[BibT_eX]

[DOI]

Lihi Dery

CoRR, 2019

Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs.

[BibT_eX]

[DOI]

Artif. Intell., 2019

A Privacy Preserving Collusion Secure DCOP Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2017

Privacy Preserving Implementation of the Max-Sum Algorithm and its Variants.

[BibT_eX]

[DOI]

Roie Zivan

J. Artif. Intell. Res., 2017

Secure Centrality Computation Over Multiple Networks.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on World Wide Web, 2017

Secure Multi-Party Protocols for Item-Based Collaborative Filtering.

[BibT_eX]

[DOI]

Proceedings of the Eleventh ACM Conference on Recommender Systems, 2017

2016

Individual privacy in social influence networks.

[BibT_eX]

[DOI]

Sara Hajian

Francesco Bonchi

Soc. Netw. Anal. Min., 2016

Content sharing schemes in DRM systems with enhanced performance and privacy preservation.

[BibT_eX]

[DOI]

Michal Davidson

Ehud Gudes

J. Comput. Secur., 2016

P-SyncBB: A Privacy Preserving Branch and Bound DCOP Algorithm.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

Preserving Privacy in Region Optimal DCOP Algorithms.

[BibT_eX]

[DOI]

Roie Zivan

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Privacy Preserving Computations for Viral Marketing: The Case of Rational Players.

[BibT_eX]

[DOI]

Rica Gonen

Proceedings of the 11th International Conference on Availability, Reliability and Security, 2016

2015

Privacy by diversity in sequential releases of databases.

[BibT_eX]

[DOI]

Inf. Sci., 2015

Revisiting distance-based record linkage for privacy-preserving release of statistical datasets.

[BibT_eX]

[DOI]

Data Knowl. Eng., 2015

More Constraints, Smaller Coresets: Constrained Matrix Approximation of Sparse Big Data.

[BibT_eX]

[DOI]

Dan Feldman

Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Max-Sum Goes Private.

[BibT_eX]

[DOI]

Roie Zivan

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

Secure Mining of Association Rules inHorizontally Distributed Databases.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2014

Constrained obfuscation of relational databases.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Improving accuracy of classification models induced from anonymized datasets.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Identity obfuscation in graphs through the information theoretic lens.

[BibT_eX]

[DOI]

Francesco Bonchi

Inf. Sci., 2014

Planning high order trajectories with general initial and final conditions and asymmetric bounds.

[BibT_eX]

[DOI]

Ben Ezair

Zvi Shiller

Int. J. Robotics Res., 2014

Privacy Preserving Estimation of Social Influence.

[BibT_eX]

[DOI]

Francesco Bonchi

Proceedings of the 17th International Conference on Extending Database Technology, 2014

Efficient and Enhanced Solutions for Content Sharing in DRM Systems.

[BibT_eX]

[DOI]

Michal Davidson

Ehud Gudes

Proceedings of the Data and Applications Security and Privacy XXVIII, 2014

A privacy-preserving algorithm for distributed constraint optimization.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Anonymization of Centralized and Distributed Social Networks by Sequential Clustering.

[BibT_eX]

[DOI]

Dror J. Cohen

IEEE Trans. Knowl. Data Eng., 2013

On Syntactic Anonymity and Differential Privacy.

[BibT_eX]

[DOI]

Chris Clifton

Trans. Data Priv., 2013

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Oblivious evaluation of multivariate polynomials.

[BibT_eX]

[DOI]

Ayman Jarrous

Yonatan Ben-Ya'akov

J. Math. Cryptol., 2013

2012

Secure distributed computation of anonymized views of shared databases.

[BibT_eX]

[DOI]

Ehud Gudes

ACM Trans. Database Syst., 2012

k-Concealment: An Alternative Model of k-Type Anonymity.

[BibT_eX]

[DOI]

Arnon Mazza

Trans. Data Priv., 2012

Finding all maximally-matchable edges in a bipartite graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Injecting Uncertainty in Graphs for Identity Obfuscation.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2012

Limiting disclosure of sensitive data in sequential releases of databases.

[BibT_eX]

[DOI]

Inf. Sci., 2012

A practical approximation algorithm for optimal k-anonymity.

[BibT_eX]

[DOI]

Batya Kenig

Data Min. Knowl. Discov., 2012

2011

Generalized oblivious transfer by secret sharing.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2011

Finding All Allowed Edges in a Bipartite Graph

[BibT_eX]

[DOI]

CoRR, 2011

Secure Mining of Association Rules in Horizontally Distributed Databases

[BibT_eX]

[DOI]

CoRR, 2011

2010

Efficient Anonymizations with Enhanced Utility.

[BibT_eX]

[DOI]

Jacob Goldberger

Trans. Data Priv., 2010

2009

k-Anonymization with Minimal Loss of Information.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2009

Multipartite Secret Sharing by Bivariate Interpolation.

[BibT_eX]

[DOI]

Nira Dyn

J. Cryptol., 2009

On proper secrets, ( t , k )-bases and linear codes.

[BibT_eX]

[DOI]

Jorge L. Villar

Des. Codes Cryptogr., 2009

2008

Characterizing Ideal Weighted Threshold Secret Sharing.

[BibT_eX]

[DOI]

Amos Beimel

Enav Weinreb

SIAM J. Discret. Math., 2008

A hierarchical clustering algorithm based on the Hungarian method.

[BibT_eX]

[DOI]

Jacob Goldberger

Pattern Recognit. Lett., 2008

Improved versions of Tardos' fingerprinting scheme.

[BibT_eX]

[DOI]

Oded Blayer

Des. Codes Cryptogr., 2008

k-Anonymization Revisited.

[BibT_eX]

[DOI]

Arnon Mazza

Proceedings of the 24th International Conference on Data Engineering, 2008

2007

Hierarchical Threshold Secret Sharing.

[BibT_eX]

[DOI]

J. Cryptol., 2007

k -Anonymization with Minimal Loss of Information.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

Improved efficiency for revocation schemes via Newton interpolation.

[BibT_eX]

[DOI]

Noam Kogan

ACM Trans. Inf. Syst. Secur., 2006

Optimal preemptive scheduling for general target functions.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Vector assignment schemes for asymmetric settings.

[BibT_eX]

[DOI]

Acta Informatica, 2006

Generating summaries for large collections of geo-referenced photographs.

[BibT_eX]

[DOI]

Proceedings of the 15th international conference on World Wide Web, 2006

Generating summaries and visualization for large collections of geo-referenced photographs.

[BibT_eX]

[DOI]

Proceedings of the 8th ACM SIGMM International Workshop on Multimedia Information Retrieval, 2006

2005

Low Bandwidth Dynamic Traitor Tracing Schemes.

[BibT_eX]

[DOI]

J. Cryptol., 2005

2004

Approximation schemes for the Min-Max Starting Time Problem.

[BibT_eX]

[DOI]

Acta Informatica, 2004

2003

Vector assignment problems: a general framework.

[BibT_eX]

[DOI]

J. Algorithms, 2003

2001

Dynamic Traitor Tracing.

[BibT_eX]

[DOI]

Amos Fiat

J. Cryptol., 2001

1999

Dynamic Traitor Training.

[BibT_eX]

[DOI]

Amos Fiat

Proceedings of the Advances in Cryptology, 1999

1997

Homogenization of Two-Dimensional Linear Flows with Integral Invariance.

[BibT_eX]

[DOI]