Oriol Farràs

1.0k total citations
27 papers, 402 citations indexed

About

Oriol Farràs is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Oriol Farràs has authored 27 papers receiving a total of 402 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Artificial Intelligence, 15 papers in Computational Theory and Mathematics and 6 papers in Electrical and Electronic Engineering. Recurrent topics in Oriol Farràs's work include Cryptography and Data Security (20 papers), Complexity and Algorithms in Graphs (14 papers) and Privacy-Preserving Technologies in Data (5 papers). Oriol Farràs is often cited by papers focused on Cryptography and Data Security (20 papers), Complexity and Algorithms in Graphs (14 papers) and Privacy-Preserving Technologies in Data (5 papers). Oriol Farràs collaborates with scholars based in Spain, Singapore and Israel. Oriol Farràs's co-authors include Josep Domingo‐Ferrer, Carles Padró, David Sánchez, Sara Hajian, Jaume Martí-Farré, Qianhong Wu, Bo Qin, Lei Zhang, Amos Beimel and Miquel Moretó and has published in prestigious journals such as IEEE Transactions on Information Theory, Information Sciences and IEEE Transactions on Computers.

In The Last Decade

Oriol Farràs

25 papers receiving 379 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Oriol Farràs Spain	12	321	136	90	88	64	27	402
Valeria Nikolaenko United States	4	533 1.7×	164 1.2×	65 0.7×	66 0.8×	69 1.1×	9	588
Michael Yu Zhu United States	3	509 1.6×	141 1.0×	58 0.6×	40 0.5×	29 0.5×	7	580
Rafael Dowsley United States	13	361 1.1×	212 1.6×	119 1.3×	37 0.4×	43 0.7×	34	511
Peeter Laud Estonia	12	367 1.1×	139 1.0×	156 1.7×	75 0.9×	30 0.5×	48	417
Jayakrushna Sahoo India	9	151 0.5×	126 0.9×	41 0.5×	71 0.8×	37 0.6×	30	297
Kazue Sako Japan	12	389 1.2×	141 1.0×	98 1.1×	41 0.5×	68 1.1×	36	459
Raphaël Bost France	4	754 2.3×	267 2.0×	74 0.8×	170 1.9×	165 2.6×	4	813
Nir Bitansky Israel	11	455 1.4×	215 1.6×	65 0.7×	178 2.0×	41 0.6×	23	508
Marco Gaboardi United States	14	493 1.5×	76 0.6×	66 0.7×	224 2.5×	9 0.1×	59	564
Arthur Sandor Voundi Koe China	11	190 0.6×	179 1.3×	83 0.9×	13 0.1×	32 0.5×	26	330

Countries citing papers authored by Oriol Farràs

Since Specialization

Citations

This map shows the geographic impact of Oriol Farràs's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Oriol Farràs with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Oriol Farràs more than expected).

Fields of papers citing papers by Oriol Farràs

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Oriol Farràs. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Oriol Farràs. The network helps show where Oriol Farràs may publish in the future.

Co-authorship network of co-authors of Oriol Farràs

This figure shows the co-authorship network connecting the top 25 collaborators of Oriol Farràs. A scholar is included among the top collaborators of Oriol Farràs based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Oriol Farràs. Oriol Farràs is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Farràs, Oriol, et al.. (2025). A note on extension properties and representations of matroids. Discrete Applied Mathematics. 376. 270–280.

Farràs, Oriol, et al.. (2024). Leveraging HLS to Design a Versatile & High-Performance Classic McEliece Accelerator. ACM Transactions on Embedded Computing Systems. 24(5). 1–27.

Farràs, Oriol, et al.. (2023). One-Out-of-q OT Combiners. IEEE Transactions on Information Theory. 70(4). 2984–2998. 1 indexed citations

Farràs, Oriol, et al.. (2021). HLS-Based HW/SW Co-Design of the Post-Quantum Classic McEliece Cryptosystem. UPCommons institutional repository (Universitat Politècnica de Catalunya). 52–59. 12 indexed citations

Beimel, Amos, et al.. (2021). Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. IEEE Transactions on Information Theory. 68(3). 2083–2100. 1 indexed citations

Farràs, Oriol, et al.. (2020). Improving the linear programming technique in the search for lower bounds in secret sharing. QRU Quaderns de Recerca en Urbanisme. 10 indexed citations

Farràs, Oriol, et al.. (2020). Common Information, Matroid Representation, and Secret Sharing for Matroid Ports. arXiv (Cornell University). 5 indexed citations

Domingo‐Ferrer, Josep, et al.. (2019). Privacy-preserving cloud computing on sensitive data: A survey of methods, products and challenges. Computer Communications. 140-141. 38–60. 115 indexed citations

Farràs, Oriol, et al.. (2019). Provably secure public-key encryption with conjunctive and subset keyword search. International Journal of Information Security. 18(5). 533–548. 13 indexed citations

10.

Farràs, Oriol, et al.. (2018). Local bounds for the optimal information ratio of secret sharing schemes. Designs Codes and Cryptography. 87(6). 1323–1344. 1 indexed citations

11.

Farràs, Oriol, et al.. (2016). Searchable encryption for geo-referenced data. 1 indexed citations

12.

Farràs, Oriol, et al.. (2016). On the Information Ratio of Non-perfect Secret Sharing Schemes. Algorithmica. 79(4). 987–1013. 17 indexed citations

13.

Domingo‐Ferrer, Josep, Oriol Farràs, Sergio Mart́ınez, David Sánchez, & Jordi Soria-Comas. (2016). Self-enforcing protocols via co-utile reputation management. Information Sciences. 367-368. 159–175. 14 indexed citations

14.

Wu, Qianhong, et al.. (2015). Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts. IEEE Transactions on Computers. 65(2). 466–479. 27 indexed citations

15.

Beimel, Amos, et al.. (2014). Secret-Sharing Schemes for Very Dense Graphs. Journal of Cryptology. 29(2). 336–362. 18 indexed citations

16.

Farràs, Oriol & Carles Padró. (2012). Ideal Hierarchical Secret Sharing Schemes. IEEE Transactions on Information Theory. 58(5). 3273–3286. 31 indexed citations

17.

Farràs, Oriol, et al.. (2012). Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes. Designs Codes and Cryptography. 71(3). 503–524. 2 indexed citations

18.

Farràs, Oriol, et al.. (2012). Linear threshold multisecret sharing schemes. Information Processing Letters. 112(17-18). 667–673. 1 indexed citations

19.

Qin, Bo, Qianhong Wu, Lei Zhang, Oriol Farràs, & Josep Domingo‐Ferrer. (2012). Provably secure threshold public-key encryption with adaptive security and short ciphertexts. Information Sciences. 210. 67–80. 16 indexed citations

20.

Farràs, Oriol, et al.. (2011). On the optimization of bipartite secret sharing schemes. Designs Codes and Cryptography. 63(2). 255–271. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact