On the impossibility of actively secure distributed samplers
From MaRDI portal
Cites work
- A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it
- A Framework for Efficient and Composable Oblivious Transfer
- A Mathematical Theory of Communication
- A Pseudorandom Generator from any One-way Function
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Constant-round simulation-secure coin tossing extension with guaranteed output
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Fast distributed RSA key generation for semi-honest and malicious adversaries
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- scientific article; zbMATH DE number 177820 (Why is no real title available?)
- scientific article; zbMATH DE number 2009949 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- Multiparty generation of an RSA modulus
- Non-interactive multiparty computation without correlated randomness
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- Some notions of entropy for cryptography. (Invited talk)
- Spooky Encryption and Its Applications
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- What Security Can We Achieve Within 4 Rounds?
This page was built for publication: On the impossibility of actively secure distributed samplers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233246)
