Security-preserving distributed samplers: how to generate any CRS in one round without random oracles

DOI10.1007/978-3-031-38557-5_16OpenAlexW4385654740MaRDI QIDQ6186601

Damiano Abram, Brent Waters, Mark Zhandry

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38557-5_16

zbMATH Keywords

MPC protocolsingle-message zero knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• One-message zero knowledge and non-malleable commitments
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Non-interactive multiparty computation without correlated randomness
• Multi-key fully-homomorphic encryption in the plain model
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Black-box non-interactive non-malleable commitments
• Distributed (correlation) samplers: how to remove a trusted dealer in one round
• Non-interactive non-malleability from quantum supremacy
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• What Security Can We Achieve Within 4 Rounds?
• The Magic of ELFs
• On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
• Perfect Non-interactive Zero Knowledge for NP
• A Framework for Efficient and Composable Oblivious Transfer
• Cryptography in the Multi-string Model
• Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
• Advances in Cryptology - CRYPTO 2003
• New Negative Results on Differing-Inputs Obfuscation
• On Extractability Obfuscation
• Non-interactive Zaps and New Techniques for NIZK
• Theory of Cryptography

This page was built for publication: Security-preserving distributed samplers: how to generate any CRS in one round without random oracles