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

information theoretic securitylower boundsone way functionrandomness recoverable attribute based encryptionrandomness recoverysecret sharing

Mathematics Subject Classification ID

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

Review text

The present article deals with the case study of particular models of sharing secrets as well as modal schemes treated from the informational-theoretical and computational perspectives. The main novelty brought by the authors refers to the demonstration of the conclusion that access structures can be treated with RR-SSS. Still, some models of simpler structures did not show an efficient implementation of the model. Also, a connection between RR-SSS and some unidirectional functions is highlighted, by demonstrating the possibility of constructing an RR-SSS scheme that is efficient in the case of descriptive access structures of unidirectional functions. Indeed, there are similar researches in this sense, with the authors' work having a clear way of separating the complexities associated with RR-SSS and SSS, by highlighting their parameterization in the two cases. From the model in which this comparative modality is exposed, the applicability of these models in real cryptographic requirements, where unidirectional functions are analyzed, is evident, which constitutes the essential contribution of this research. The obtained results are applicable in the implementation of informational security structures, but also in certain types of authentication.

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

• 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
• 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?)
• 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 for NP
• Secret-Sharing Schemes: A Survey
• 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)