Multi-recipient and threshold encryption based on hidden multipliers

DOI10.46298/JGCC.2023.14.2.10150MaRDI QIDQ6601464

Vitaliĭ Roman'kov

Publication date: 10 September 2024

Published in: Journal of Groups, Complexity, Cryptology (Search for Journal in Brave)

zbMATH Keywords

cryptographythreshold schemehidden multipliers

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New probabilistic public-key encryption based on the RSA cryptosystem
• An explication of secret sharing schemes
• Secret-sharing with a class of ternary codes
• How to share a function securely
• Secret-Sharing Schemes: A Survey
• How to share a secret
• Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
• 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)
• Computing Functions of a Shared Secret
• MDS secret-sharing scheme secure against cheaters
• On secret sharing systems
• A SEMANTICALLY SECURE PUBLIC-KEY CRYPTOSYSTEM BASED ON RSA
• Topics in Cryptology – CT-RSA 2006
• A dynamic secret sharing scheme with cheater detection
• The access structure of some secret-sharing schemes

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)