default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOriol Farràs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Oriol Farràs
, Jordi Ribes-González:
One-Out-of-q OT Combiners. IEEE Trans. Inf. Theory 70(4): 2984-2998 (2024)- [j24]Xavier Carril, Charalampos Kardaris, Jordi Ribes-González, Oriol Farràs, Carles Hernández, Vatistas Kostalabros, Joel Ulises González-Jiménez, Miquel Moretó:
Hardware Acceleration for High-Volume Operations of CRYSTALS-Kyber and CRYSTALS-Dilithium. ACM Trans. Reconfigurable Technol. Syst. 17(3): 41:1-41:26 (2024) - [c26]Vatistas Kostalabros, Jordi Ribes-González, Oriol Farràs, Miquel Moretó, Carles Hernández:
A Safety-Critical, RISC-V SoC Integrated and ASIC-Ready Classic McEliece Accelerator. ARC 2024: 282-295 - [c25]Oriol Farràs, Miquel Guiot:
Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation. TCC (4) 2024: 517-547 - [c24]Amos Beimel, Oriol Farràs, Or Lasri, Oded Nir:
Secret-Sharing Schemes for High Slices. TCC (4) 2024: 581-613 - [i24]Michael Bamiloshin, Oriol Farràs:
Optimizing Extension Techniques for Discovering Non-Algebraic Matroids. CoRR abs/2406.18359 (2024) - [i23]Amos Beimel, Oriol Farràs, Oded Nir:
Secret-Sharing Schemes for High Slices. IACR Cryptol. ePrint Arch. 2024: 602 (2024) - [i22]Oriol Farràs, Miquel Guiot:
Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation. IACR Cryptol. ePrint Arch. 2024: 772 (2024) - 2023
- [c23]Amos Beimel, Oriol Farràs, Or Lasri:
Improved Polynomial Secret-Sharing Schemes. TCC (2) 2023: 374-405 - [i21]Amos Beimel, Oriol Farràs, Or Lasri:
Improved Polynomial Secret-Sharing Schemes. IACR Cryptol. ePrint Arch. 2023: 1158 (2023) - 2022
- [j23]Jordi Ribes-González, Oriol Farràs, Carles Hernández, Vatistas Kostalabros, Miquel Moretó:
A Security Model for Randomization-based Protected Caches. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(3): 1-25 (2022) - [j22]Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter:
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. IEEE Trans. Inf. Theory 68(3): 2083-2100 (2022) - [i20]Jordi Ribes-González, Oriol Farràs, Carles Hernández, Vatistas Kostalabros, Miquel Moretó:
A Security Model for Randomization-based Protected Caches. IACR Cryptol. ePrint Arch. 2022: 440 (2022) - 2021
- [j21]Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, Carles Padró:
Common information, matroid representation, and secret sharing for matroid ports. Des. Codes Cryptogr. 89(1): 143-166 (2021) - [j20]Oriol Farràs, Jordi Ribes-González, Sara Ricci:
Privacy-preserving data splitting: a combinatorial approach. Des. Codes Cryptogr. 89(7): 1735-1756 (2021) - [c22]Vatistas Kostalabros, Jordi Ribes-González, Oriol Farràs, Miquel Moretó, Carles Hernández:
HLS-Based HW/SW Co-Design of the Post-Quantum Classic McEliece Cryptosystem. FPL 2021: 52-59 - [i19]Oriol Farràs, Jordi Ribes-González:
One-out-of-q OT Combiners. IACR Cryptol. ePrint Arch. 2021: 822 (2021) - 2020
- [j19]Oriol Farràs:
Secret sharing schemes for ports of matroids of rank 3. Kybernetika 56(5): 903-915 (2020) - [j18]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) - [c21]Amos Beimel, Oriol Farràs:
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. TCC (3) 2020: 499-529 - [i18]Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, Carles Padró:
Common Information, Matroid Representation, and Secret Sharing for Matroid Ports. CoRR abs/2002.08108 (2020) - [i17]Oriol Farràs:
Secret Sharing Schemes for Ports of Matroids of Rank 3. IACR Cryptol. ePrint Arch. 2020: 8 (2020) - [i16]Amos Beimel, Oriol Farràs:
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. IACR Cryptol. ePrint Arch. 2020: 664 (2020)
2010 – 2019
- 2019
- [j17]Josep Domingo-Ferrer, Oriol Farràs, Jordi Ribes-González, David Sánchez:
Privacy-preserving cloud computing on sensitive data: A survey of methods, products and challenges. Comput. Commun. 140-141: 38-60 (2019) - [j16]Oriol Farràs, Jordi Ribes-González, Sara Ricci:
Local bounds for the optimal information ratio of secret sharing schemes. Des. Codes Cryptogr. 87(6): 1323-1344 (2019) - [j15]Oriol Farràs, Jordi Ribes-González:
Provably secure public-key encryption with conjunctive and subset keyword search. Int. J. Inf. Sec. 18(5): 533-548 (2019) - [c20]Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter:
Secret-Sharing Schemes for General and Uniform Access Structures. EUROCRYPT (3) 2019: 441-471 - [i15]Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter:
Secret-Sharing Schemes for General and Uniform Access Structures. IACR Cryptol. ePrint Arch. 2019: 231 (2019) - 2018
- [c19]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 - [i14]Oriol Farràs, Jordi Ribes-González, Sara Ricci:
Privacy-preserving Data Splitting: A Combinatorial Approach. CoRR abs/1801.05974 (2018) - 2017
- [j14]Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, Carles Padró:
On the Information Ratio of Non-perfect Secret Sharing Schemes. Algorithmica 79(4): 987-1013 (2017) - [c18]James Alderman, Benjamin R. Curtis, Oriol Farràs, Keith M. Martin, Jordi Ribes-González:
Private Outsourced Kriging Interpolation. Financial Cryptography Workshops 2017: 75-90 - [c17]Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter:
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. TCC (2) 2017: 394-423 - [c16]Ignacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci:
Resource-Efficient OT Combiners with Active Security. TCC (2) 2017: 461-486 - [i13]Ignacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci:
Resource-efficient OT combiners with active security. IACR Cryptol. ePrint Arch. 2017: 545 (2017) - [i12]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) - [i11]Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter:
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. IACR Cryptol. ePrint Arch. 2017: 940 (2017) - 2016
- [j13]Josep Domingo-Ferrer, Oriol Farràs, Sergio Martínez, David Sánchez, Jordi Soria-Comas:
Self-enforcing protocols via co-utile reputation management. Inf. Sci. 367-368: 159-175 (2016) - [j12]Amos Beimel, Oriol Farràs, Yuval Mintz:
Secret-Sharing Schemes for Very Dense Graphs. J. Cryptol. 29(2): 336-362 (2016) - [j11]Qianhong Wu, Bo Qin, Lei Zhang, Josep Domingo-Ferrer, Oriol Farràs, Jesús A. Manjón:
Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts. IEEE Trans. Computers 65(2): 466-479 (2016) - [c15]Oriol Farràs:
Recent Advances in Non-perfect Secret Sharing Schemes. CiE 2016: 89-98 - [c14]Oriol Farràs, Jordi Ribes-González:
Searchable encryption for geo-referenced data. Med-Hoc-Net 2016: 1-8 - [c13]Amos Beimel, Oriol Farràs, Naty Peter:
Secret Sharing Schemes for Dense Forbidden Graphs. SCN 2016: 509-528 - [i10]Oriol Farràs, Sebastià Martín Molleví, Carles Padró:
A Note on Non-Perfect Secret Sharing. IACR Cryptol. ePrint Arch. 2016: 348 (2016) - [i9]Oriol Farràs, Jordi Ribes-González, Sara Ricci:
Bounds on the Information Ratios of Secret Sharing Schemes for Close Access Structures. IACR Cryptol. ePrint Arch. 2016: 726 (2016) - 2015
- [j10]Oriol Farràs, Carles Padró:
Extending Brickell-Davenport theorem to non-perfect secret sharing schemes. Des. Codes Cryptogr. 74(2): 495-510 (2015) - 2014
- [j9]Sara Hajian, Josep Domingo-Ferrer, Oriol Farràs:
Generalization-based privacy preservation and discrimination prevention in data publishing and mining. Data Min. Knowl. Discov. 28(5-6): 1158-1188 (2014) - [j8]Klara Stokes, Oriol Farràs:
Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes. Des. Codes Cryptogr. 71(3): 503-524 (2014) - [j7]Klara Stokes, Oriol Farràs:
Erratum to: Linear spaces and transversal designs: $$k$$ -anonymous combinatorial configurations for anonymous database search. Des. Codes Cryptogr. 71(3): 525 (2014) - [j6]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. IEEE Trans. Inf. Theory 60(3): 1652-1664 (2014) - [c12]Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, Carles Padró:
Optimal Non-perfect Uniform Secret Sharing Schemes. CRYPTO (2) 2014: 217-234 - [c11]Alberto Blanco-Justicia, Josep Domingo-Ferrer, Oriol Farràs, David Sánchez:
Distance Computation between Two Private Preference Functions. SEC 2014: 460-470 - [i8]Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, Carles Padró:
Optimal Non-Perfect Uniform Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2014: 124 (2014) - 2013
- [c10]Oriol Farràs, Josep Domingo-Ferrer, Alberto Blanco-Justicia:
Privacy-Preserving Trust Management Mechanisms from Private Matching Schemes. DPM/SETOP 2013: 390-398 - [i7]Oriol Farràs, Josep Domingo-Ferrer, Alberto Blanco-Justicia:
Privacy-Preserving Trust Management Mechanisms from Private Matching Schemes. CoRR abs/1308.2435 (2013) - 2012
- [j5]Oriol Farràs, Jessica Ruth Metcalf-Burton, Carles Padró, Leonor Vázquez:
On the optimization of bipartite secret sharing schemes. Des. Codes Cryptogr. 63(2): 255-271 (2012) - [j4]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) - [j3]Bo Qin, Qianhong Wu, Lei Zhang, Oriol Farràs, Josep Domingo-Ferrer:
Provably secure threshold public-key encryption with adaptive security and short ciphertexts. Inf. Sci. 210: 67-80 (2012) - [j2]Oriol Farràs, Jaume Martí-Farré, Carles Padró:
Ideal Multipartite Secret Sharing Schemes. J. Cryptol. 25(3): 434-463 (2012) - [j1]Oriol Farràs, Carles Padró:
Ideal Hierarchical Secret Sharing Schemes. IEEE Trans. Inf. Theory 58(5): 3273-3286 (2012) - [c9]Amos Beimel, Oriol Farràs, Yuval Mintz:
Secret Sharing Schemes for Very Dense Graphs. CRYPTO 2012: 144-161 - [i6]Klara Stokes, Oriol Farràs:
Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search. CoRR abs/1206.5930 (2012) - [i5]Amos Beimel, Oriol Farràs, Yuval Mintz:
Secret Sharing Schemes for Very Dense Graphs. IACR Cryptol. ePrint Arch. 2012: 404 (2012) - [i4]Oriol Farràs, Carles Padró:
Extending Brickell-Davenport Theorem to Non-Perfect Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2012: 595 (2012) - [i3]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. IACR Cryptol. ePrint Arch. 2012: 680 (2012) - 2011
- [c8]Qianhong Wu, Bo Qin, Lei Zhang, Josep Domingo-Ferrer, Oriol Farràs:
Bridging Broadcast Encryption and Group Key Agreement. ASIACRYPT 2011: 143-160 - [c7]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. ASIACRYPT 2011: 610-627 - [c6]Oriol Farràs, Carles Padró:
Ideal Secret Sharing Schemes for Useful Multipartite Access Structures. IWCC 2011: 99-108 - [c5]Jordi Pujol Ahulló, Roger Jardí-Cedó, Jordi Castellà-Roca, Oriol Farràs:
TTP SmartCard-Based ElGamal Cryptosystem Using Threshold Scheme for Electronic Elections. FPS 2011: 14-22 - 2010
- [c4]Oriol Farràs, Carles Padró:
Ideal Hierarchical Secret Sharing Schemes. TCC 2010: 219-236
2000 – 2009
- 2009
- [c3]Oriol Farràs, Jessica Ruth Metcalf-Burton, Carles Padró, Leonor Vázquez:
On the Optimization of Bipartite Secret Sharing Schemes. ICITS 2009: 93-109 - [c2]Oriol Farràs, Ignacio Gracia, Sebastià Martín Molleví, Carles Padró:
Linear Threshold Multisecret Sharing Schemes. ICITS 2009: 110-126 - [i2]Oriol Farràs, Carles Padró:
Ideal Hierarchical Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2009: 141 (2009) - 2007
- [c1]Oriol Farràs, Jaume Martí-Farré, Carles Padró:
Ideal Multipartite Secret Sharing Schemes. EUROCRYPT 2007: 448-465 - 2006
- [i1]Oriol Farràs, Jaume Martí-Farré, Carles Padró:
Ideal Multipartite Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2006: 292 (2006)
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-12-13 20:05 CET 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:
