Multi-recipient and threshold encryption based on hidden multipliers
From MaRDI portal
Publication:6601464
Recommendations
Cites work
- scientific article; zbMATH DE number 1024082 (Why is no real title available?)
- scientific article; zbMATH DE number 1950617 (Why is no real title available?)
- scientific article; zbMATH DE number 1500489 (Why is no real title available?)
- A SEMANTICALLY SECURE PUBLIC-KEY CRYPTOSYSTEM BASED ON RSA
- A dynamic secret sharing scheme with cheater detection
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
- An explication of secret sharing schemes
- Computing Functions of a Shared Secret
- Dynamic Threshold Public-Key Encryption
- How to share a function securely
- How to share a secret
- MDS secret-sharing scheme secure against cheaters
- Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
- New probabilistic public-key encryption based on the RSA cryptosystem
- On secret sharing systems
- Secret-Sharing Schemes: A Survey
- Secret-sharing with a class of ternary codes
- Securing threshold cryptosystems against chosen ciphertext attack
- The access structure of some secret-sharing schemes
- Topics in Cryptology – CT-RSA 2006
This page was built for publication: Multi-recipient and threshold encryption based on hidden multipliers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601464)
