Threshold cryptography based on Asmuth-Bloom secret sharing
From MaRDI portal
Publication:2384533
DOI10.1016/j.ins.2007.04.008zbMath1142.94372OpenAlexW2105689512MaRDI QIDQ2384533
Publication date: 10 October 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.04.008
Related Items (19)
Selling multiple secrets to a single buyer ⋮ ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls ⋮ SECRET IMAGE SHARING BASED ON CHAOTIC MAP AND CHINESE REMAINDER THEOREM ⋮ An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem ⋮ Paillier-based publicly verifiable (non-interactive) secret sharing ⋮ Secret sharing schemes from binary linear codes ⋮ Robust Threshold Schemes Based on the Chinese Remainder Theorem ⋮ Homomorphic extensions of CRT-based secret sharing ⋮ On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme ⋮ Discrete logarithm based additively homomorphic encryption and secure data aggregation ⋮ Constructing ideal secret sharing schemes based on Chinese remainder theorem ⋮ New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures ⋮ A multisecret sharing scheme for color images based on cellular automata ⋮ New efficient and practical verifiable multi-secret sharing schemes ⋮ Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem ⋮ Practical Threshold Signatures with Linear Secret Sharing Schemes ⋮ A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem ⋮ Sharing DSS by the Chinese remainder theorem ⋮ New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal resilient threshold GQ signatures
- Robust threshold DSS signatures
- A novel efficient \((t,n)\) threshold proxy signature scheme
- Practical multi-candidate election system
- How to share a function securely
- How to share a secret
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A method for obtaining digital signatures and public-key cryptosystems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
- A modular approach to key safeguarding
- How to withstand mobile virus attacks (extended abstract)
- Private Searching on Streaming Data
- A Simple Threshold Authenticated Key Exchange from Short Secrets
This page was built for publication: Threshold cryptography based on Asmuth-Bloom secret sharing
