scientific article; zbMATH DE number 1024051
From MaRDI portal
Publication:4341739
zbMath0871.94034MaRDI QIDQ4341739
Publication date: 8 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational modelencryptionsecret sharing schemesthreshold schemeinformation dispersalresource bounded adversaries
Related Items (26)
How to Share a Secret, Infinitely ⋮ High-threshold AVSS with optimal communication complexity ⋮ Secret-sharing for NP ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Timed-release computational secret sharing and threshold encryption ⋮ Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext ⋮ A new threshold changeable secret sharing scheme based on the Chinese remainder theorem ⋮ Continuously non-malleable secret sharing: joint tampering, plain model and capacity ⋮ Sharing many secrets with computational provable security ⋮ Long term confidentiality: a survey ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ Secret sharing schemes for infinite sets of participants: a new design technique ⋮ Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Probabilistic secret sharing ⋮ All-or-nothing encryption and the package transform ⋮ Rearrangements of access structures and their realizations in secret sharing schemes ⋮ Localised multisecret sharing ⋮ Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures ⋮ Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme ⋮ General information dispersal algorithms ⋮ Threshold changeable secret sharing schemes revisited ⋮ Secure distributed storage and retrieval ⋮ New efficient and secure protocols for verifiable signature sharing and other applications ⋮ On-line secret sharing ⋮ Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
This page was built for publication:
