Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
How to share a function securely
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
SIAM Journal on Discrete Mathematics
Chinese remainder theorem: applications in computing, coding, cryptography
Chinese remainder theorem: applications in computing, coding, cryptography
Signature schemes based on the strong RSA assumption
ACM Transactions on Information and System Security (TISSEC)
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Some Recent Research Aspects of Threshold Cryptography
ISW '97 Proceedings of the First International Workshop on Information Security
Threshold cryptography based on Asmuth-Bloom secret sharing
Information Sciences: an International Journal
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
Recently, Chinese Remainder Theorem (CRT) based function sharing schemes are proposed in the literature. In this paper, we investigate how a CRT-based threshold scheme can be enhanced with the robustness property. To the best of our knowledge, these are the first robust threshold cryptosystems based on a CRT-based secret sharing.