Published in: LIPIcs, Volume 230, 3rd Conference on Information-Theoretic Cryptography (ITC 2022)
Marshall Ball and Tim Randolph. A Note on the Complexity of Private Simultaneous Messages with Many Parties. In 3rd Conference on Information-Theoretic Cryptography (ITC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 230, pp. 7:1-7:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ball_et_al:LIPIcs.ITC.2022.7, author = {Ball, Marshall and Randolph, Tim}, title = {{A Note on the Complexity of Private Simultaneous Messages with Many Parties}}, booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)}, pages = {7:1--7:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-238-9}, ISSN = {1868-8969}, year = {2022}, volume = {230}, editor = {Dachman-Soled, Dana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2022.7}, URN = {urn:nbn:de:0030-drops-164855}, doi = {10.4230/LIPIcs.ITC.2022.7}, annote = {Keywords: Secure computation, Private Simultaneous Messages} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Marshall Ball, Oded Goldreich, and Tal Malkin. Randomness Extraction from Somewhat Dependent Sources. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ball_et_al:LIPIcs.ITCS.2022.12, author = {Ball, Marshall and Goldreich, Oded and Malkin, Tal}, title = {{Randomness Extraction from Somewhat Dependent Sources}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.12}, URN = {urn:nbn:de:0030-drops-156081}, doi = {10.4230/LIPIcs.ITCS.2022.12}, annote = {Keywords: Randomness Extraction, min-entropy, mutual information, two-source extractors, two-source condenser} }
Published in: LIPIcs, Volume 199, 2nd Conference on Information-Theoretic Cryptography (ITC 2021)
Marshall Ball, Alper Çakan, and Tal Malkin. Linear Threshold Secret-Sharing with Binary Reconstruction. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 12:1-12:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ball_et_al:LIPIcs.ITC.2021.12, author = {Ball, Marshall and \c{C}akan, Alper and Malkin, Tal}, title = {{Linear Threshold Secret-Sharing with Binary Reconstruction}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {12:1--12:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.12}, URN = {urn:nbn:de:0030-drops-143313}, doi = {10.4230/LIPIcs.ITC.2021.12}, annote = {Keywords: Secret sharing, Span programs, Lattice-based cryptography} }
Published in: LIPIcs, Volume 200, 36th Computational Complexity Conference (CCC 2021)
Marshall Ball, Oded Goldreich, and Tal Malkin. Communication Complexity with Defective Randomness. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 14:1-14:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ball_et_al:LIPIcs.CCC.2021.14, author = {Ball, Marshall and Goldreich, Oded and Malkin, Tal}, title = {{Communication Complexity with Defective Randomness}}, booktitle = {36th Computational Complexity Conference (CCC 2021)}, pages = {14:1--14:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-193-1}, ISSN = {1868-8969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.14}, URN = {urn:nbn:de:0030-drops-142886}, doi = {10.4230/LIPIcs.CCC.2021.14}, annote = {Keywords: Randomized Communication Complexity, Randomness Extraction, Min-Entropy} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, and Tal Malkin. Limits to Non-Malleability. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 80:1-80:32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ball_et_al:LIPIcs.ITCS.2020.80, author = {Ball, Marshall and Dachman-Soled, Dana and Kulkarni, Mukul and Malkin, Tal}, title = {{Limits to Non-Malleability}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {80:1--80:32}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.80}, URN = {urn:nbn:de:0030-drops-117657}, doi = {10.4230/LIPIcs.ITCS.2020.80}, annote = {Keywords: non-malleable codes, black-box impossibility, tamper-resilient cryptogtaphy, average-case hardness} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, and Tal Malkin. On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 86:1-86:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ball_et_al:LIPIcs.ITCS.2020.86, author = {Ball, Marshall and Holmgren, Justin and Ishai, Yuval and Liu, Tianren and Malkin, Tal}, title = {{On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {86:1--86:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.86}, URN = {urn:nbn:de:0030-drops-117714}, doi = {10.4230/LIPIcs.ITCS.2020.86}, annote = {Keywords: Randomized Encoding, Private Simultaneous Messages} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Alexandr Andoni, Tal Malkin, and Negev Shekel Nosatzki. Two Party Distribution Testing: Communication and Security. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{andoni_et_al:LIPIcs.ICALP.2019.15, author = {Andoni, Alexandr and Malkin, Tal and Nosatzki, Negev Shekel}, title = {{Two Party Distribution Testing: Communication and Security}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.15}, URN = {urn:nbn:de:0030-drops-105916}, doi = {10.4230/LIPIcs.ICALP.2019.15}, annote = {Keywords: distribution testing, communication complexity, security} }
Feedback for Dagstuhl Publishing