The following pages link to Security of Ramp Schemes (Q2974487):
Displaying 41 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- A simple combinatorial treatment of constructions and threshold gaps of ramp schemes (Q380446) (← links)
- Provably secure threshold public-key encryption with adaptive security and short ciphertexts (Q456458) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← links)
- Strongly secure ramp secret sharing schemes for general access structures (Q1045894) (← links)
- On the size of shares for secret sharing schemes (Q1310452) (← links)
- Ideal ramp schemes and augmented orthogonal arrays (Q1625799) (← links)
- Ideal ramp schemes and related combinatorial objects (Q1685978) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Relative generalized Hamming weights of cyclic codes (Q1696766) (← links)
- Unitary reconstruction of secret for stabilizer-based quantum secret sharing (Q1700012) (← links)
- Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields (Q1726005) (← links)
- Multi-prover proof of retrievability (Q1755952) (← links)
- A ramp model for distributed key distribution schemes (Q1811091) (← links)
- Shared generation of pseudo-random functions (Q1827581) (← links)
- Quantum strongly secure ramp secret sharing (Q2018190) (← links)
- Evolving ramp secret sharing with a small gap (Q2055622) (← links)
- Ramp secret image sharing (Q2160785) (← links)
- Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets (Q2200519) (← links)
- Strong security of linear ramp secret sharing schemes with general access structures (Q2203603) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes (Q2256110) (← links)
- Optimal assignment schemes for general access structures based on linear programming (Q2260793) (← links)
- Properties and constraints of cheating-immune secret sharing schemes (Q2489917) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing (Q2691589) (← links)
- Ramp scheme based on CRT for polynomial ring over finite field (Q2699255) (← links)
- Secure Computation, I/O-Efficient Algorithms and Distributed Signatures (Q2890013) (← links)
- Detecting Algebraic Manipulation in Leaky Storage Systems (Q2953813) (← links)
- Threshold Secret Sharing Requires a Linear Size Alphabet (Q3181037) (← links)
- Recent Advances in Non-perfect Secret Sharing Schemes (Q3188243) (← links)
- First Study for Ramp Secret Sharing Schemes Through Greatest Common Divisor of Polynomials (Q3300516) (← links)
- A New (k,n)-Threshold Secret Sharing Scheme and Its Extension (Q3540162) (← links)
- Geometric and Computational Approach to Classical and Quantum Secret Sharing (Q4610014) (← links)
- Probabilistic secret sharing (Q5005168) (← links)
- An Ideal and Perfect (t, n) Multi-secret Sharing Scheme Based on Finite Geometry (Q5233844) (← links)
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves (Q5458608) (← links)
- Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes (Q5502761) (← links)
- Full threshold change range of threshold changeable secret sharing (Q6101272) (← links)
- A dynamic secret sharing scheme with cheater detection (Q6570945) (← links)
- Combinatorial constructions of repairable ramp schemes (Q6587212) (← links)
