Randomness recoverable secret sharing schemes

DOI10.1007/S00145-024-09515-4MaRDI QIDQ6617634zbMATH OpenFDO

Authors Mohammad Hajiabadi, Shahram Khazaei, Behzad Vahdani

Publication date 11 October 2024

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00145-024-09515-4

zbMATH Keywords

lower boundssecret sharingone way functioninformation theoretic securityrandomness recoverable attribute based encryptionrandomness recovery

Mathematics Subject Classification ID

Information theory (general) (94A15) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Randomness recoverable secret sharing schemes
• Rearrangements of access structures and their realizations in secret sharing schemes
• On secret sharing, randomness, and random-less reductions for secret sharing
• Secret sharing schemes with applications in security protocols
• Computationally secure robust multi-secret sharing for general access structure

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 1088907 (Why is no real title available?)
• scientific article; zbMATH DE number 1842497 (Why is no real title available?)
• A mix-net from any CCA2 secure cryptosystem
• CCA security and trapdoor functions via key-dependent-message security
• Chosen ciphertext security from injective trapdoor functions
• Chosen-ciphertext security without redundancy
• Cryptographic primitives with hinting property
• How to build a trapdoor function from an encryption scheme
• How to share a secret
• Information Inequalities are Not Closed Under Polymatroid Duality
• Key-dependent message security: generic amplification and completeness
• Multiple assignment scheme for sharing secret
• Network information theory
• New constructions of reusable designated-verifier NIZKs
• OAEP reconsidered
• On cliques in graphs
• On secret sharing systems
• On the Power of Amortization in Secret Sharing
• On the size of shares for secret sharing schemes
• Progress in Cryptology - INDOCRYPT 2003
• Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
• Secret sharing and duality
• Secret-Sharing Schemes: A Survey
• Secret-sharing for NP
• Signcryption from randomness recoverable public key encryption
• Succinct computational secret sharing
• The size of a share must be large

Cited in

(1)

• Randomness recoverable secret sharing schemes

This page was built for publication: Randomness recoverable secret sharing schemes

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