Volgen
Oriol Farràs
Oriol Farràs
Universitat Rovira i Virgili
Geverifieerd e-mailadres voor urv.cat - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Privacy-preserving cloud computing on sensitive data: A survey of methods, products and challenges
J Domingo-Ferrer, O Farras, J Ribes-González, D Sánchez
Computer Communications 140, 38-60, 2019
1982019
Ideal multipartite secret sharing schemes
O Farràs, J Martí-Farré, C Padró
Journal of cryptology 25 (3), 434-463, 2012
156*2012
Ideal hierarchical secret sharing schemes
O Farras, C Padro
IEEE Transactions on Information Theory 58 (5), 3273-3286, 2012
1202012
Generalization-based privacy preservation and discrimination prevention in data publishing and mining
S Hajian, J Domingo-Ferrer, O Farràs
Data Mining and Knowledge Discovery 28, 1158-1188, 2014
802014
Bridging broadcast encryption and group key agreement
Q Wu, B Qin, L Zhang, J Domingo-Ferrer, O Farras
Advances in Cryptology–ASIACRYPT 2011: 17th International Conference on the …, 2011
602011
On the information ratio of non-perfect secret sharing schemes
O Farràs, TB Hansen, T Kaced, C Padró
Algorithmica 79, 987-1013, 2017
58*2017
Secret-sharing schemes for general and uniform access structures
B Applebaum, A Beimel, O Farràs, O Nir, N Peter
Annual International Conference on the Theory and Applications of …, 2019
562019
Secret-Sharing Schemes for Very Dense Graphs
A Beimel, O Farràs, Y Mintz
Journal of Cryptology 29 (2), 336-362, 2016
48*2016
Natural generalizations of threshold secret sharing
O Farras, C Padró, C Xing, A Yang
IEEE transactions on information theory 60 (3), 1652-1664, 2014
452014
Improving the linear programming technique in the search for lower bounds in secret sharing
O Farràs, T Kaced, S Martín, C Padró
IEEE Transactions on Information Theory 66 (11), 7088-7100, 2020
442020
Linear secret-sharing schemes for forbidden graph access structures
A Beimel, O Farràs, Y Mintz, N Peter
IEEE Transactions on Information Theory 68 (3), 2083-2100, 2021
402021
On the optimization of bipartite secret sharing schemes
O Farràs, JR Metcalf-Burton, C Padró, L Vázquez
Designs, Codes and Cryptography 63, 255-271, 2012
372012
Self-enforcing protocols via co-utile reputation management
J Domingo-Ferrer, O Farras, S Martinez, D Sánchez, J Soria-Comas
Information Sciences 367, 159-175, 2016
352016
Provably secure public-key encryption with conjunctive and subset keyword search
O Farràs, J Ribes-González
International Journal of Information Security 18 (5), 533-548, 2019
272019
Provably secure threshold public-key encryption with adaptive security and short ciphertexts
B Qin, Q Wu, L Zhang, O Farras, J Domingo-Ferrer
Information Sciences 210, 67-80, 2012
262012
Hls-based hw/sw co-design of the post-quantum classic mceliece cryptosystem
V Kostalabros, J Ribes-González, O Farràs, M Moretó, C Hernandez
2021 31st International Conference on Field-Programmable Logic and …, 2021
202021
The share size of secret-sharing schemes for almost all access structures and graphs
A Beimel, O Farràs
Theory of Cryptography Conference, 499-529, 2020
192020
Secret sharing schemes for dense forbidden graphs
A Beimel, O Farràs, N Peter
International Conference on Security and Cryptography for Networks, 509-528, 2016
132016
Extending Brickell–Davenport theorem to non-perfect secret sharing schemes
O Farras, C Padró
Designs, Codes and Cryptography 74, 495-510, 2015
132015
Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes
K Stokes, O Farràs
Designs, codes and cryptography 71, 503-524, 2014
132014
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20