default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastià Martín Molleví
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j10]Oriol Farràs
, Tarik Kaced, Sebastià Martín Molleví, Carles Padró:
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. IEEE Trans. Inf. Theory 66(11): 7088-7100 (2020)
2010 – 2019
- 2018
- [c7]Oriol Farràs, Tarik Kaced, Sebastià Martín Molleví, Carles Padró:
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. EUROCRYPT (1) 2018: 597-621 - 2017
- [i10]Oriol Farràs, Tarik Kaced, Sebastià Martín Molleví, Carles Padró:
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. IACR Cryptol. ePrint Arch. 2017: 919 (2017) - 2016
- [j9]Sebastià Martín Molleví, Carles Padró, An Yang:
Secret Sharing, Rank Inequalities, and Information Inequalities. IEEE Trans. Inf. Theory 62(1): 599-609 (2016) - [i9]Oriol Farràs, Sebastià Martín Molleví, Carles Padró:
A Note on Non-Perfect Secret Sharing. IACR Cryptol. ePrint Arch. 2016: 348 (2016) - 2013
- [c6]Sebastià Martín Molleví, Carles Padró, An Yang:
Secret Sharing, Rank Inequalities and Information Inequalities. CRYPTO (2) 2013: 277-288 - [i8]Sebastià Martín Molleví, Carles Padró, An Yang:
Secret Sharing, Rank Inequalities and Information Inequalities. IACR Cryptol. ePrint Arch. 2013: 82 (2013) - 2012
- [j8]Oriol Farràs, Ignacio Gracia, Sebastià Martín Molleví, Carles Padró:
Linear threshold multisecret sharing schemes. Inf. Process. Lett. 112(17-18): 667-673 (2012)
2000 – 2009
- 2009
- [c5]Oriol Farràs, Ignacio Gracia, Sebastià Martín Molleví, Carles Padró:
Linear Threshold Multisecret Sharing Schemes. ICITS 2009: 110-126 - 2005
- [j7]David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge Luis Villar:
Fujisaki-Okamoto hybrid encryption revisited. Int. J. Inf. Sec. 4(4): 228-241 (2005) - 2004
- [j6]Carles Padró, Ignacio Gracia, Sebastià Martín Molleví:
Improving the trade-off between storage and communication in broadcast encryption schemes. Discret. Appl. Math. 143(1-3): 213-220 (2004) - [j5]Carlo Blundo, Sebastià Martín Molleví, Barbara Masucci, Carles Padró:
A Linear Algebraic Approach to Metering Schemes. Des. Codes Cryptogr. 33(3): 241-260 (2004) - [c4]David Galindo, Sebastià Martín Molleví, Tsuyoshi Takagi, Jorge Luis Villar:
A Provably Secure Elliptic Curve Scheme with Fast Encryption. INDOCRYPT 2004: 245-259 - [i7]David Galindo, Sebastià Martín Molleví, Jorge L. Villar:
Evaluating elliptic curve based KEMs in the light of pairings. IACR Cryptol. ePrint Arch. 2004: 84 (2004) - 2003
- [j4]Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo:
Linear Broadcast Encryption Schemes. Discret. Appl. Math. 128(1): 223-238 (2003) - [c3]David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge Luis Villar:
Easy Verifiable Primitives and Practical Public Key Cryptosystems. ISC 2003: 69-83 - [c2]David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar:
An IND-CPA cryptosystem from Demytko's primitive. ITW 2003: 167-170 - [c1]David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge Luis Villar:
A Practical Public Key Cryptosystem from Paillier and Rabin Schemes. Public Key Cryptography 2003: 279-291 - [i6]David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar:
Fujisaki-Okamoto IND-CCA hybrid encryption revisited. IACR Cryptol. ePrint Arch. 2003: 107 (2003) - 2002
- [j3]Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo:
Linear Key Predistribution Schemes. Des. Codes Cryptogr. 25(3): 281-298 (2002) - [i5]David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar:
An efficient semantically secure elliptic curve cryptosystem based on KMOV. IACR Cryptol. ePrint Arch. 2002: 37 (2002) - [i4]David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar:
A semantically secure elliptic curve RSA scheme with small expansion factor. IACR Cryptol. ePrint Arch. 2002: 83 (2002) - 2001
- [j2]Sebastià Martín Molleví, Paz Morillo, Jorge Luis Villar:
Computing the order of points on an elliptic curve modulo N is as difficult as factoring N. Appl. Math. Lett. 14(3): 341-346 (2001) - [j1]Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo:
Linear broadcast encryption schemes. Electron. Notes Discret. Math. 6: 35-44 (2001) - [i3]Carlo Blundo, Sebastià Martín Molleví, Barbara Masucci, Carles Padró:
A Linear Algebraic Approach to Metering Schemes. IACR Cryptol. ePrint Arch. 2001: 87 (2001) - [i2]Ignacio Gracia, Sebastià Martín Molleví, Carles Padró:
Improving the trade-off between storage and communication in broadcast encryption schemes. IACR Cryptol. ePrint Arch. 2001: 88 (2001) - [i1]Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo:
Linear broadcast encryption schemes. IACR Cryptol. ePrint Arch. 2001: 89 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
