15 citations · 27 across the 8 of their papers we have counts for
8 papers
Truth, Justice, and Secrecy: Cake Cutting Under Privacy Constraints
Yaron Salman, Tamir Tassa, Omer Lev +1
Cake-cutting algorithms, which aim to fairly allocate a continuous resource based on individual agent preferences, have seen significant progress over the past two decades. Much of…
Secure Order Based Voting Using Distributed Tallying
Tamir Tassa, Lihi Dery, Arthur Zamarin
Electronic voting systems have significant advantages in comparison with physical voting systems. One of the main challenges in e-voting systems is to secure the voting process: na…
Fairness-Driven Private Collaborative Machine Learning
Dana Pessach, Tamir Tassa, Erez Shmueli
The performance of machine learning algorithms can be considerably improved when trained over larger datasets. In many domains, such as medicine and finance, larger datasets can be…
A Privacy Preserving Collusion Secure DCOP Algorithm
Tamir Tassa, Tal Grinshpoun, Avishay Yanai
In recent years, several studies proposed privacy-preserving algorithms for solving Distributed Constraint Optimization Problems (DCOPs). All of those studies assumed that agents d…
Fear Not, Vote Truthfully: Secure Multiparty Computation of Score Based Rules
Lihi Dery, Tamir Tassa, Avishay Yanai
We propose a secure voting protocol for score-based voting rules, where independent talliers perform the tallying procedure. The protocol outputs the winning candidate(s) while pre…
Injecting Uncertainty in Graphs for Identity Obfuscation
Paolo Boldi, Francesco Bonchi, Aris Gionis +1
Data collected nowadays by social-networking applications create fascinating opportunities for building novel services, as well as expanding our understanding about social structur…
Finding All Allowed Edges in a Bipartite Graph
Tamir Tassa
We consider the problem of finding all allowed edges in a bipartite graph , i.e., all edges that are included in some maximum matching. We show that given any maximum matc…
Secure Mining of Association Rules in Horizontally Distributed Databases
Tamir Tassa
We propose a protocol for secure mining of association rules in horizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton (TKDE 2004). Ou…