Secret sets and applications
From MaRDI portal
Recommendations
- On secret set schemes
- Secret sharing schemes with applications in security protocols
- Secure set algorithms and complexity
- An Independence Relation for Sets of Secrets
- An independence relation for sets of secrets
- Finite set theory and its application to cryptology
- Secret Sharing Schemes with Algebraic Properties and Applications
- Complexity of secure sets
- Complexity of secure sets
Cites work
- scientific article; zbMATH DE number 177050 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 1088923 (Why is no real title available?)
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- The dining cryptographers problem: Unconditional sender and recipient untraceability
Cited in
(8)- Multiple ramp schemes
- Anonymous protocols: notions and equivalence
- scientific article; zbMATH DE number 2089971 (Why is no real title available?)
- scientific article; zbMATH DE number 2085442 (Why is no real title available?)
- An independence relation for sets of secrets
- Set signatures and their applications
- Cryptogenography
- On secret set schemes
This page was built for publication: Secret sets and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293178)