Secret sharing made short
From MaRDI portal
Recommendations
Cited in
(61)- Secret sharing over infinite domains
- General information dispersal algorithms
- Secure distributed storage and retrieval
- New efficient and secure protocols for verifiable signature sharing and other applications
- Timed-release computational secret sharing and threshold encryption
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
- Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
- High-threshold AVSS with optimal communication complexity
- Continuously non-malleable secret sharing for general access structures
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
- Secret sharing schemes for infinite sets of participants: a new design technique
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Secret sharing based on a hard-on-average problem
- Secret-sharing for NP
- Sharing many secrets with computational provable security
- Long term confidentiality: a survey
- On ASGS framework: general requirements and an example of implementation
- Secret-shared shuffle
- Continuously non-malleable secret sharing: joint tampering, plain model and capacity
- scientific article; zbMATH DE number 1612532 (Why is no real title available?)
- scientific article; zbMATH DE number 1676643 (Why is no real title available?)
- Set theoretical secret sharing scheme in relocation cipher
- How to Share a Secret, Infinitely
- Secret sharing schemes with applications in security protocols
- Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing
- A threshold scheme under peer-to-peer network
- A New (k,n)-Threshold Secret Sharing Scheme and Its Extension
- Weakly-Private Secret Sharing Schemes
- Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
- On Secret Reconstruction in Secret Sharing Schemes
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- Secret sharing with public reconstruction. (Extended abstract)
- Computing Functions of a Shared Secret
- On-line secret sharing
- All-or-nothing encryption and the package transform
- Secret Sharing With Public Reconstruction
- On secret sharing systems
- Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme
- Probabilistic secret sharing
- Secret sharing with binary shares
- Threshold secret sharing requires a linear-size alphabet
- Optimum general threshold secret sharing
- Localised multisecret sharing
- Secret sharing schemes with conversion protocol to achieve short share-size and extendibility to multiparty computation
- Progress in Cryptology - INDOCRYPT 2003
- Theory of Cryptography
- scientific article; zbMATH DE number 7706042 (Why is no real title available?)
- Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
- Succinct computational secret sharing
- A nonlinear secret sharing scheme
- Secret sharing with certified deletion
- How to make any computational secret sharing scheme adaptively secure
- An efficient quantum secret sharing scheme for general access structure based on a novel partitioning technique
- Evolving secret sharing revisited: computational security and succinctness
- Secret-sharing schemes for high slices
- Evolving secret sharing made short
- A construction of evolving k-threshold secret sharing scheme over a polynomial ring
- Cryptography with weak privacy
- \textsf{SoK}: on cryptography for multi-cloud storage
- Threshold changeable secret sharing schemes revisited
- Rearrangements of access structures and their realizations in secret sharing schemes
This page was built for publication: Secret sharing made short
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4341739)
