The following pages link to Carles Padró (Q186107):
Displaying 50 items.
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- Spanners of underlying graphs of iterated line digraphs (Q287078) (← links)
- Robust vector space secret sharing schemes (Q293422) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- Linear threshold multisecret sharing schemes (Q456082) (← links)
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← links)
- A linear algebraic approach to metering schemes (Q702185) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166) (← links)
- On the diameter of matroid ports (Q1010684) (← links)
- Detection of cheaters in vector space secret sharing schemes (Q1283223) (← links)
- Disjoint paths of bounded length in large generalized cycles (Q1292837) (← links)
- Connectivity and fault-tolerance of hyperdigraphs (Q1348372) (← links)
- Secret sharing schemes with detection of cheaters for a general access structure (Q1598871) (← links)
- Weighted threshold secret sharing schemes (Q1606940) (← links)
- Taking cube roots in \(\mathbb Z_{m}\) (Q1614110) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Secret sharing schemes with three or four minimal qualified subsets (Q1766095) (← links)
- Secret sharing schemes on sparse homogeneous access structures with rank three (Q1773182) (← links)
- A ramp model for distributed key distribution schemes (Q1811091) (← links)
- Linear broadcast encryption schemes (Q1811106) (← links)
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. (Q1853095) (← links)
- Linear key predistribution schemes (Q1862446) (← links)
- Improving the trade-off between storage and communication in broadcast encryption schemes (Q1887056) (← links)
- Diameter vulnerability of iterated line digraphs (Q1910577) (← links)
- Diameter-vulnerability of large bipartite digraphs (Q1917252) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← links)
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes (Q2256110) (← links)
- Algebraic manipulation detection codes (Q2438532) (← links)
- Secret sharing schemes on access structures with intersection number equal to one (Q2489950) (← links)
- Secret sharing schemes with bipartite access structure (Q2705984) (← links)
- (Q2741393) (← links)
- (Q2741394) (← links)
- Secret Sharing, Rank Inequalities and Information Inequalities (Q2849401) (← links)
- On the Representability of the Biuniform Matroid (Q2870516) (← links)
- Optimal Non-perfect Uniform Secret Sharing Schemes (Q2874539) (← links)
- Secret Sharing, Rank Inequalities, and Information Inequalities (Q2977088) (← links)
- Ideal Secret Sharing Schemes for Useful Multipartite Access Structures (Q3005583) (← links)
- On secret sharing schemes, matroids and polymatroids (Q3056338) (← links)
- Distributed RSA Signature Schemes for General Access Structures (Q3404398) (← links)
- Ideal Hierarchical Secret Sharing Schemes (Q3408196) (← links)
- Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants (Q3541888) (← links)
- Correction to “Secret Sharing Schemes With Bipartite Access Structure” (Q3547459) (← links)
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming (Q3557032) (← links)
- On Secret Sharing Schemes, Matroids and Polymatroids (Q3596383) (← links)
- On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes (Q3604694) (← links)
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra (Q3612573) (← links)
