Distributed (correlation) samplers: how to remove a trusted dealer in one round
From MaRDI portal
Publication:2170033
Recommendations
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- On the power of correlated randomness in secure computation
- How to Generate and Use Universal Samplers
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
Cites work
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Breaking the sub-exponential barrier in obfustopia
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constrained pseudorandom functions and their applications
- Cryptography in the Multi-string Model
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Functional signatures and pseudorandom functions
- How to Generate and Use Universal Samplers
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Indistinguishability obfuscation from well-founded assumptions
- Multi-key fully-homomorphic encryption in the plain model
- Non-interactive multiparty computation without correlated randomness
- Non-interactive secure multiparty computation
- Non-interactive Zaps and New Techniques for NIZK
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Obfuscation of probabilistic circuits and applications
- On non-black-box simulation and the impossibility of approximate obfuscation
- On the communication complexity of secure function evaluation with long output
- Spooky Encryption and Its Applications
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Theory of Cryptography
Cited in
(11)- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Correlated pseudorandomness from expand-accumulate codes
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- Succinct computational secret sharing
- Cryptography from planted graphs: security with logarithmic-size messages
- Constant-round simulation-secure coin tossing extension with guaranteed output
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Succinct computational secret sharing for monotone circuits
- Succinct witness encryption for batch languages and applications
- On the impossibility of actively secure distributed samplers
- Threshold public-key encryption: definitions, relations, and CPA-to-CCA transforms
This page was built for publication: Distributed (correlation) samplers: how to remove a trusted dealer in one round
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170033)
