Sebastià Martín

Available identifiers

Publication	Date of Publication	Type
Combinatorial constructions of separating codes	2024-12-06	Paper
An algorithmic construction of union-intersection-bounded families	2024-10-08	Paper
Bounds and constructions of parent identifying schemes via the algorithmic version of the Lovász local lemma	2024-07-21	Paper
Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions	2024-07-11	Paper
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing	2020-12-04	Paper
Improving the linear programming technique in the search for lower bounds in secret sharing	2018-07-09	Paper
Secret Sharing, Rank Inequalities, and Information Inequalities	2017-04-28	Paper
Secret sharing, rank inequalities and information inequalities	2013-09-17	Paper
Linear threshold multisecret sharing schemes	2012-10-23	Paper
Linear threshold multisecret sharing schemes	2010-09-29	Paper
Easy verifiable primitives and practical public key cryptosystems	2010-02-09	Paper
Progress in Cryptology - INDOCRYPT 2004	2005-12-22	Paper
A linear algebraic approach to metering schemes	2005-01-17	Paper
Improving the trade-off between storage and communication in broadcast encryption schemes	2004-11-23	Paper
A Practical Public Key Cryptosystem from Paillier and Rabin Schemes	2003-07-27	Paper
Linear broadcast encryption schemes	2003-06-10	Paper
Linear broadcast encryption schemes	2001-10-14	Paper
Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\)	2001-08-07	Paper

This page was built for person: Sebastià Martín