Multi-recipient and threshold encryption based on hidden multipliers
From MaRDI portal
Publication:6601464
DOI10.46298/JGCC.2023.14.2.10150MaRDI QIDQ6601464FDOQ6601464
Authors: Vitaliĭ Roman'kov 
Publication date: 10 September 2024
Published in: Journal of Groups, Complexity, Cryptology (Search for Journal in Brave)
Cites Work
- How to share a secret
- How to share a function securely
- Dynamic Threshold Public-Key Encryption
- Securing threshold cryptosystems against chosen ciphertext attack
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
- Topics in Cryptology – CT-RSA 2006
- An explication of secret sharing schemes
- On secret sharing systems
- Secret-Sharing Schemes: A Survey
- Title not available (Why is that?)
- Secret-sharing with a class of ternary codes
- Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
- New probabilistic public-key encryption based on the RSA cryptosystem
- Title not available (Why is that?)
- Computing Functions of a Shared Secret
- MDS secret-sharing scheme secure against cheaters
- Title not available (Why is that?)
- A SEMANTICALLY SECURE PUBLIC-KEY CRYPTOSYSTEM BASED ON RSA
- The access structure of some secret-sharing schemes
- A dynamic secret sharing scheme with cheater detection
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)
