4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 1-358, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@Proceedings{chung:LIPIcs.ITC.2023, title = {{LIPIcs, Volume 267, ITC 2023, Complete Volume}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {1--358}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023}, URN = {urn:nbn:de:0030-drops-183272}, doi = {10.4230/LIPIcs.ITC.2023}, annote = {Keywords: LIPIcs, Volume 267, ITC 2023, Complete Volume} }
4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 0:i-0:xii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{chung:LIPIcs.ITC.2023.0, author = {Chung, Kai-Min}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {0:i--0:xii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.0}, URN = {urn:nbn:de:0030-drops-183280}, doi = {10.4230/LIPIcs.ITC.2023.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Nicolas Resch and Chen Yuan. Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 1:1-1:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{resch_et_al:LIPIcs.ITC.2023.1, author = {Resch, Nicolas and Yuan, Chen}, title = {{Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {1:1--1:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.1}, URN = {urn:nbn:de:0030-drops-183297}, doi = {10.4230/LIPIcs.ITC.2023.1}, annote = {Keywords: Secure transmission, Information theoretical secure, MDS codes} }
Noam Mazor. A Lower Bound on the Share Size in Evolving Secret Sharing. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 2:1-2:9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{mazor:LIPIcs.ITC.2023.2, author = {Mazor, Noam}, title = {{A Lower Bound on the Share Size in Evolving Secret Sharing}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {2:1--2:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.2}, URN = {urn:nbn:de:0030-drops-183300}, doi = {10.4230/LIPIcs.ITC.2023.2}, annote = {Keywords: Secret sharing, Evolving secret sharing} }
Andrej Bogdanov. Csirmaz’s Duality Conjecture and Threshold Secret Sharing. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 3:1-3:6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{bogdanov:LIPIcs.ITC.2023.3, author = {Bogdanov, Andrej}, title = {{Csirmaz’s Duality Conjecture and Threshold Secret Sharing}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {3:1--3:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.3}, URN = {urn:nbn:de:0030-drops-183317}, doi = {10.4230/LIPIcs.ITC.2023.3}, annote = {Keywords: Threshold secret sharing, Fourier analysis} }
Cody Freitag and Ilan Komargodski. The Cost of Statistical Security in Proofs for Repeated Squaring. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 4:1-4:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{freitag_et_al:LIPIcs.ITC.2023.4, author = {Freitag, Cody and Komargodski, Ilan}, title = {{The Cost of Statistical Security in Proofs for Repeated Squaring}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {4:1--4:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.4}, URN = {urn:nbn:de:0030-drops-183326}, doi = {10.4230/LIPIcs.ITC.2023.4}, annote = {Keywords: Cryptographic Proofs, Repeated Squaring, Lower Bounds} }
Nils Fleischhacker, Suparno Ghoshal, and Mark Simkin. Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 5:1-5:26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{fleischhacker_et_al:LIPIcs.ITC.2023.5, author = {Fleischhacker, Nils and Ghoshal, Suparno and Simkin, Mark}, title = {{Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {5:1--5:26}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.5}, URN = {urn:nbn:de:0030-drops-183331}, doi = {10.4230/LIPIcs.ITC.2023.5}, annote = {Keywords: non-malleability, multi-party protocols} }
Vipul Goyal, Chen-Da Liu-Zhang, and Rafail Ostrovsky. Asymmetric Multi-Party Computation. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 6:1-6:25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{goyal_et_al:LIPIcs.ITC.2023.6, author = {Goyal, Vipul and Liu-Zhang, Chen-Da and Ostrovsky, Rafail}, title = {{Asymmetric Multi-Party Computation}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {6:1--6:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.6}, URN = {urn:nbn:de:0030-drops-183342}, doi = {10.4230/LIPIcs.ITC.2023.6}, annote = {Keywords: multiparty computation, asymmetric, delays, communication} }
Ivan Damgård, Daniel Escudero, and Antigoni Polychroniadou. Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 7:1-7:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{damgard_et_al:LIPIcs.ITC.2023.7, author = {Damg\r{a}rd, Ivan and Escudero, Daniel and Polychroniadou, Antigoni}, title = {{Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {7:1--7:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.7}, URN = {urn:nbn:de:0030-drops-183355}, doi = {10.4230/LIPIcs.ITC.2023.7}, annote = {Keywords: Secure Multiparty Computation, Unstable Networks} }
Fabrice Benhamouda, Shai Halevi, and Lev Stambler. Weighted Secret Sharing from Wiretap Channels. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 8:1-8:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{benhamouda_et_al:LIPIcs.ITC.2023.8, author = {Benhamouda, Fabrice and Halevi, Shai and Stambler, Lev}, title = {{Weighted Secret Sharing from Wiretap Channels}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {8:1--8:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.8}, URN = {urn:nbn:de:0030-drops-183365}, doi = {10.4230/LIPIcs.ITC.2023.8}, annote = {Keywords: Secret sharing, ramp weighted secret sharing, wiretap channel} }
Samuel Bouaziz-Ermann, Alex B. Grilo, and Damien Vergnaud. Quantum Security of Subset Cover Problems. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 9:1-9:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{bouazizermann_et_al:LIPIcs.ITC.2023.9, author = {Bouaziz-Ermann, Samuel and Grilo, Alex B. and Vergnaud, Damien}, title = {{Quantum Security of Subset Cover Problems}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {9:1--9:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.9}, URN = {urn:nbn:de:0030-drops-183378}, doi = {10.4230/LIPIcs.ITC.2023.9}, annote = {Keywords: Cryptography, Random oracle model, Quantum information} }
Kasper Green Larsen, Maciej Obremski, and Mark Simkin. Distributed Shuffling in Adversarial Environments. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 10:1-10:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{larsen_et_al:LIPIcs.ITC.2023.10, author = {Larsen, Kasper Green and Obremski, Maciej and Simkin, Mark}, title = {{Distributed Shuffling in Adversarial Environments}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.10}, URN = {urn:nbn:de:0030-drops-183385}, doi = {10.4230/LIPIcs.ITC.2023.10}, annote = {Keywords: Distributed Computing, Shuffling} }
Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, and Divya Ravi. MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 11:1-11:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{keller_et_al:LIPIcs.ITC.2023.11, author = {Keller, Hannah and Orlandi, Claudio and Paskin-Cherniavsky, Anat and Ravi, Divya}, title = {{MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {11:1--11:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.11}, URN = {urn:nbn:de:0030-drops-183391}, doi = {10.4230/LIPIcs.ITC.2023.11}, annote = {Keywords: Secure Multiparty Computation, Bottleneck Complexity, Information-theoretic} }
Mohammad Hajiabadi, Shahram Khazaei, and Behzad Vahdani. Randomness Recoverable Secret Sharing Schemes. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 12:1-12:25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{hajiabadi_et_al:LIPIcs.ITC.2023.12, author = {Hajiabadi, Mohammad and Khazaei, Shahram and Vahdani, Behzad}, title = {{Randomness Recoverable Secret Sharing Schemes}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {12:1--12:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.12}, URN = {urn:nbn:de:0030-drops-183404}, doi = {10.4230/LIPIcs.ITC.2023.12}, annote = {Keywords: Secret sharing, Randomness recovery} }
Ivan Damgård, Divya Ravi, Daniel Tschudi, and Sophia Yakoubov. Secure Communication in Dynamic Incomplete Networks. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 13:1-13:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{damgard_et_al:LIPIcs.ITC.2023.13, author = {Damg\r{a}rd, Ivan and Ravi, Divya and Tschudi, Daniel and Yakoubov, Sophia}, title = {{Secure Communication in Dynamic Incomplete Networks}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {13:1--13:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.13}, URN = {urn:nbn:de:0030-drops-183419}, doi = {10.4230/LIPIcs.ITC.2023.13}, annote = {Keywords: Secure Communication, Dynamic Incomplete Network, Information-theoretic} }
Justin Holmgren and Ruta Jawale. Locally Covert Learning. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 14:1-14:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{holmgren_et_al:LIPIcs.ITC.2023.14, author = {Holmgren, Justin and Jawale, Ruta}, title = {{Locally Covert Learning}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {14:1--14:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.14}, URN = {urn:nbn:de:0030-drops-183421}, doi = {10.4230/LIPIcs.ITC.2023.14}, annote = {Keywords: learning theory, adversarial machine learning, zero knowledge, Fourier analysis of boolean functions, Goldreich-Levin algorithm, Kushilevitz-Mansour algorithm} }
Mohammad Mahmoody and Wei Qi. Online Mergers and Applications to Registration-Based Encryption and Accumulators. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 15:1-15:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{mahmoody_et_al:LIPIcs.ITC.2023.15, author = {Mahmoody, Mohammad and Qi, Wei}, title = {{Online Mergers and Applications to Registration-Based Encryption and Accumulators}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {15:1--15:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.15}, URN = {urn:nbn:de:0030-drops-183432}, doi = {10.4230/LIPIcs.ITC.2023.15}, annote = {Keywords: Registration-based encryption, Accumulators, Merkle Trees} }
Amos Beimel. Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 16:1-16:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{beimel:LIPIcs.ITC.2023.16, author = {Beimel, Amos}, title = {{Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {16:1--16:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.16}, URN = {urn:nbn:de:0030-drops-183440}, doi = {10.4230/LIPIcs.ITC.2023.16}, annote = {Keywords: Secret Sharing, Share Size, Lower Bounds, Monotone Circuits} }
Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson, and Samson Zhou. Differentially Private Aggregation via Imperfect Shuffling. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 17:1-17:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{ghazi_et_al:LIPIcs.ITC.2023.17, author = {Ghazi, Badih and Kumar, Ravi and Manurangsi, Pasin and Nelson, Jelani and Zhou, Samson}, title = {{Differentially Private Aggregation via Imperfect Shuffling}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {17:1--17:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.17}, URN = {urn:nbn:de:0030-drops-183453}, doi = {10.4230/LIPIcs.ITC.2023.17}, annote = {Keywords: Differential privacy, private summation, shuffle model} }
Keitaro Hiwatashi and Koji Nuida. Exponential Correlated Randomness Is Necessary in Communication-Optimal Perfectly Secure Two-Party Computation. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 18:1-18:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{hiwatashi_et_al:LIPIcs.ITC.2023.18, author = {Hiwatashi, Keitaro and Nuida, Koji}, title = {{Exponential Correlated Randomness Is Necessary in Communication-Optimal Perfectly Secure Two-Party Computation}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.18}, URN = {urn:nbn:de:0030-drops-183462}, doi = {10.4230/LIPIcs.ITC.2023.18}, annote = {Keywords: Secure Computation, Correlated Randomness, Lower Bound} }
Feedback for Dagstuhl Publishing