In Cooperation With
Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate
Chen Yuan and Nicolas Resch
A Lower Bound on the Share Size in Evolving Secret Sharing
Noam Mazor
Csirmaz’s Duality Conjecture and Threshold Secret Sharing
Andrej Bogdanov
The Cost of Statistical Security in Proofs for Repeated Squaring
Cody Freitag and Ilan Komargodski
Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting
Nils Fleischhacker, Suparno Ghoshal and Mark Simkin
Asymmetric Multi-Party Computation
Vipul Goyal, Chen-Da Liu-Zhang and Rafail Ostrovsky
Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks
Ivan Damgård, Daniel Escudero and Antigoni Polychroniadou
Exponential Correlated Randomness is Necessary in Communication-Optimal Perfectly Secure Two-Party Computation
Keitaro Hiwatashi and Koji Nuida
Weighted Secret Sharing from Wiretap Channels
Fabrice Benhamouda, Shai Halevi and Lev Stambler
Quantum security of subset cover problems
Samuel Bouaziz-Ermann, Alex Bredariol Grilo and Damien Vergnaud
Distributed Shuffling in Adversarial Environments
Kasper Green Larsen, Maciej Obremski and Mark Simkin
MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More
Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky and Divya Ravi
Randomness recoverable secret sharing schemes
Mohammad Hajiabadi, Shahram Khazaei and Behzad Vahdani
Secure Communication in Dynamic Incomplete Networks
Ivan Damgård, Divya Ravi, Daniel Tschudi and Sophia Yakoubov
Locally Covert Learning of Fourier-Sparse Functions
Justin Holmgren and Ruta Jawale
Online Mergers and Applications to (Optimal) Accumulators and Registration-Based Encryption
Mohammad Mahmoody and Wei Qi
Lower-Bounds for Secret-Sharing Schemes for k-Hypergraphs
Amos Beimel
Differentially Private Aggregation via Imperfect Shuffling
Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson and Samson Zhou