May 10, 2022 · We present a simple protocol for shuffling the list of ciphertexts efficiently. The main technical contribution of this work is to prove that ...
scholar.google.com › citations
Jun 15, 2024 · Our distributed shuffling protocol, which provides provable security guarantees against a stronger adversary, can be used as a direct ...
May 9, 2022 · We present a distributed shuffling protocol, which guarantees that the adversary's probability of guessing the location of a commitment ci with ...
Jul 21, 2023 · We present a simple protocol for shuffling the list of ciphertexts efficiently. The main technical contribution of this work is to prove that ...
An adversary A can track some of the ciphertexts and adaptively corrupt some of the shufflers. We present a simple protocol for shuffling the list of ...
Jan 13, 2022 · See the Distributed Shuffling in Adversarial Environments paper for the security analysis of the Randshuffle algorithm. Proofs of correct ...
Distributed Shuffling in Adversarial Environments. Kasper Green Larsen, Maciej Obremski, Mark Simkin ITC 2023 | [ePrint]. Interactive Non-Malleable Codes ...
Jul 29, 2024 · ABSTRACT. The shuffle model of differential privacy provides promising privacy- utility balances in decentralized, privacy-preserving data ...
A list of recent papers about adversarial learning - Trustworthy-AI-Group/Adversarial_Examples_Papers.
By talking about them "defending" pile shuffling, I give the situation an adversarial framing, with them as the plucky underdogs. And then "it doesn't go ...