The following pages link to How to share a secret (Q3050283):
Displayed 50 items.
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← links)
- Veto is impossible in secret sharing schemes (Q671260) (← links)
- Fully dynamic secret sharing schemes (Q671527) (← links)
- Collisionful keyed hash functions with selectable collisions (Q672028) (← links)
- Fair reconstruction of a secret (Q672497) (← links)
- Password authentication without using a password table (Q672653) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- Linear secret sharing schemes and rearrangements of access structures (Q705055) (← links)
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority (Q809588) (← links)
- The design of a secure and fair sealed-bid auction service (Q814236) (← links)
- Distributed ring signatures from general dual access structures (Q851736) (← links)
- Generalised cumulative arrays in secret sharing (Q851749) (← links)
- A flaw in the use of minimal defining sets for secret sharing schemes (Q851751) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← links)
- Reputation management and signature delegation: A distributed approach (Q862580) (← links)
- A cheating prevention scheme for binary visual cryptography with homogeneous secret images (Q882290) (← links)
- All inequalities for the relative entropy (Q883003) (← links)
- VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches (Q996462) (← links)
- Partitioned encryption and achieving simultaneity by partitioning (Q1099131) (← links)
- How to share a secret with cheaters (Q1112786) (← links)
- Summing over a network without revealing summands (Q1119609) (← links)
- On the power of two-point based sampling (Q1120201) (← links)
- Secret sharing schemes for graph-based prohibited structures (Q1125037) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- A cryptosystem for multiple communication (Q1145121) (← links)
- A note on ''Master keys for group sharing'' (Q1169968) (← links)
- On the classification of ideal secret sharing schemes (Q1180513) (← links)
- Distributed user identification by zero-knowledge access rights proving (Q1183478) (← links)
- Two distributed problems involving Byzantine processes (Q1186434) (← links)
- Protocols for group oriented secret sharing (Q1198055) (← links)
- Incidence structures applied to cryptography (Q1199628) (← links)
- Some improved bounds on the information rate of perfect secret sharing schemes (Q1202917) (← links)
- Strongly ideal secret sharing schemes (Q1202922) (← links)
- An explication of secret sharing schemes (Q1203951) (← links)
- Multiple assignment scheme for sharing secret (Q1207695) (← links)
- How to avoid the cheaters succeeding in the key sharing scheme (Q1261009) (← links)
- Secret sharing over infinite domains (Q1261017) (← links)
- Ideal homomorphic secret sharing schemes over cyclic groups (Q1286658) (← links)
- On the size of shares for secret sharing schemes (Q1310452) (← links)
- Geometric secret sharing schemes and their duals (Q1321560) (← links)
- On the structure of the privacy hierarchy (Q1324758) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- On dynamic threshold schemes (Q1341683) (← links)
- A note on dynamic threshold schemes (Q1350356) (← links)
- Anonymous secret sharing schemes (Q1364776) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- On identification secret sharing schemes. (Q1401951) (← links)
- Multi-party key agreement protocols with cheater identification (Q1412469) (← links)
- Information flow on trees (Q1425477) (← links)