@Proceedings{dachmansoled:LIPIcs.ITC.2022,
title = {{LIPIcs, Volume 230, ITC 2022, Complete Volume}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {1--328},
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},
URN = {urn:nbn:de:0030-drops-164775},
doi = {10.4230/LIPIcs.ITC.2022},
annote = {Keywords: LIPIcs, Volume 230, ITC 2022, Complete Volume}
}
@InProceedings{dachmansoled:LIPIcs.ITC.2022.0,
author = {Dachman-Soled, Dana},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {0:i--0:xii},
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.0},
URN = {urn:nbn:de:0030-drops-164780},
doi = {10.4230/LIPIcs.ITC.2022.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{eriguchi_et_al:LIPIcs.ITC.2022.1,
author = {Eriguchi, Reo and Kurosawa, Kaoru and Nuida, Koji},
title = {{Multi-Server PIR with Full Error Detection and Limited Error Correction}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {1:1--1:20},
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.1},
URN = {urn:nbn:de:0030-drops-164796},
doi = {10.4230/LIPIcs.ITC.2022.1},
annote = {Keywords: Private Information Retrieval, Error Detection, Error Correction}
}
@InProceedings{minematsu:LIPIcs.ITC.2022.2,
author = {Minematsu, Kazuhiko},
title = {{Property-Preserving Hash Functions and Combinatorial Group Testing}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {2:1--2:14},
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.2},
URN = {urn:nbn:de:0030-drops-164809},
doi = {10.4230/LIPIcs.ITC.2022.2},
annote = {Keywords: Hash function, Property-Preserving Hash, Combinatorial Group Testing, Provable Security}
}
@InProceedings{hazay_et_al:LIPIcs.ITC.2022.3,
author = {Hazay, Carmit and Venkitasubramaniam, Muthuramakrishnan and Weiss, Mor},
title = {{Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and More}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {3:1--3:24},
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.3},
URN = {urn:nbn:de:0030-drops-164817},
doi = {10.4230/LIPIcs.ITC.2022.3},
annote = {Keywords: Leakage Resilience, Secret Sharing, Equivocal Secret Sharing, Verifiable Secret Sharing, Function Secret Sharing, Threshold Encryption, Distributed Zero-Knowledge Proofs}
}
@InProceedings{dottling_et_al:LIPIcs.ITC.2022.4,
author = {D\"{o}ttling, Nico and Dujmovic, Jesko},
title = {{Maliciously Circuit-Private FHE from Information-Theoretic Principles}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {4:1--4:21},
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.4},
URN = {urn:nbn:de:0030-drops-164826},
doi = {10.4230/LIPIcs.ITC.2022.4},
annote = {Keywords: Fully Homomorphic Encryption, FHE, Homomorphic Encryption, Oblivious Transfer, Malicious Statistical Circuit Privacy, Multi-Hop, Information Theory, Cryptography}
}
@InProceedings{madathil_et_al:LIPIcs.ITC.2022.5,
author = {Madathil, Varun and Orsini, Chris and Scafuro, Alessandra and Venturi, Daniele},
title = {{From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-Theoretic}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {5:1--5:20},
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.5},
URN = {urn:nbn:de:0030-drops-164836},
doi = {10.4230/LIPIcs.ITC.2022.5},
annote = {Keywords: Oblivious Transfer, Black-Box compiler, Malicious Security, Plain Model}
}
@InProceedings{hubacek_et_al:LIPIcs.ITC.2022.6,
author = {Hub\'{a}\v{c}ek, Pavel and Jan\v{c}ov\'{a}, \v{L}ubica and Kr\'{a}lov\'{a}, Veronika},
title = {{On the Distributed Discrete Logarithm Problem with Preprocessing}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {6:1--6:19},
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.6},
URN = {urn:nbn:de:0030-drops-164847},
doi = {10.4230/LIPIcs.ITC.2022.6},
annote = {Keywords: Distributed discrete logarithm problem, preprocessing, generic group model}
}
@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}
}
@InProceedings{scholl_et_al:LIPIcs.ITC.2022.8,
author = {Scholl, Peter and Simkin, Mark and Siniscalchi, Luisa},
title = {{Multiparty Computation with Covert Security and Public Verifiability}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {8:1--8:13},
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.8},
URN = {urn:nbn:de:0030-drops-164861},
doi = {10.4230/LIPIcs.ITC.2022.8},
annote = {Keywords: Multi-party computation, covert security, public verifiability}
}
@InProceedings{coretti_et_al:LIPIcs.ITC.2022.9,
author = {Coretti, Sandro and Dodis, Yevgeniy and Karthikeyan, Harish and Stephens-Davidowitz, Noah and Tessaro, Stefano},
title = {{On Seedless PRNGs and Premature Next}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {9:1--9:20},
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.9},
URN = {urn:nbn:de:0030-drops-164870},
doi = {10.4230/LIPIcs.ITC.2022.9},
annote = {Keywords: seedless PRNGs, pseudorandom number generators, PRNG, Fortuna, premature next}
}
@InProceedings{badrinarayanan_et_al:LIPIcs.ITC.2022.10,
author = {Badrinarayanan, Saikrishna and Ishai, Yuval and Khurana, Dakshita and Sahai, Amit and Wichs, Daniel},
title = {{Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {10:1--10:21},
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.10},
URN = {urn:nbn:de:0030-drops-164885},
doi = {10.4230/LIPIcs.ITC.2022.10},
annote = {Keywords: XOR Lemma, Resettable MPC, Obfuscation}
}
@InProceedings{dhar_et_al:LIPIcs.ITC.2022.11,
author = {Dhar, Chandranan and Dodis, Yevgeniy and Nandi, Mridul},
title = {{Revisiting Collision and Local Opening Analysis of ABR Hash}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {11:1--11:22},
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.11},
URN = {urn:nbn:de:0030-drops-164890},
doi = {10.4230/LIPIcs.ITC.2022.11},
annote = {Keywords: ABR hash, collision resistance, local opening}
}
@InProceedings{rotem_et_al:LIPIcs.ITC.2022.12,
author = {Rotem, Lior and Segev, Gil},
title = {{A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {12:1--12:16},
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.12},
URN = {urn:nbn:de:0030-drops-164905},
doi = {10.4230/LIPIcs.ITC.2022.12},
annote = {Keywords: Discrete logarithm, Preprocessing}
}
@InProceedings{rotem:LIPIcs.ITC.2022.13,
author = {Rotem, Lior},
title = {{Revisiting the Uber Assumption in the Algebraic Group Model: Fine-Grained Bounds in Hidden-Order Groups and Improved Reductions in Bilinear Groups}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {13:1--13:13},
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.13},
URN = {urn:nbn:de:0030-drops-164910},
doi = {10.4230/LIPIcs.ITC.2022.13},
annote = {Keywords: Algebraic group model, Uber assumption, Bilinear groups, Hidden-order groups}
}
@InProceedings{chandran_et_al:LIPIcs.ITC.2022.14,
author = {Chandran, Nishanth and Forghani, Pouyan and Garay, Juan and Ostrovsky, Rafail and Patel, Rutvik and Zikas, Vassilis},
title = {{Universally Composable Almost-Everywhere Secure Computation}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {14:1--14:25},
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.14},
URN = {urn:nbn:de:0030-drops-164929},
doi = {10.4230/LIPIcs.ITC.2022.14},
annote = {Keywords: Secure multi-party computation, universal composability, almost-everywhere secure computation, sparse graphs, secure message transmission}
}
@InProceedings{asharov_et_al:LIPIcs.ITC.2022.15,
author = {Asharov, Gilad and Cohen, Ran and Shochat, Oren},
title = {{Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {15:1--15:16},
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.15},
URN = {urn:nbn:de:0030-drops-164933},
doi = {10.4230/LIPIcs.ITC.2022.15},
annote = {Keywords: secure multiparty computation, perfect security, adaptive security, BGW protocol}
}
@InProceedings{maji_et_al:LIPIcs.ITC.2022.16,
author = {Maji, Hemanta K. and Nguyen, Hai H. and Paskin-Cherniavsky, Anat and Suad, Tom and Wang, Mingyuan and Ye, Xiuyu and Yu, Albert},
title = {{Tight Estimate of the Local Leakage Resilience of the Additive Secret-Sharing Scheme \& Its Consequences}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {16:1--16:19},
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.16},
URN = {urn:nbn:de:0030-drops-164943},
doi = {10.4230/LIPIcs.ITC.2022.16},
annote = {Keywords: leakage resilience, additive secret-sharing, Shamir’s secret-sharing, physical-bit probing leakage attacks, Fourier analysis}
}
@InProceedings{boyle_et_al:LIPIcs.ITC.2022.17,
author = {Boyle, Elette and Gilboa, Niv and Ishai, Yuval and Kolobov, Victor I.},
title = {{Information-Theoretic Distributed Point Functions}},
booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
pages = {17:1--17:14},
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.17},
URN = {urn:nbn:de:0030-drops-164957},
doi = {10.4230/LIPIcs.ITC.2022.17},
annote = {Keywords: Information-theoretic cryptography, homomorphic secret sharing, private information retrieval, secure multiparty computation}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing