Threshold cryptography based on Asmuth-Bloom secret sharing
From MaRDI portal
Publication:2384533
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A modular approach to key safeguarding
- A novel efficient \((t,n)\) threshold proxy signature scheme
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Simple Threshold Authenticated Key Exchange from Short Secrets
- Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
- How to share a function securely
- How to share a secret
- How to withstand mobile virus attacks (extended abstract)
- scientific article; zbMATH DE number 2085431 (Why is no real title available?)
- scientific article; zbMATH DE number 176567 (Why is no real title available?)
- scientific article; zbMATH DE number 1304291 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 1122449 (Why is no real title available?)
- scientific article; zbMATH DE number 2081074 (Why is no real title available?)
- scientific article; zbMATH DE number 1759349 (Why is no real title available?)
- Optimal resilient threshold GQ signatures
- Practical multi-candidate election system
- Practical threshold signatures
- Private Searching on Streaming Data
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Robust threshold DSS signatures
Cited in
(24)- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
- Homomorphic extensions of CRT-based secret sharing
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
- Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem
- Sharing DSS by the Chinese remainder theorem
- New efficient and practical verifiable multi-secret sharing schemes
- Secret image sharing based on chaotic map and Chinese remainder theorem
- Increased resilience in threshold cryptography: sharing a secret with devices that cannot store shares
- An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
- Threshold Secret Sharing Requires a Linear Size Alphabet
- Robust Threshold Schemes Based on the Chinese Remainder Theorem
- Practical Threshold Signatures with Linear Secret Sharing Schemes
- Paillier-based publicly verifiable (non-interactive) secret sharing
- Threshold cryptosystem with multiple secret sharing policies
- Discrete logarithm based additively homomorphic encryption and secure data aggregation
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
- Эллиптическая пороговая схема разделения секрета
- A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
- Secret sharing schemes from binary linear codes
- Threshold secret sharing with geometric algebras
- Selling multiple secrets to a single buyer
- A multisecret sharing scheme for color images based on cellular automata
This page was built for publication: Threshold cryptography based on Asmuth-Bloom secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384533)
