On cryptographic anonymity and unpredictability in secret sharing

DOI10.1016/J.IPL.2020.105965zbMATH Open1441.94092OpenAlexW3025808247WikidataQ114848354 ScholiaQ114848354MaRDI QIDQ783702FDOQ783702

Authors: Anat Paskin-Cherniavsky, Ruxandra Florentina Olimid 

Publication date: 4 August 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2020.105965

Recommendations

• Providing anonymity in unconditionally secure secret sharing schemes
• Anonymity in shared symmetric key primitives
• Anonymous secret sharing schemes
• On the bound for anonymous secret sharing schemes
• On the size of shares for secret sharing schemes

zbMATH Keywords

cryptographysecret sharinganonymity

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Player simulation and general adversary structures in perfect multiparty computation
• Anonymous secret sharing schemes
• Providing anonymity in unconditionally secure secret sharing schemes
• Non-interactive secure multiparty computation

Cited In (5)

• Individual cryptography
• An unequal probability scheme for improving anonymity in shared key operations
• Anonymity in shared symmetric key primitives
• Title not available (Why is that?)
• Providing anonymity in unconditionally secure secret sharing schemes

This page was built for publication: On cryptographic anonymity and unpredictability in secret sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q783702)