default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th ITC 2023: Aarhus, Denmark
- Kai-Min Chung
:
4th Conference on Information-Theoretic Cryptography, ITC 2023, June 6-8, 2023, Aarhus University, Aarhus, Denmark. LIPIcs 267, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-271-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Nicolas Resch, Chen Yuan:
Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. 1:1-1:20 - Noam Mazor:
A Lower Bound on the Share Size in Evolving Secret Sharing. 2:1-2:9 - Andrej Bogdanov:
Csirmaz's Duality Conjecture and Threshold Secret Sharing. 3:1-3:6 - Cody Freitag, Ilan Komargodski:
The Cost of Statistical Security in Proofs for Repeated Squaring. 4:1-4:23 - Nils Fleischhacker, Suparno Ghoshal, Mark Simkin:
Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting. 5:1-5:26 - Vipul Goyal, Chen-Da Liu-Zhang, Rafail Ostrovsky:
Asymmetric Multi-Party Computation. 6:1-6:25 - Ivan Damgård, Daniel Escudero, Antigoni Polychroniadou:
Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. 7:1-7:21 - Fabrice Benhamouda, Shai Halevi, Lev Stambler:
Weighted Secret Sharing from Wiretap Channels. 8:1-8:19 - Samuel Bouaziz-Ermann, Alex B. Grilo, Damien Vergnaud:
Quantum Security of Subset Cover Problems. 9:1-9:17 - Kasper Green Larsen, Maciej Obremski, Mark Simkin:
Distributed Shuffling in Adversarial Environments. 10:1-10:15 - Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, Divya Ravi:
MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. 11:1-11:22 - Mohammad Hajiabadi, Shahram Khazaei, Behzad Vahdani:
Randomness Recoverable Secret Sharing Schemes. 12:1-12:25 - Ivan Damgård, Divya Ravi, Daniel Tschudi, Sophia Yakoubov:
Secure Communication in Dynamic Incomplete Networks. 13:1-13:21 - Justin Holmgren, Ruta Jawale:
Locally Covert Learning. 14:1-14:12 - Mohammad Mahmoody, Wei Qi:
Online Mergers and Applications to Registration-Based Encryption and Accumulators. 15:1-15:23 - Amos Beimel:
Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs. 16:1-16:13 - Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson, Samson Zhou:
Differentially Private Aggregation via Imperfect Shuffling. 17:1-17:22 - Keitaro Hiwatashi, Koji Nuida:
Exponential Correlated Randomness Is Necessary in Communication-Optimal Perfectly Secure Two-Party Computation. 18:1-18:16
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-31 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
