Distributed (correlation) samplers: how to remove a trusted dealer in one round
From MaRDI portal
Publication:2170033
DOI10.1007/978-3-031-06944-4_27zbMath1496.94022OpenAlexW4285190485MaRDI QIDQ2170033
Peter Scholl, Damiano Abram, Sophia Yakoubov
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_27
Related Items (3)
Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ Succinct computational secret sharing
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Efficient pseudorandom correlation generators from ring-LPN
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Efficient pseudorandom correlation generators: silent OT extension and more
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Spooky Encryption and Its Applications
- Constrained Pseudorandom Functions and Their Applications
- Non-Interactive Secure Multiparty Computation
- How to Generate and Use Universal Samplers
- On the Communication Complexity of Secure Function Evaluation with Long Output
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
- Improved Garbled Circuit: Free XOR Gates and Applications
- Cryptography in the Multi-string Model
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Obfuscation of Probabilistic Circuits and Applications
- Breaking the Sub-Exponential Barrier in Obfustopia
- Functional Signatures and Pseudorandom Functions
- Theory of Cryptography
- Non-interactive Zaps and New Techniques for NIZK
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Indistinguishability obfuscation from well-founded assumptions
This page was built for publication: Distributed (correlation) samplers: how to remove a trusted dealer in one round
