Distributing keys and random secrets with constant complexity
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1618057 (Why is no real title available?)
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1302842 (Why is no real title available?)
- scientific article; zbMATH DE number 1962164 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- scientific article; zbMATH DE number 1418290 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- Aggregatable distributed key generation
- Foundations of Cryptography
- How to recover a secret with \(O(n)\) additions
- How to share a secret
- LDPC codes achieve list decoding capacity
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Perfectly-Secure MPC with Linear Communication Complexity
- Pseudorandomness
- Randomness conductors and constant-degree lossless expanders
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- 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
- 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)
