Max-Sum Goes Private
Authors: Tamir Tassa, Roie Zivan, Tal Grinshpoun
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Our experiments on structured and realistic problems show that the overhead of privacy preservation in terms of runtime is reasonable. We measured the runtimes of the encryption and decryption operations by averaging multiple runs of the common Java implementation of the Paillier cryptosystem on a hardware comprised of an Intel i7-4600U processor and 16GB memory. |
| Researcher Affiliation | Academia | Tamir Tassa The Open University Ra anana, Israel tamirta@openu.ac.il Roie Zivan Ben-Gurion University of the Negev Beer-Sheva, Israel zivanr@bgu.ac.il Tal Grinshpoun Ariel University Ariel, Israel talgr@ariel.ac.il |
| Pseudocode | Yes | Protocol 1 Computing shares in messages that emerge from a variable node Protocol 2 Computing shares in messages that emerge from a function node Protocol 3 Computing the best assignment for Xi |
| Open Source Code | No | The paper provides a footnote with a URL to a Java implementation of the Paillier cryptosystem ('http://www.csee.umbc.edu/~kunliu1/research/Paillier.html'), which is a third-party tool used by the authors, but not the source code for their proposed P-MAX-SUM algorithm or its implementation. |
| Open Datasets | No | The paper mentions using 'relatively large graph coloring problems (including 100 agents, three colors in each domain and constraint density of 0.05) and meeting scheduling problems (including 90 agents, 20 meetings among them)' and states 'For more details on the setup see [Zivan et al., 2014].' While it describes the characteristics of the problems, it does not provide a direct link, DOI, or a citation to a specific, publicly available dataset that can be accessed. |
| Dataset Splits | No | The paper describes the problems used in experiments (graph coloring, meeting scheduling) but does not specify any training, validation, or test dataset splits. |
| Hardware Specification | Yes | We measured the runtimes of the encryption and decryption operations by averaging multiple runs of the common Java implementation of the Paillier cryptosystem on a hardware comprised of an Intel i7-4600U processor and 16GB memory. |
| Software Dependencies | No | The paper mentions 'common Java implementation of the Paillier cryptosystem' and links to a general website, but does not specify exact version numbers for Java or the Paillier library used. |
| Experiment Setup | Yes | The best solutions for relatively large graph coloring problems (including 100 agents, three colors in each domain and constraint density of 0.05) and meeting scheduling problems (including 90 agents, 20 meetings among them) were found within the first 5 and 10 iterations, respectively. For more details on the setup see [Zivan et al., 2014]. |