Distributing keys and random secrets with constant complexity
From MaRDI portal
Cites work
- A Pseudorandom Generator from any One-way Function
- Adaptive security for threshold cryptosystems
- Aggregatable distributed key generation
- Foundations of Cryptography
- How to recover a secret with O(n) additions
- How to share a secret
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- LDPC codes achieve list decoding capacity
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Non-interactive and information-theoretic secure verifiable secret sharing
- One round threshold discrete-log key generation without private channels
- Perfectly-Secure MPC with Linear Communication Complexity
- Pseudorandomness
- Randomness conductors and constant-degree lossless expanders
- Robust non-interactive zero knowledge
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Secure applications of Pedersen's distributed key generation protocol
- Secure distributed key generation for discrete-log based cryptosystems
- Secure multi-party computation with identifiable abort
- Security in Communication Networks
- Threshold secret sharing requires a linear-size alphabet
- Trading correctness for privacy in unconditional multi-party computation. (Extended abstract)
- Universally composable security
This page was built for publication: Distributing keys and random secrets with constant complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955256)
