Publications

The main topic of my research is the study of secret sharing schemes, a cryptographic primitive. Moreover, I also work on related mathematical problems and other areas of cryptography. Below, the publications are divided into 1) pre-prints 2) works on secret sharing schemes 3) works on other cryptography and privacy topics and a 4) textbook. I tried to organize publications according to their results, from newest to oldest.

Most of the publications are also listed in google scholar, dblp, mathscinet and orcid.

Pre-prints:

1. Secret-Sharing Schemes for High Slices, a joint work with Amos Beimel and Oded Nir, at eprint. 2024.

2. A Note on Extension Properties and Representations of Matroids, a joint work with Michael Bamiloshin and Carles Padró, at arXiv. 2023.

3. A Note on Non-Perfect Secret Sharing Schemes. Oriol Farràs, Sebastià Martín, Carles Padró. At eprint. 2016.

Secret sharing schemes: 

1. Improved Polynomial Secret-Sharing Schemes. Amos Beimel, Oriol Farràs and Or Lasri. TCC (2) 2023: 374-405. Full version at eprint.

2. The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. Amos Beimel and Oriol Farràs. TCC 2020: 499-529. Full version at eprint.

3. Common Information, Matroid Representation, and Secret Sharing for Matroid Ports. Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs and Carles Padró. Designs, Codes and Cryptography 89(1): 143-166 (2021). Full version at arXiv.

4. Secret Sharing Schemes for Ports of Matroids of Rank 3. Oriol Farràs. Kybernetika 56 no. 5, 903-915, 2020. Also at eprint.

5. Secret-Sharing Schemes for General and Uniform Access Structures. Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, and Naty Peter. EUROCRYPT 2019: 441-471. Full version at eprint.

6. Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. Oriol Farràs, Tarik Kaced, Sebastià Martín, Carles Padró. IEEE Transactions on Information Theory 66 (11):7088-7100  (2020). Also at eprint.

   • Previous version: EUROCRYPT 2018: 597-621. 

7. Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter. IEEE Transactions on Information Theory (2022). Also at eprint

   • Previous version: TCC 2017: 394-423.

8. Local Bounds for the Optimal Information Ratio of Secret Sharing Schemes. Oriol Farràs, Jordi Ribes-González, Sara Ricci. Designs, Codes and Cryptography 87(6): 1323-1344 (2019). Full version at eprint.

9. Secret Sharing for Dense Forbidden Graphs. Amos Beimel, Oriol Farràs, Naty Peter. SCN 2016:509-528. Available from Springer.

10. Recent Advances in Non-Perfect Secret Sharing Schemes. Oriol Farràs. CiE 2016: 89-98. Available from Springer

11. On the Information Ratio of Non-Perfect Secret Sharing Schemes. Oriol Farràs, Torben Hansen, Tarik Kaced, Carles Padró. Algorithmica 79:987-1013 (2017). Also at eprint. 

    • It includes the results in: Optimal Non-Perfect Uniform Secret Sharing Schemes. CRYPTO 2014: 217-234. Available from Springer. Video of the presentation at youtube.

12. Extending Brickell-Davenport Theorem to Non-Perfect Secret Sharing Schemes. Oriol Farràs, Carles Padró. Designs, Codes and Cryptography 74(2):495-510 (2015). Also at ePrint.

13. Secret Sharing For Very Dense Graphs. Amos Beimel, Oriol Farràs, Yuval Mintz. Journal of Cryptology 29(2), 336-362 (2016). Also at ePrint.

    • Previous version: CRYPTO 2012: 144-161. Available from Springer.  Video of the presentation at youtube.

14. Natural Generalizations of Threshold Secret Sharing. Oriol Farràs, Carles Padró, Chaoping Xing, An Yang.  IEEE Transactions on Information Theory. 60 (3): 1652-1664 (2014).

    • Previous version: Asiacrypt 2011: 610-627. Available from Springer. 

15. Ideal Secret Sharing Schemes for Useful Multipartite Access Structures. Oriol Farràs, Carles Padró. IWCC 2011: 99-108. Available from Springer. 

16. PhD Thesis: Multipartite Secret Sharing Schemes.  UPC, July 2010. Director: Carles Padró.

17. On the Optimization of Bipartite Secret Sharing Schemes. Oriol Farràs, Jessica Ruth Metcalf-Burton, Carles Padró, Leonor Vázquez. Designs, Codes, and Cryptography 63(2): 255-271 (2012).

    • Previous version: ICITS 2009: 93-109. Available from Springer. 

18. Ideal Hierarchical Secret Sharing Schemes. Oriol Farràs, Carles Padró. IEEE Transactions on Information Theory 58 (5): 3273-3286 (2012).

    • Previous version: TCC 2010: 219-236. Available from Springer. 

19. Ideal Multipartite Secret Sharing Schemes. Oriol Farràs, Jaume Martí-Farré, Carles Padró. Journal of Cryptology 25 (3): 434-463 (2012).

    • Previous version: EUROCRYPT 2007: 448-465. Available from Springer.  

20. Linear Threshold Multisecret Sharing Schemes. Oriol Farràs, Ignacio Gracia, Sebastià Martín Molleví, Carles Padró. Information Processing Letters 112 (17-18): 667-673 (2012).

    • Previous version: ICITS 2009: 110-126. Available from Springer.

21. Protocols criptogràfics incondicionalment segurs per a la distribució i compartició de claus (in Catalan). Final Graduate Work, Enginyeria Superior de Telecomunicació, UPC, 2005.

Cryptography and privacy:

1. A Safety-Critical, RISC-V SoC Integrated and ASIC-Ready Classic McEliece Accelerator. Vatistas Kostalabros, Jordi Ribes-González, Oriol Farràs, Miquel Moretó and Carles Hernandez. Applied Reconfigurable Computing (ARC) Symposium 2024: 282-295.

2. One-out-of-q OT Combiners, a joint work with Jordi Ribes-González. IEEE TIT 2023. Full version at eprint.

3. A Security Model for Randomization-based Protected Caches. Jordi Ribes-González, Oriol Farràs, Carles Hernández, Vatistas Kostalampros, Miquel Moretó. Published at CHES 2022. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(3): 1-25 (2022). Full version at eprint.

4. HLS-Based HW/SW Co-Design of the Post-Quantum Classic McEliece Cryptosystem.  Vatistas Kostalampros, Jordi Ribes-González, Oriol Farràs, Miquel Moretó and Carles Hernández. International Conference on Field-Programmable Logic and Applications (FPL) (2021).

5. Privacy-preserving Data Splitting: A Combinatorial Approach. Oriol Farràs, Jordi Ribes-González, Sara Ricci. Designs, Codes, Cryptography 89: 1735-1756 (2021). Also at arXiv. 

6. Provably secure public-key encryption with conjunctive and subset keyword search. Oriol Farràs, Jordi Ribes-González. International Journal of Information Security (2019). 

7. Privacy-preserving cloud computing on sensitive data: A survey of methods, products and challenges. Josep Domingo-Ferrer, Oriol Farràs, Jordi Ribes-González, David Sánchez. Computer Communications (140–141): 38-60 (2019).

8. Resource-Efficient OT-combiners with Active Security. Ignacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci. TCC 2017: 461-486. Also at eprint.

   • A previous version of this work was: Server-Aided Two-Party Computation with Minimal Connectivity in the Simultaneous Corruption Model. At eprint 

9. Private Outsourced Kriging Interpolation, James Alderman, Benjamin R. Curtis, Keith M. Martin and Jordi Ribes-González. Financial Cryptography Workshops 2017: 75-90.

10. Self-enforcing protocols via co-utile reputation management. Josep Domingo-Ferrer, Oriol Farràs, Sergio Martínez, David Sánchez, Jordi Soria-Comas. Information Sciences 367-8: 159-175 (2016)

11. Searchable Encryption for Geo-referenced Data. Oriol Farràs, Jordi Ribes González. Med-Hoc-Net 2016:1-8. Available from IEEE.

12. Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts. Qianhong Wu, Bo Qin, Lei Zhang, Josep Domingo-Ferrer, Oriol Farràs, Jesús Manjón. IEEE Transactions on Computers 65(2) 466-479 (2016).

    • It includes the results in: Bridging Broadcast Encryption and Group Key Agreement. Asiacrypt 2011: 143-160. Available from Springer.

13. Generalization-based Privacy Preservation and Discrimination Prevention in Data Publishing. Sara Haijn, Josep Domingo-Ferrer, Oriol Farràs. Data Mining Knowledge Discovery. 28 (5-6): 1158-1188 (2014).

14. Distance Computation between Two Private Preference Functions. Alberto Blanco, Josep Domingo-Ferrer, Oriol Farràs, David Sánchez. SEC 2014: 416-470. Available from Springer.

15. Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search. Klara Stokes, Oriol Farràs. Designs, Codes and Cryptography. 71 (3): 503-524 (2014). Also at arXiv.

16. Privacy-Preserving Trust Management Mechanisms from Private Matching Schemes. Oriol Farràs, Josep Domingo-Ferrer, Alberto Blanco-Justicia. DPM/SETOP 2013 390/398. Full version at arXiv.

17. Provably Secure Threshold Public-Key Encryption with Adaptive Security and Short Ciphertext. Bo Qin, Qianhong Wu, Lei Zhang, Oriol Farràs, Josep Domingo-Ferrer. Information Sciences 210: 67-80 (2012).

18. TTP SmartCard - based ElGamal Cryptosystem using Threshold Scheme for Electronic Elections. Jordi Pujol-Ahullo, Roger Jardi-Cedo, Jordi Castella-Roca, Oriol Farràs. Foundations & Practice of Security 2011: 14-22.

Textbook:

1. Matemàtica Discreta 2. Maria Bras-Amorós, Oriol Farràs Ventura. Eina-e 29, Publicacions URV 2022. (in Catalan)